Derrick Stolee

29 papers A 2Misc 1Journal 26
YearRankTypeTitle / Venue / Authors
2018 J jnl
Choosability with union separation.
Discret. Math.
Mohit Kumbhat, Kevin Moss, Derrick Stolee
2018 J jnl
Extending precolorings to distinguish group actions.
Eur. J. Comb.
Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger
2018 J jnl
On the Strong Chromatic Index of Sparse Graphs.
Electron. J. Comb.
Philip DeOrsey, Michael Ferrara, Nathan Graber, Stephen G. Hartke, Luke L. Nelsen, Eric Sullivan, Sogol Jahanbekam, Bernard Lidický, Derrick Stolee, Jennifer White
2018 J jnl
Ramsey Numbers for Partially-Ordered Sets.
Order
Christopher Cox, Derrick Stolee
2017 J jnl
(4, 2)-Choosability of Planar Graphs with Forbidden Structures.
Graphs Comb.
Zhanar Berikkyzy, Christopher Cox, Michael Dairyko, Kirsten Hogenson, Mohit Kumbhat, Bernard Lidický, Kacy Messerschmidt, Kevin Moss, Kathleen Nowak, Kevin F. Palmowski, Derrick Stolee
2017 J jnl
Color-blind index in graphs of very low degree.
Discret. Appl. Math.
Jennifer Diemunsch, Nathan Graber, Lucas Kramer, Victor Larsen, Lauren M. Nelsen, Luke L. Nelsen, Devon Sigler, Derrick Stolee, Charlie Suer
2016 J jnl
I, F-partitions of sparse graphs.
Eur. J. Comb.
Axel Brandt, Michael Ferrara, Mohit Kumbhat, Sarah Loeb, Derrick Stolee, Matthew P. Yancey
2016 J jnl
On Choosability with Separation of Planar Graphs with Forbidden Cycles.
J. Graph Theory
Ilkyoo Choi, Bernard Lidický, Derrick Stolee
2016 J jnl
On the independence ratio of distance graphs.
Discret. Math.
James M. Carraher, David J. Galvin, Stephen G. Hartke, A. J. Radcliffe, Derrick Stolee
2016 J jnl
Ordered Ramsey numbers of loose paths and matchings.
Discret. Math.
Christopher Cox, Derrick Stolee
2016 J jnl
Partitioning a Graph into Highly Connected Subgraphs.
J. Graph Theory
Valentin Borozan, Michael Ferrara, Shinya Fujita, Michitaka Furuya, Yannis Manoussakis, Narayanan Narayanan, Derrick Stolee
2015 J jnl
I, F-partitions of Sparse Graphs.
CoRR
Axel Brandt, Michael Ferrara, Mohit Kumbhat, Sarah Loeb, Derrick Stolee, Matthew P. Yancey
2014 J jnl
A linear programming approach to the Manickam-Miklós-Singhi conjecture.
Eur. J. Comb.
Stephen G. Hartke, Derrick Stolee
2014 J jnl
Automated Discharging Arguments for Density Problems in Grids.
CoRR
Derrick Stolee
2014 J jnl
Automorphism groups and adversarial vertex deletions.
Australas. J Comb.
Derrick Stolee
2014 J jnl
ReachFewL = ReachUL.
Comput. Complex.
Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
2013 J jnl
A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture
CoRR
Stephen G. Hartke, Derrick Stolee
2013 J jnl
Extremal Graphs With a Given Number of Perfect Matchings.
J. Graph Theory
Stephen G. Hartke, Derrick Stolee, Douglas B. West, Matthew P. Yancey
2013 J jnl
List distinguishing parameters of trees.
Discret. Appl. Math.
Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger
2012 J jnl
On the hardness of recognizing triangular line graphs.
Discret. Math.
Pranav Anand, Henry Escuadro, Ralucca Gera, Stephen G. Hartke, Derrick Stolee
2012 A conf
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs.
CCC
Derrick Stolee, N. V. Vinodchandran
2012 J jnl
Uniquely K
Electron. J. Comb.
Stephen G. Hartke, Derrick Stolee
2012 J jnl
Uniquely K_r-Saturated Graphs
CoRR
Stephen G. Hartke, Derrick Stolee
2011 Misc conf
ReachFewL = ReachUL.
COCOON
Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
2011 J jnl
ReachFewL = ReachUL.
Electron. Colloquium Comput. Complex.
Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran
2010 A conf
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources.
CCC
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
2010 J jnl
Automorphism Groups of a Graph and a Vertex-Deleted Subgraph.
Electron. J. Comb.
Stephen G. Hartke, Hannah Kolb, Jared Nishikawa, Derrick Stolee
2010 J jnl
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs.
Electron. Colloquium Comput. Complex.
Derrick Stolee, N. V. Vinodchandran
2009 J jnl
A log-space algorithm for reachability in planar DAGs with few sources.
Electron. Colloquium Comput. Complex.
Derrick Stolee, Chris Bourke, N. V. Vinodchandran