default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRose McCarty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j9]James Davies, Tomasz Krawczyk, Rose McCarty
, Bartosz Walczak:
Grounded L-Graphs Are Polynomially χ-Bounded. Discret. Comput. Geom. 70(4): 1523-1550 (2023)- [j8]Jim Geelen, O-joung Kwon, Rose McCarty, Paul Wollan:
The Grid Theorem for vertex-minors. J. Comb. Theory B 158(Part): 93-116 (2023) - [j7]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Coloring polygon visibility graphs and their generalizations. J. Comb. Theory B 161: 268-300 (2023) - 2021
- [j6]O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan:
Obstructions for bounded shrub-depth and rank-depth. J. Comb. Theory B 149: 76-91 (2021) - [j5]Rose McCarty:
Dense Induced Subgraphs of Dense Bipartite Graphs. SIAM J. Discret. Math. 35(2): 661-667 (2021) - [j4]Zdenek Dvorák, Rose McCarty, Sergey Norin:
Sublinear Separators in Intersection Graphs of Convex Shapes. SIAM J. Discret. Math. 35(2): 1149-1164 (2021) - 2020
- [j3]Rose McCarty, Yan Wang, Xingxing Yu:
7-Connected graphs are 4-ordered. J. Comb. Theory B 141: 115-135 (2020) - 2019
- [j2]Rose McCarty, Robin Thomas:
The Extremal Function for Bipartite Linklessly Embeddable Graphs. Comb. 39(5): 1081-1104 (2019) - 2018
- [j1]Rose McCarty:
The Extremal Function and Colin de Verdière Graph Parameter. Electron. J. Comb. 25(2): 2 (2018)
Conference and Workshop Papers
- 2024
- [c5]Jakub Gajarský, Rose McCarty:
On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification. ICALP 2024: 137:1-137:20 - [c4]Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Sparse induced subgraphs in P6-free graphs. SODA 2024: 5291-5299 - 2023
- [c3]David Eppstein, Rose McCarty:
Geometric Graphs with Unbounded Flip-Width. CCCG 2023: 197-206 - [c2]Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk:
Flipper Games for Monadically Stable Graph Classes. ICALP 2023: 128:1-128:16 - 2021
- [c1]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Colouring Polygon Visibility Graphs and Their Generalizations. SoCG 2021: 29:1-29:16
Informal and Other Publications
- 2024
- [i8]Jakub Gajarský, Rose McCarty:
On classes of bounded tree rank, their interpretations, and efficient sparsification. CoRR abs/2404.18904 (2024) - 2023
- [i7]Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk:
Flipper games for monadically stable graph classes. CoRR abs/2301.13735 (2023) - [i6]David Eppstein, Rose McCarty:
Geometric Graphs with Unbounded Flip-Width. CoRR abs/2306.12611 (2023) - [i5]Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Sparse induced subgraphs in P_6-free graphs. CoRR abs/2307.07330 (2023) - [i4]Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk:
First-Order Model Checking on Monadically Stable Graph Classes. CoRR abs/2311.18740 (2023) - 2021
- [i3]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Colouring polygon visibility graphs and their generalizations. CoRR abs/2103.07803 (2021) - [i2]James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Grounded L-graphs are polynomially χ-bounded. CoRR abs/2108.05611 (2021) - 2019
- [i1]O-joung Kwon, Rose McCarty, Sang-il Oum, Paul Wollan:
Obstructions for bounded shrub-depth and rank-depth. CoRR abs/1911.00230 (2019)
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-07 22: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:
