default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin R. Moore
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Rutger Campbell, Florian Hörsch, Benjamin R. Moore:
Decompositions into two linear forests of bounded lengths. Discret. Math. 347(6): 113962 (2024)- 2023
- [j10]Alvaro Carbonero, Patrick Hompe
, Benjamin R. Moore, Sophie Spirkl:
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number. J. Comb. Theory B 158(Part): 63-69 (2023) - [j9]Benjamin R. Moore, Luke Postle, Lise Turner:
Local Hadwiger's Conjecture. J. Comb. Theory B 162: 154-183 (2023) - [j8]Richard C. Brewster, Benjamin R. Moore:
Characterizing circular colouring mixing for p q 4 $\frac{p}{q}\lt 4$. J. Graph Theory 102(2): 271-294 (2023) - [j7]Benjamin R. Moore, Evelyne Smith-Roberge:
A density bound for triangle-free 4-critical graphs. J. Graph Theory 103(1): 66-111 (2023) - [i8]Rutger Campbell, Florian Hörsch, Benjamin R. Moore:
Decompositions into two linear forests of bounded lengths. CoRR abs/2301.11615 (2023) - [i7]Pedro P. Cortés, Pankaj Kumar, Benjamin R. Moore, Patrice Ossona de Mendez, Daniel A. Quiroz:
Subchromatic numbers of powers of graphs with excluded minors. CoRR abs/2306.02195 (2023) - 2022
- [j6]Alvaro Carbonero, Patrick Hompe, Benjamin R. Moore, Sophie Spirkl:
Digraphs with All Induced Directed Cycles of the Same Length are not $\vec{\chi}$-Bounded. Electron. J. Comb. 29(4) (2022) - [i6]Benjamin R. Moore, Luke Postle, Lise Turner:
Local Hadwiger's Conjecture. CoRR abs/2203.06718 (2022) - [i5]Zdenek Dvorák, Benjamin R. Moore, Abhiruk Lahiri:
Square roots of nearly planar graphs. CoRR abs/2205.12764 (2022) - 2021
- [j5]Benjamin R. Moore, Douglas B. West:
Cycles in Color-Critical Graphs. Electron. J. Comb. 28(4) (2021) - 2020
- [j4]Logan Grout, Benjamin R. Moore:
The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true. J. Comb. Theory B 145: 433-449 (2020) - [j3]Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers:
Graph homomorphism reconfiguration and frozen H-colorings. J. Graph Theory 94(3): 398-420 (2020) - [j2]Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring spanning and induced subgraphs. Theor. Comput. Sci. 806: 553-566 (2020)
2010 – 2019
- 2018
- [c2]Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring Spanning and Induced Subgraphs. COCOON 2018: 428-440 - [c1]Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya:
Reconfiguration of Graph Minors. MFCS 2018: 75:1-75:15 - [i4]Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring spanning and induced subgraphs. CoRR abs/1803.06074 (2018) - [i3]Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya:
Reconfiguration of graph minors. CoRR abs/1804.09240 (2018) - 2017
- [i2]Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers:
Graph Homomorphism Reconfiguration and Frozen H-Colourings. CoRR abs/1712.00200 (2017) - 2016
- [j1]Richard C. Brewster, Sean McGuinness, Benjamin R. Moore, Jonathan A. Noel:
A dichotomy theorem for circular colouring reconfiguration. Theor. Comput. Sci. 639: 1-13 (2016) - 2015
- [i1]Richard C. Brewster, Sean McGuinness, Benjamin R. Moore, Jonathan A. Noel:
A Dichotomy Theorem for Circular Colouring Reconfiguration. CoRR abs/1508.05573 (2015)
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-06-10 21:23 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:
