Roohani Sharma
Orcid: 0000-0003-2212-1359Affiliations:
- Max Planck Institute for Informatics, Saarbrücken, Germany
According to our database1,
Roohani Sharma
authored at least 53 papers
between 2013 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2014
2016
2018
2020
2022
2024
0
5
10
15
6
7
3
1
1
1
2
1
1
1
9
8
3
1
3
2
1
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
Algorithmica, May, 2024
SIAM J. Discret. Math., March, 2024
On the Parameterized Complexity of Deletion to \(\boldsymbol{\mathcal{H}}\)-Free Strong Components.
SIAM J. Discret. Math., 2024
CoRR, 2024
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Component Order Connectivity Admits No Polynomial Kernel Parameterized by the Distance to Subdivided Comb Graphs.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
2023
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
SIAM J. Discret. Math., December, 2023
Theor. Comput. Sci., November, 2023
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.
Algorithmica, July, 2023
Dagstuhl Reports, 2023
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations.
CoRR, 2023
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
2021
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs.
Algorithmica, 2021
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021
2020
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.
ACM Trans. Algorithms, 2020
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
2019
SIAM J. Discret. Math., 2019
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019
2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
2016
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016
Kernelizing Buttons and Scissors.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016
2013