Research Papers

Submitted

C. Cox, D. Stolee, Ramsey numbers for partially-ordered sets.
Web Version Project

Z. Berikkyzy, C. Cox, M. Dairyko, K. Hogenson, M. Kumbhat, B. Lidický, K. Messerschmidt, K. Moss, K. Nowak, K. F. Palmowski, D. Stolee, $(4,2)$-choosability of planar graphs with forbidden structures.
Web Version ArXiv Version Project

A. Brandt, M. Ferrara, M. Kumbhat, S. Loeb, D. Stolee, M. Yancey, I,F-Partitions of sparse graphs.
Web Version ArXiv Version Project

Philip DeOrsey, Jennifer Diemunsch, Michael Ferrara, Nathan Graber, Stephen G. Harke, Sogol Jahanebkam, Bernard Lidický, Luke Nelsen, Derrick Stolee, Eric Sullivan, On the Strong Chromatic Index of Sparse Graphs
Web Version Project

J. Diemunsch, N. Graber, L. Kramer, V. Larsen, L.M. Nelsen, L.L. Nelsen, D. Sigler, D. Stolee, C. Suer, Color-blind index in graphs of very low degree.
Web Version ArXiv Version Project

D. Stolee, Automated Discharging Arguments for Density Problems in Grids (Extended Abstract) submitted.
Web Version ArXiv Version Project

M. Ferrara, E. Gethner, S. G. Hartke, D. Stolee, P. S. Wenger, Extending Precolorings to Distinguish Group Actions, submitted.
Web Version ArXiv Version Project

S. Butler, C. Erickson, L. Hogben, K. Hogenson, L. Kramer, R. L. Kramer, J. C.-H. Lin, R. R. Martin, D. Stolee, N. Warnberg, and M. Young, Rainbow arithmetic progressions submitted.
Web Version ArXiv Version Project

J. M. Carraher, D. Galvin, S. G. Hartke, A. J. Radcliffe, D. Stolee, On the independence ratio of distance graphs.
Web Version ArXiv Version Project

To Appear

V. Borozan, M. Ferrara, S. Fujita, M. Furuya, Y. Manoussakis, Narayanan N, and D. Stolee, Partitioning a graph into highly connected subgraphs, to appear in Journal of Graph Theory.
Web Version ArXiv Version Official Version Project

I. Choi, B. Lidický, D. Stolee, On Choosability with Separation of Planar Graphs with Forbidden Cycles, to appear in Journal of Graph Theory
Web Version ArXiv Version Official Version

2016

C. Cox, D. Stolee, Ordered Ramsey numbers of loose paths and matchings, Discrete Mathematics 339(2) (2016) 499-505.
Web Version arXiv Version Official Version Research Project

2015

K. G. Milans, D. Stolee, D. B. West, Ordered Ramsey Theory and Track Representations of Graphs, Journal of Combinatorics 6(4) (2015) 445-456.
Web Version Official Version Research Project

2014

D. Stolee, Automorphism Groups and Adversarial Vertex Deletions, Australasian Journal of Combinatorics 60(1) (2014), pp. 27-34.
Web Version ArXiv Version Research Project

B. Garvin, R. Tewari, D. Stolee, N. V. Vinodchandran, ReachFewL = ReachUL, Computational Complexity 23(1) (2014), pp 85-98. Conference version in COCOON 2011.
Web Version Official Version Research Project

S. G. Hartke, D. Stolee, A linear programming approach to the Manickam-Miklós-Singhi Conjecture, European Journal of Combinatorics 36 (2014) 53-70.
Web Version ArXiv Version Official Version Research Project

2013

S. G. Hartke, D. Stolee, D. B. West, M. Yancey, On extremal graphs with a given number of perfect matchings, Journal of Graph Theory, 73(4), 449-468.
Web Version Official Version Research Project

M. Ferrara, E. Gethner, S. G. Hartke, D. Stolee, P. S. Wenger, List Distinguishing Parameters of Trees, Discrete Applied Mathematics, 161, 864-869.
Web Version ArXiv Version Official Version Research Project

2012

S. G. Hartke, D. Stolee, Uniquely K_r-saturated graphs, Electronic Journal of Combinatorics 19(4), P6, 40 pages.
Web Version ArXiv Version Official Version Research Project

P. Anand, H. Escuadro, R. Gera, S. G. Hartke, D. Stolee, On the hardness of recognizing triangular line graphs, Discrete Mathematics, 312, 2627-2638.
Web Version ArXiv Version Official Version Research Project

D. Stolee, N.V. Vinodchandran, Space-efficient algorithms for reachability in surface-embedded graphs, 27th IEEE Conference on Computational Complexity, 326-333.
Web Version ECCC Version Official Version Research Project

2010

S. G. Hartke, H. Kolb, J. Nishikawa, D. Stolee, Automorphism groups of a graph and a vertex-deleted subgraph, Electronic Journal of Combinatorics 17(1) R134.
Web Version ArXiv Version Official Version Research Project

D. Stolee, C. Bourke, N. V. Vinodchandran, A log-space algorithm for reachability in planar acyclic digraphs with few sources, The 25th Annual Computational Complexity Conference (2010).
Web Version ECCC Version Published Version Research Project

Unpublished Manuscripts

D. Stolee, Generating p-extremal graphs, (2011).
Web Version ArXiv Version Research Project

D. Stolee, Isomorph-free generation of 2-connected graphs with applications, UNL-CSE Technical Report #120, (2011).
Web Version ArXiv Version Research Project

Other Links

Research browser

List of research software

List of research data

List of research presentations