Prafullkumar Tale
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
21
Venues
9
Active years
2016–2026
Best venue rank
A*
Where they publish
Papers
21 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | MFCS | Structural Parameterizations of Geodetic Set on Directed (Acyclic) Graphs. | Laurent Beaudou, Florent Foucaud, Lucas Lorieau, Prafullkumar Tale |
| 2026 | WG | Revisiting Token Sliding on Chordal Graphs. | Rajat Adak, Saraswati Girish Nanoti, Prafullkumar Tale |
| 2026 | WG | Parameterized Complexity of Isometric Path Partition: Treewidth and Diameter. | Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, Prafullkumar Tale |
| 2025 | CIAC | Structural Parameterization of Locating-Dominating Set and Test Cover. | Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale |
| 2025 | ICALP | Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. | Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dniel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue |
| 2025 | STACS | Metric Dimension and Geodetic Set Parameterized by Vertex Cover. | Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2024 | ICALP | Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. | Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2024 | ISAAC | Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. | Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale |
| 2024 | WG | Revisiting Path Contraction and Cycle Contraction. | R. Krithika, V. K. Kutty Malu, Prafullkumar Tale |
| 2022 | MFCS | Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. | Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2022 | MFCS | Reducing the Vertex Cover Number via Edge Contractions. | Paloma T. Lima, Vincius Fernandes dos Santos, Ignasi Sau, Uverton S. Souza, Prafullkumar Tale |
| 2022 | SODA | A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. | Dniel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale |
| 2022 | WG | Parameterized Complexity of Weighted Multicut in Trees. | Esther Galby, Dniel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale |
| 2022 | WG | The Complexity of Contracting Bipartite Graphs into Small Cycles. | R. Krithika, Roohani Sharma, Prafullkumar Tale |
| 2020 | COCOON | Parameterized Complexity of Maximum Edge Colorable Subgraph. | Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale |
| 2019 | CIAC | Subset Feedback Vertex Set in Chordal and Split Graphs. | Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale |
| 2019 | ICALP | Path Contraction Faster Than 2 | Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale |
| 2018 | COCOON | An FPT Algorithm for Contraction to Cactus. | R. Krithika, Pranabendu Misra, Prafullkumar Tale |
| 2017 | CIAC | Paths to Trees and Cacti. | Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale |
| 2017 | SOFSEM | Parameterized and Exact Algorithms for Class Domination Coloring. | R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale |
| 2016 | WG | Harmonious Coloring: Parameterized Algorithms and Upper Bounds. | Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale |