Difference between revisions of "Landon Rabern"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 2: | Line 2: | ||
'''Landon W. Rabern''',<br/> | '''Landon W. Rabern''',<br/> | ||
| − | an American mathematician and software engineer in the AI industry. His research interests include [https://en.wikipedia.org/wiki/Combinatorics combinatorics] and [https://en.wikipedia.org/wiki/Graph_theory graph theory], such as [https://en.wikipedia.org/wiki/Clique_problem clique problems | + | an American mathematician and software engineer in the AI industry. His research interests include [https://en.wikipedia.org/wiki/Combinatorics combinatorics] and [https://en.wikipedia.org/wiki/Graph_theory graph theory], such as [https://en.wikipedia.org/wiki/Clique_problem clique problems], [https://en.wikipedia.org/wiki/Graph_coloring graph coloring] and [https://en.wikipedia.org/wiki/Edge_coloring edge coloring]. |
He holds a B.Sc. from [https://en.wikipedia.org/wiki/Washington_University_in_St._Louis Washington University in St. Louis] in 2003, | He holds a B.Sc. from [https://en.wikipedia.org/wiki/Washington_University_in_St._Louis Washington University in St. Louis] in 2003, | ||
a M.Sc. from [https://en.wikipedia.org/wiki/University_of_California,_Santa_Barbara University of California, Santa Barbara] in 2005, and | a M.Sc. from [https://en.wikipedia.org/wiki/University_of_California,_Santa_Barbara University of California, Santa Barbara] in 2005, and | ||
Revision as of 16:17, 5 January 2020
Landon W. Rabern,
an American mathematician and software engineer in the AI industry. His research interests include combinatorics and graph theory, such as clique problems, graph coloring and edge coloring.
He holds a B.Sc. from Washington University in St. Louis in 2003,
a M.Sc. from University of California, Santa Barbara in 2005, and
a Ph.D. from Arizona State University in 2013.
As a computer chess programmer, Landon Rabern is author the WinBoard compatible chess engine Betsy [1], which was the first published chess engine able to play Chess960 [2].
Contents
Selected Publications
2003
- Landon W. Rabern (2003). Properties of Magic Squares of Squares. Rose-Hulman Undergraduate Mathematics Journal, Vol. 4, No. 1
2005 ...
- Landon Rabern (2005). Some bounds on convex combinations of ω and χ for decompositions into many parts. arXiv:math/0512291
- Landon Rabern (2006). New upper bounds on the chromatic number of a graph. arXiv:math/0606632
- Landon Rabern (2006). On Graph Associations. SIAM Journal on Discrete Mathematics, Vol. 20, No. 2
- Landon Rabern (2007). The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge. Electronic Journal of Combinatorics, Vol. 14
- Landon Rabern (2008). A Note On Reed's Conjecture. SIAM Journal on Discrete Mathematics, Vol. 22, No. 2 [4]
- Landon Rabern (2009). On hitting all maximum cliques with an independent set. arXiv:0907.3705
2010 ...
- Landon Rabern (2011). An improvement on Brooks' Theorem. arXiv:1102.1021 [5]
- Landon Rabern (2011). A note on vertex partitions. arXiv:1107.1735
- Landon Rabern (2012). Partitioning and coloring with degree constraints. arXiv:1202.5855
- Landon Rabern (2012). A different short proof of Brooks' theorem. arXiv:1205.3253
- Landon Rabern (2012). Coloring graphs with dense neighborhoods. arXiv:1209.3646
- Landon Rabern (2013). Coloring graphs from almost maximum degree sized palettes. Ph.D. thesis, Arizona State University, advisor: [[Mathematician#HAKierstead|Henry A. Kierstead], pdf
- Daniel W. Cranston, Landon Rabern (2014). Brooks' Theorem and Beyond. arXiv:1403.0479
- Hal Kierstead, Landon Rabern (2014). Improved lower bounds on the number of edges in list critical and online list critical graphs. arXiv:1406.7355
2015 ...
- Daniel W. Cranston, Landon Rabern (2015). Subcubic edge chromatic critical graphs have many edges. arXiv:1506.04225
- Daniel W. Cranston, Landon Rabern (2015). Edge-coloring via fixable subgraphs. arXiv:1507.05600
- Hal Kierstead, Landon Rabern (2015). Extracting list colorings from large independent sets. arXiv:1512.08130
- Landon Rabern (2016). A better lower bound on average degree of 4-list-critical graphs. arXiv:1602.08532
- Landon Rabern (2016). A better lower bound on average degree of k-list-critical graphs. arXiv:1608.06989
- Daniel W. Cranston, Landon Rabern (2017). The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4. arXiv:1703.00959
Forum Posts
- Betsy 5.0 is now winboard compatable by Landon Rabern, CCC, September 06, 2000
- Betsy 5.26 by Landon Rabern, CCC, July 06, 2001
External Links
- landon rabern | LinkedIn
- landon rabern - Google Scholar Citations
- Landon Rabern - The Mathematics Genealogy Project
