Prafullkumar Tale

According to our database, Prafullkumar Tale authored at least 40 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Parameterized complexity of isometric path partition: treewidth and diameter.

Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, Prafullkumar Tale

CoRR, August, 2025

Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number.

Prafullkumar Tale

CoRR, April, 2025

Revisiting Token Sliding on Chordal Graphs.

Rajat Adak, Saraswati Girish Nanoti, Prafullkumar Tale

CoRR, February, 2025

Telephone Broadcast on graphs of treewidth two.

Prafullkumar Tale

Theor. Comput. Sci., 2025

Metric Dimension and Geodetic Set Parameterized by Vertex Cover.

Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Robust Contraction Decomposition for Minor-Free Graphs and Its Applications.

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Structural Parameterization of Locating-Dominating Set and Test Cover.

Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

Conflict and Fairness in Resource Allocation.

Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale

CoRR, 2024

Double Exponential Lower Bound for Telephone Broadcast.

Prafullkumar Tale

CoRR, 2024

Revisiting Path Contraction and Cycle Contraction.

R. Krithika, V. K. Kutty Malu, Prafullkumar Tale

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover.

Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

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

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Parameterized complexity of multicut in weighted trees.

Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale

Theor. Comput. Sci., November, 2023

A single exponential-time FPT algorithm for cactus contraction.

R. Krithika, Pranabendu Misra, Prafullkumar Tale

Theor. Comput. Sci., 2023

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations.

Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale

CoRR, 2023

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction.

R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022

Sparsification lower bound for linear spanners in directed graphs.

Prafullkumar Tale

Theor. Comput. Sci., 2022

The Complexity of Contracting Bipartite Graphs into Small Cycles.

R. Krithika, Roohani Sharma, Prafullkumar Tale

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Parameterized Complexity of Weighted Multicut in Trees.

Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.

Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Reducing the Vertex Cover Number via Edge Contractions.

Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.

Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Domination and Cut Problems on Chordal Graphs with Bounded Leafage.

Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Romeo and Juliet Meeting in Forest like Regions.

Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms.

Fredrik Manne, Geevarghese Philip, Saket Saurabh, Prafullkumar Tale

CoRR, 2021

2020

On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem.

Saket Saurabh, Prafullkumar Tale

CoRR, 2020

On the Parameterized Complexity of Grid Contraction.

Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

On the Parameterized Complexity of Maximum Degree Contraction Problem.

Saket Saurabh, Prafullkumar Tale

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Parameterized Complexity of Maximum Edge Colorable Subgraph.

Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.

Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale

Proceedings of the Approximation, 2020

2019

Path Contraction Faster Than 2ⁿ.

Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Subset Feedback Vertex Set in Chordal and Split Graphs.

Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

An FPT Algorithm for Contraction to Cactus.

R. Krithika, Pranabendu Misra, Prafullkumar Tale

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Parameterized and Exact Algorithms for Class Domination Coloring.

R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

On the Parameterized Complexity of Contraction to Generalization of Trees.

Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Paths to Trees and Cacti.

Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Exact and Parameterized Algorithms for (k, i)-Coloring.

Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Harmonious Coloring: Parameterized Algorithms and Upper Bounds.

Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Dynamic Parameterized Problems.

R. Krithika, Abhishek Sahu, Prafullkumar Tale

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Lossy Kernels for Graph Contraction Problems.

R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016