Scholar
Roohani Sharma
Google Scholar ID: 9A3ZERMAAAAJ
Max Planck Institute for Informatics
parameterized complexity
graph theory
graph algorithms
structural graph theory
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
519
H-index
11
i10-index
14
Publications
20
Co-authors
0
Contact
No contact links provided.
Publications
6 items
A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth
2026
Cited
0
Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors
2026
Cited
0
MaxMin Separation Problems: FPT Algorithms for $st$-Separator and Odd Cycle Transversal
2025
Cited
0
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
Symposium on Theoretical Aspects of Computer Science · 2024
Cited
2
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
International Colloquium on Automata, Languages and Programming · 2023
Cited
8
The Complexity of Contracting Bipartite Graphs into Small Cycles
International Workshop on Graph-Theoretic Concepts in Computer Science · 2022
Cited
1
Resume (English only)
Co-authors
0 total
Co-authors: 0 (list not available)
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up