Derrick Stolee
Derrick Stolee
Verified email at - Homepage
Cited by
Cited by
Ordered Ramsey theory and track representations of graphs
KG Milans, D Stolee, DB West
Journal of Combinatorics 6 (4), 445-456, 2015
Rainbow arithmetic progressions
S Butler, C Erickson, L Hogben, K Hogenson, L Kramer, RL Kramer, ...
Journal of Combinatorics 7 (4), 595-626, 2016
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
D Stolee, NV Vinodchandran
27th Annual IEEE Conference on Computational Complexity (CCC), 326-333, 2012
On the hardness of recognizing triangular line graphs
P Anand, H Escuadro, R Gera, SG Hartke, D Stolee
Discrete Mathematics 312 (17), 2627-2638, 2012
On choosability with separation of planar graphs with forbidden cycles
I Choi, B Lidický, D Stolee
Journal of Graph Theory 81 (3), 283-306, 2016
Extremal graphs with a given number of perfect matchings
SG Hartke, D Stolee, DB West, M Yancey
Journal of Graph Theory 13 (4), 449-468, 2012
A linear programming approach to the Manickam–Miklós–Singhi conjecture
SG Hartke, D Stolee
European Journal of Combinatorics 36, 53-70, 2014
Ramsey numbers for partially-ordered sets
C Cox, D Stolee
Order 35 (3), 557-579, 2018
A log-space algorithm for reachability in planar DAGs with few sources
D Stolee, C Bourke, NV Vinodchandran
Proceedings of the 25th Conference on Computational Complexity, 2010
ReachFewL= ReachUL
B Garvin, D Stolee, R Tewari, N Vinodchandran
Computing and Combinatorics, 252-258, 2011
Ordered Ramsey numbers of loose paths and matchings
C Cox, D Stolee
Discrete Mathematics 339 (2), 499-505, 2016
On the Strong Chromatic Index of Sparse Graphs
P DeOrsey, J Diemunsch, M Ferrara, N Graber, SG Hartke, ...
arXiv preprint arXiv:1508.03515, 2015
Uniquely Kr-Saturated Graphs
SG Hartke, D Stolee
The Electronic Journal of Combinatorics 19 (4), P6, 2012
Isomorph-free generation of 2-connected graphs with applications
D Stolee
Arxiv preprint arXiv:1104.5261, 2011
List Distinguishing Parameters of Trees
M Ferrara, E Gethner, SG Hartke, D Stolee, PS Wenger
Discrete Applied Mathematics 161 (6), 964-969, 2013
Extending precolorings to distinguish group actions
M Ferrara, E Gethner, SG Hartke, D Stolee, PS Wenger
European Journal of Combinatorics 72, 12-28, 2018
On the independence ratio of distance graphs
JM Carraher, D Galvin, SG Hartke, AJ Radcliffe, D Stolee
Discrete Mathematics 339 (12), 3058-3072, 2016
I, F-partitions of sparse graphs
A Brandt, M Ferrara, M Kumbhat, S Loeb, D Stolee, M Yancey
European Journal of Combinatorics 57, 1-12, 2016
Automorphism groups of a graph and a vertex-deleted subgraph
SG Hartke, H Kolb, J Nishikawa, D Stolee
The Electronic Journal of Combinatorics 17 (R134), 2010
Choosability with union separation
M Kumbhat, K Moss, D Stolee
Discrete Mathematics 341 (3), 600-605, 2018
The system can't perform the operation now. Try again later.
Articles 1–20