Prafullkumar Tale

According to our database, Prafullkumar Tale authored at least 32 papers between 2016 and 2024.

Collaborative distances:

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

2024

Domination and Cut Problems on Chordal Graphs with Bounded Leafage.

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

Algorithmica, May, 2024

Revisiting Path Contraction and Cycle Contraction.

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

CoRR, 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

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

Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale

CoRR, 2024

2023

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

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

SIAM J. Discret. Math., December, 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

Reducing the vertex cover number via edge contractions.

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

J. Comput. Syst. 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

On the parameterized complexity of Grid Contraction.

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

J. Comput. Syst. Sci., 2022

On the Parameterized Complexity of Maximum Degree Contraction Problem.

Saket Saurabh, Prafullkumar Tale

Algorithmica, 2022

Parameterized Complexity of Maximum Edge Colorable Subgraph.

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

Algorithmica, 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

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

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

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

ACM Trans. Comput. Theory, 2021

Paths to trees and cacti.

Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale

Theor. Comput. Sci., 2021

Parameterized and exact algorithms for class domination coloring.

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

Discret. Appl. Math., 2021

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

Fredrik Manne, Geevarghese Philip, Saket Saurabh, Prafullkumar Tale

CoRR, 2021

2020

Path Contraction Faster than 2ⁿ.

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

SIAM J. Discret. Math., 2020

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

Saket Saurabh, Prafullkumar Tale

CoRR, 2020

2019

Harmonious coloring: Parameterized algorithms and upper bounds.

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

Theor. Comput. Sci., 2019

On the Parameterized Complexity of Contraction to Generalization of Trees.

Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale

Theory Comput. Syst., 2019

Subset Feedback Vertex Set in Chordal and Split Graphs.

Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale

Algorithmica, 2019

2018

Dynamic Parameterized Problems.

R. Krithika, Abhishek Sahu, Prafullkumar Tale

Algorithmica, 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

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

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