default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDerrick Stolee
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j19]Philip DeOrsey, Michael Ferrara, Nathan Graber, Stephen G. Hartke, Luke L. Nelsen, Eric Sullivan, Sogol Jahanbekam, Bernard Lidický, Derrick Stolee, Jennifer White:
On the Strong Chromatic Index of Sparse Graphs. Electron. J. Comb. 25(3): 3 (2018)- [j18]Mohit Kumbhat, Kevin Moss, Derrick Stolee:
Choosability with union separation. Discret. Math. 341(3): 600-605 (2018) - [j17]Michael Ferrara, Ellen Gethner, Stephen G. Hartke
, Derrick Stolee, Paul S. Wenger:
Extending precolorings to distinguish group actions. Eur. J. Comb. 72: 12-28 (2018) - [j16]Christopher Cox, Derrick Stolee:
Ramsey Numbers for Partially-Ordered Sets. Order 35(3): 557-579 (2018) - 2017
- [j15]Jennifer Diemunsch, Nathan Graber, Lucas Kramer, Victor Larsen, Lauren M. Nelsen, Luke L. Nelsen, Devon Sigler, Derrick Stolee, Charlie Suer:
Color-blind index in graphs of very low degree. Discret. Appl. Math. 225: 122-129 (2017) - [j14]Zhanar Berikkyzy, Christopher Cox, Michael Dairyko, Kirsten Hogenson, Mohit Kumbhat, Bernard Lidický, Kacy Messerschmidt, Kevin Moss, Kathleen Nowak, Kevin F. Palmowski, Derrick Stolee:
(4, 2)-Choosability of Planar Graphs with Forbidden Structures. Graphs Comb. 33(4): 751-787 (2017) - 2016
- [j13]Christopher Cox, Derrick Stolee:
Ordered Ramsey numbers of loose paths and matchings. Discret. Math. 339(2): 499-505 (2016) - [j12]James M. Carraher, David J. Galvin, Stephen G. Hartke, A. J. Radcliffe, Derrick Stolee:
On the independence ratio of distance graphs. Discret. Math. 339(12): 3058-3072 (2016) - [j11]Axel Brandt, Michael Ferrara, Mohit Kumbhat, Sarah Loeb, Derrick Stolee, Matthew P. Yancey:
I, F-partitions of sparse graphs. Eur. J. Comb. 57: 1-12 (2016) - [j10]Ilkyoo Choi, Bernard Lidický, Derrick Stolee:
On Choosability with Separation of Planar Graphs with Forbidden Cycles. J. Graph Theory 81(3): 283-306 (2016) - [j9]Valentin Borozan, Michael Ferrara, Shinya Fujita, Michitaka Furuya, Yannis Manoussakis, Narayanan Narayanan, Derrick Stolee:
Partitioning a Graph into Highly Connected Subgraphs. J. Graph Theory 82(3): 322-333 (2016) - 2015
- [i7]Axel Brandt, Michael Ferrara, Mohit Kumbhat, Sarah Loeb, Derrick Stolee, Matthew P. Yancey:
I, F-partitions of Sparse Graphs. CoRR abs/1510.03381 (2015) - 2014
- [j8]Derrick Stolee:
Automorphism groups and adversarial vertex deletions. Australas. J Comb. 60: 27-34 (2014) - [j7]Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. Comput. Complex. 23(1): 85-98 (2014) - [j6]Stephen G. Hartke, Derrick Stolee:
A linear programming approach to the Manickam-Miklós-Singhi conjecture. Eur. J. Comb. 36: 53-70 (2014) - [i6]Derrick Stolee:
Automated Discharging Arguments for Density Problems in Grids. CoRR abs/1409.5922 (2014) - 2013
- [j5]Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger:
List distinguishing parameters of trees. Discret. Appl. Math. 161(6): 864-869 (2013) - [j4]Stephen G. Hartke, Derrick Stolee, Douglas B. West, Matthew P. Yancey:
Extremal Graphs With a Given Number of Perfect Matchings. J. Graph Theory 73(4): 449-468 (2013) - [i5]Stephen G. Hartke, Derrick Stolee:
A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture. CoRR abs/1302.3636 (2013) - 2012
- [j3]Stephen G. Hartke, Derrick Stolee:
Uniquely Kr-Saturated Graphs. Electron. J. Comb. 19(4): 6 (2012) - [j2]Pranav Anand, Henry Escuadro, Ralucca Gera, Stephen G. Hartke, Derrick Stolee:
On the hardness of recognizing triangular line graphs. Discret. Math. 312(17): 2627-2638 (2012) - [c3]Derrick Stolee, N. V. Vinodchandran:
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. CCC 2012: 326-333 - [i4]Stephen G. Hartke, Derrick Stolee:
Uniquely K_r-Saturated Graphs. CoRR abs/1203.1084 (2012) - 2011
- [c2]Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. COCOON 2011: 252-258 - [i3]Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
ReachFewL = ReachUL. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j1]Stephen G. Hartke, Hannah Kolb, Jared Nishikawa, Derrick Stolee:
Automorphism Groups of a Graph and a Vertex-Deleted Subgraph. Electron. J. Comb. 17(1) (2010) - [c1]Derrick Stolee, Chris Bourke, N. V. Vinodchandran:
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. CCC 2010: 131-138 - [i2]Derrick Stolee, N. V. Vinodchandran:
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [i1]Derrick Stolee, Chris Bourke, N. V. Vinodchandran:
A log-space algorithm for reachability in planar DAGs with few sources. Electron. Colloquium Comput. Complex. TR09 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
