Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoohani Sharma
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Pranabendu Misra, Saket Saurabh, Roohani Sharma
, Meirav Zehavi:
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Algorithmica 85(7): 2065-2086 (2023)- [j10]Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs Circumference. Comb. 43(4): 659-664 (2023) - [j9]Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. SIAM J. Discret. Math. 37(4): 2241-2264 (2023) - [j8]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. 978: 114174 (2023) - [c23]Lars Jaffke, Paloma T. Lima, Roohani Sharma:
Structural Parameterizations of b-Coloring. ISAAC 2023: 40:1-40:14 - [c22]Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge:
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. SODA 2023: 3229-3244 - [c21]P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma:
Balanced Substructures in Bicolored Graphs. SOFSEM 2023: 177-191 - [i22]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation Schemes for Clustering with General Norm Objectives. CoRR abs/2304.03146 (2023) - [i21]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces. CoRR abs/2305.07316 (2023) - [i20]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma:
Parameterized Complexity Classification for Interval Constraints. CoRR abs/2305.13889 (2023) - [i19]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. CoRR abs/2306.15331 (2023) - [i18]Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. CoRR abs/2307.08149 (2023) - [i17]R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. CoRR abs/2307.10607 (2023) - [i16]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Approximate Monotone Local Search for Weighted Problems. CoRR abs/2308.15306 (2023) - [i15]Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, George Karypis, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - 2022
- [j7]Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84(8): 2292-2308 (2022) - [c20]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA 2022: 50:1-50:19 - [c19]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC 2022: 14:1-14:24 - [c18]Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. MFCS 2022: 51:1-51:15 - [c17]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Weighted Multicut in Trees. WG 2022: 257-270 - [c16]R. Krithika, Roohani Sharma, Prafullkumar Tale:
The Complexity of Contracting Bipartite Graphs into Small Cycles. WG 2022: 356-369 - [i14]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Weighted Multicut in Trees. CoRR abs/2205.10105 (2022) - [i13]R. Krithika, Roohani Sharma, Prafullkumar Tale:
The Complexity of Contracting Bipartite Graphs into Small Cycles. CoRR abs/2206.07358 (2022) - [i12]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR abs/2206.13481 (2022) - [i11]Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. CoRR abs/2206.15424 (2022) - [i10]Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge:
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. CoRR abs/2207.07425 (2022) - [i9]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR abs/2208.02850 (2022) - [i8]Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma:
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification. CoRR abs/2208.06015 (2022) - [i7]Eun Jung Kim, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström:
On weighted graph separation problems and flow-augmentation. CoRR abs/2208.14841 (2022) - [i6]Lars Jaffke, Paloma T. Lima, Roohani Sharma:
b-Coloring Parameterized by Pathwidth is XNLP-complete. CoRR abs/2209.07772 (2022) - [i5]Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs circumference. CoRR abs/2211.11410 (2022) - 2021
- [j6]Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi:
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. Algorithmica 83(6): 1861-1884 (2021) - [c15]Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma:
Circumventing Connectivity for Kernelization. CIAC 2021: 300-313 - 2020
- [j5]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. ACM Trans. Algorithms 16(3): 32:1-32:31 (2020) - [c14]William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Fault Tolerant Subgraphs with Applications in Kernelization. ITCS 2020: 47:1-47:22 - [c13]Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. IPEC 2020: 12:1-12:11 - [c12]Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma:
Quick Separation in Chordal and Split Graphs. MFCS 2020: 70:1-70:14 - [c11]Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma:
On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. MFCS 2020: 75:1-75:13 - [i4]Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma:
On the Parameterized Complexity of Deletion to H-free Strong Components. CoRR abs/2005.01359 (2020)
2010 – 2019
- 2019
- [j4]Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Balanced Judicious Bipartition is Fixed-Parameter Tractable. SIAM J. Discret. Math. 33(4): 1878-1911 (2019) - [c10]Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma:
Exact and Approximate Digraph Bandwidth. FSTTCS 2019: 18:1-18:15 - [c9]Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi:
A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. MFCS 2019: 28:1-28:14 - [c8]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. WADS 2019: 523-537 - 2018
- [j3]Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Kernels for deletion to classes of acyclic digraphs. J. Comput. Syst. Sci. 92: 9-21 (2018) - [j2]Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Parameterised Algorithms for Deletion to Classes of DAGs. Theory Comput. Syst. 62(8): 1880-1909 (2018) - [c7]Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. FSTTCS 2018: 35:1-35:19 - [c6]Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. ICALP 2018: 110:1-110:4 - [c5]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. SODA 2018: 2785-2800 - 2017
- [c4]Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Balanced Judicious Bipartition is Fixed-Parameter Tractable. FSTTCS 2017: 40:40-40:15 - [i3]Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. CoRR abs/1705.01414 (2017) - [i2]Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Balanced Judicious Partition is Fixed-Parameter Tractable. CoRR abs/1710.05491 (2017) - 2016
- [c3]Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma:
Kernelizing Buttons and Scissors. CCCG 2016: 279-286 - [c2]Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Kernels for Deletion to Classes of Acyclic Digraphs. ISAAC 2016: 6:1-6:12 - [c1]Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma:
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. IPEC 2016: 2:1-2:14 - 2013
- [j1]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma:
Product Dimension of Forests and Bounded Treewidth Graphs. Electron. J. Comb. 20(3): 42 (2013) - 2012
- [i1]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma:
Product Dimension of Forests and Bounded Treewidth Graphs. CoRR abs/1209.2218 (2012)
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 2023-11-29 20:26 CET 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:
