Rose McCarty

Orcid: 0000-0002-9884-3406

According to our database¹, Rose McCarty authored at least 26 papers between 2018 and 2026.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of two.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Bibliography

2026

Graphs whose Eulerian trails have unique labels.

[BibT_eX]

[DOI]

Donggyu Kim

Rose McCarty

Caleb McFarland

CoRR, March, 2026

Universality for graphs with bounded density.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2026

The Erdős-Pósa property for circle graphs as vertex-minors.

[BibT_eX]

[DOI]

Sebastian Wiederrecht

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Odd coloring graphs with linear neighborhood complexity.

[BibT_eX]

[DOI]

CoRR, June, 2025

The Structural Complexity of Matrix-Vector Multiplication.

[BibT_eX]

[DOI]

Emile Anand

Jan van den Brand

Rose McCarty

CoRR, February, 2025

Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2025

Induced C4-free subgraphs with large average degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2025

A survey of degree-boundedness.

[BibT_eX]

[DOI]

Xiying Du

Rose McCarty

Eur. J. Comb., 2025

Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs.

[BibT_eX]

[DOI]

James Davies

Agelos Georgakopoulos

Meike Hatzel

Rose McCarty

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

On tree decompositions whose trees are minors.

[BibT_eX]

[DOI]

J. Graph Theory, 2024

Sparse induced subgraphs in <i>P</i><sub>6</sub>-free graphs.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification.

[BibT_eX]

[DOI]

Jakub Gajarský

Rose McCarty

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

First-Order Model Checking on Monadically Stable Graph Classes.

[BibT_eX]

[DOI]

Jan Dreier

Ioannis Eleftheriadis

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Grounded L-Graphs Are Polynomially χ-Bounded.

[BibT_eX]

[DOI]

Discret. Comput. Geom., December, 2023

Coloring polygon visibility graphs and their generalizations.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

The Grid Theorem for vertex-minors.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2023

Sparse induced subgraphs in P_6-free graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Flipper Games for Monadically Stable Graph Classes.

[BibT_eX]

[DOI]

Wojciech Przybyszewski

Sebastian Siebertz

Marek Sokolowski

Szymon Torunczyk

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Geometric Graphs with Unbounded Flip-Width.

[BibT_eX]

David Eppstein

Rose McCarty

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2021

Dense Induced Subgraphs of Dense Bipartite Graphs.

[BibT_eX]

[DOI]

Rose McCarty

SIAM J. Discret. Math., 2021

Sublinear Separators in Intersection Graphs of Convex Shapes.

[BibT_eX]

[DOI]

Zdenek Dvorák

Rose McCarty

Sergey Norin

SIAM J. Discret. Math., 2021

Obstructions for bounded shrub-depth and rank-depth.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Colouring Polygon Visibility Graphs and Their Generalizations.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

7-Connected graphs are 4-ordered.

[BibT_eX]

[DOI]

Rose McCarty

Yan Wang

Xingxing Yu

J. Comb. Theory B, 2020

2019

The Extremal Function for Bipartite Linklessly Embeddable Graphs.

[BibT_eX]

[DOI]

Rose McCarty

Robin Thomas

Comb., 2019

2018

The Extremal Function and Colin de Verdière Graph Parameter.

[BibT_eX]

[DOI]

Rose McCarty

Electron. J. Comb., 2018

Rose McCarty

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...