default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Hickingbotham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Vida Dujmovic, Robert Hickingbotham
, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. Comb. Probab. Comput. 33(1): 85-90 (2024)- [j11]Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood:
Product structure of graph classes with bounded treewidth. Comb. Probab. Comput. 33(3): 351-376 (2024) - [j10]David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood:
Three-Dimensional Graph Products with Unbounded Stack-Number. Discret. Comput. Geom. 71(4): 1210-1237 (2024) - [j9]Robert Hickingbotham, Paul Jungeblut, Laura Merker, David R. Wood:
The product structure of squaregraphs. J. Graph Theory 105(2): 179-191 (2024) - [j8]Robert Hickingbotham, Freddie Illingworth, Bojan Mohar, David R. Wood:
Treewidth, Circle Graphs, and Circular Drawings. SIAM J. Discret. Math. 38(1): 965-987 (2024) - [j7]Robert Hickingbotham, David R. Wood:
Shallow Minors, Graph Products, and Beyond-Planar Graphs. SIAM J. Discret. Math. 38(1): 1057-1089 (2024) - [j6]Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michal T. Seweryn, David R. Wood:
Product Structure Extension of the Alon-Seymour-Thomas Theorem. SIAM J. Discret. Math. 38(3): 2095-2107 (2024) - [c1]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The Grid-Minor Theorem Revisited. SODA 2024: 1241-1245 - 2023
- [j5]Robert Hickingbotham:
Odd colourings, conflict-free colourings and strong colouring numbers. Australas. J Comb. 87: 160-164 (2023) - [j4]Robert Hickingbotham:
Induced Subgraphs and Path Decompositions. Electron. J. Comb. 30(2) (2023) - [j3]Rutger Campbell, Marc Distel, J. Pascal Gollin, Daniel J. Harvey, Kevin Hendrey, Robert Hickingbotham, Bojan Mohar, David R. Wood:
Graphs of Linear Growth have Bounded Treewidth. Electron. J. Comb. 30(3) (2023) - [i5]Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. CoRR abs/2303.14970 (2023) - [i4]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The grid-minor theorem revisited. CoRR abs/2307.02816 (2023) - 2022
- [j2]Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood:
Stack-Number is Not Bounded by Queue-Number. Comb. 42(2): 151-164 (2022) - [j1]Marc Distel, Robert Hickingbotham, Tony Huynh, David R. Wood:
Improved product structure for graphs on surfaces. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [i3]David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood:
Three-dimensional graph products with unbounded stack-number. CoRR abs/2202.05327 (2022) - [i2]Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood:
Product structure of graph classes with bounded treewidth. CoRR abs/2206.02395 (2022) - 2020
- [i1]Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood:
Stack-number is not bounded by queue-number. CoRR abs/2011.04195 (2020)
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 2024-08-23 18:28 CEST 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:
