Derrick Stolee

According to our database, Derrick Stolee authored at least 25 papers between 2009 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2018

Ramsey Numbers for Partially-Ordered Sets.

Christopher Cox, Derrick Stolee

Order, 2018

Extending precolorings to distinguish group actions.

Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger

Eur. J. Comb., 2018

Choosability with union separation.

Mohit Kumbhat, Kevin Moss, Derrick Stolee

Discret. Math., 2018

On the Strong Chromatic Index of Sparse Graphs.

Philip DeOrsey, Michael Ferrara, Nathan Graber, Stephen G. Hartke, Luke L. Nelsen, Eric Sullivan, Sogol Jahanbekam, Bernard Lidický, Derrick Stolee, Jennifer White

Electron. J. Comb., 2018

2017

(4, 2)-Choosability of Planar Graphs with Forbidden Structures.

Zhanar Berikkyzy, Christopher Cox, Michael Dairyko, Kirsten Hogenson, Mohit Kumbhat, Bernard Lidický, Kacy Messerschmidt, Kevin Moss, Kathleen Nowak, Kevin F. Palmowski, Derrick Stolee

Graphs Comb., 2017

Color-blind index in graphs of very low degree.

Jennifer Diemunsch, Nathan Graber, Lucas Kramer, Victor Larsen, Lauren M. Nelsen, Luke L. Nelsen, Devon Sigler, Derrick Stolee, Charlie Suer

Discret. Appl. Math., 2017

2016

On Choosability with Separation of Planar Graphs with Forbidden Cycles.

Ilkyoo Choi, Bernard Lidický, Derrick Stolee

J. Graph Theory, 2016

Partitioning a Graph into Highly Connected Subgraphs.

Valentin Borozan, Michael Ferrara, Shinya Fujita, Michitaka Furuya, Yannis Manoussakis, Narayanan Narayanan, Derrick Stolee

J. Graph Theory, 2016

I, F-partitions of sparse graphs.

Axel Brandt, Michael Ferrara, Mohit Kumbhat, Sarah Loeb, Derrick Stolee, Matthew P. Yancey

Eur. J. Comb., 2016

Ordered Ramsey numbers of loose paths and matchings.

Christopher Cox, Derrick Stolee

Discret. Math., 2016

On the independence ratio of distance graphs.

James M. Carraher, David J. Galvin, Stephen G. Hartke, A. J. Radcliffe, Derrick Stolee

Discret. Math., 2016

2014

A linear programming approach to the Manickam-Miklós-Singhi conjecture.

Stephen G. Hartke, Derrick Stolee

Eur. J. Comb., 2014

Automated Discharging Arguments for Density Problems in Grids.

Derrick Stolee

CoRR, 2014

ReachFewL = ReachUL.

Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran

Comput. Complex., 2014

Automorphism groups and adversarial vertex deletions.

Derrick Stolee

Australas. J Comb., 2014

2013

Extremal Graphs With a Given Number of Perfect Matchings.

Stephen G. Hartke, Derrick Stolee, Douglas B. West, Matthew P. Yancey

J. Graph Theory, 2013

List distinguishing parameters of trees.

Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger

Discret. Appl. Math., 2013

A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture

Stephen G. Hartke, Derrick Stolee

CoRR, 2013

2012

On the hardness of recognizing triangular line graphs.

Pranav Anand, Henry Escuadro, Ralucca Gera, Stephen G. Hartke, Derrick Stolee

Discret. Math., 2012

Uniquely K_r-Saturated Graphs

Stephen G. Hartke, Derrick Stolee

CoRR, 2012

Uniquely K_r-Saturated Graphs.

Stephen G. Hartke, Derrick Stolee

Electron. J. Comb., 2012

2010

Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs.

Derrick Stolee, N. V. Vinodchandran

Electron. Colloquium Comput. Complex., 2010

Automorphism Groups of a Graph and a Vertex-Deleted Subgraph.

Stephen G. Hartke, Hannah Kolb, Jared Nishikawa, Derrick Stolee

Electron. J. Comb., 2010

A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources.

Derrick Stolee, Chris Bourke, N. V. Vinodchandran

Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010

2009

A log-space algorithm for reachability in planar DAGs with few sources.

Derrick Stolee, Chris Bourke, N. V. Vinodchandran

Electron. Colloquium Comput. Complex., 2009