Scholar
Rose McCarty
Google Scholar ID: aHC-gvcAAAAJ
Georgia Institute of Technology
graph theory
combinatorics
discrete geometry
algorithms and complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
294
H-index
9
i10-index
9
Publications
20
Co-authors
48
list available
Contact
No contact links provided.
Publications
9 items
Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes
2026
Cited
0
A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity
2026
Cited
0
Biclique decompositions from Welzl orders
2026
Cited
0
Graphs whose Eulerian trails have unique labels
2026
Cited
0
Odd coloring graphs with linear neighborhood complexity
2025
Cited
0
Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
2025
Cited
0
The Structural Complexity of Matrix-Vector Multiplication
2025
Cited
0
On classes of bounded tree rank, their interpretations, and efficient sparsification
International Colloquium on Automata, Languages and Programming · 2024
Cited
0
Load more
Resume (English only)
Co-authors
48 total
Co-author 1
Michał Pilipczuk
University of Warsaw
O-joung Kwon
Hanyang University
Paul Wollan
Professor of Computer Science, University of Rome La Sapienza
Szymon Toruńczyk
University of Warsaw
Nikolas Mählmann
University of Bremen
Bartosz Walczak
Jagiellonian University in Kraków
Sang-il Oum
Distinguished Research Fellow / CI. Discrete Mathematics Group, Institute for Basic Science