Prafullkumar Tale

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 63

Top Topics

Parameterized Complexity

Global Constraints

Top Venues

Theor. Comput. Sci.

Publications

Prafullkumar Tale
Double Exponential Lower Bound for Telephone Broadcast. CoRR (2024)
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. ICALP (2024)
Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
Conflict and Fairness in Resource Allocation. CoRR (2024)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica 86 (5) (2024)
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension and Geodetic Set Parameterized by Vertex Cover. CoRR (2024)
R. Krithika, V. K. Kutty Malu, Prafullkumar Tale
Revisiting Path Contraction and Cycle Contraction. CoRR (2024)
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. CoRR (2024)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. 978 (2023)
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) (2023)
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 (2023)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Reducing the vertex cover number via edge contractions. J. Comput. Syst. Sci. 136 (2023)
R. Krithika, Pranabendu Misra, Prafullkumar Tale
A single exponential-time FPT algorithm for cactus contraction. Theor. Comput. Sci. 954 (2023)
R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. FSTTCS (2023)
R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. CoRR (2023)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Reducing the Vertex Cover Number via Edge Contractions. CoRR (2022)
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. MFCS (2022)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Reducing the Vertex Cover Number via Edge Contractions. MFCS (2022)
Prafullkumar Tale
Sparsification lower bound for linear spanners in directed graphs. Theor. Comput. Sci. 898 (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Weighted Multicut in Trees. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR (2022)
R. Krithika, Roohani Sharma, Prafullkumar Tale
The Complexity of Contracting Bipartite Graphs into Small Cycles. CoRR (2022)
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
Parameterized Complexity of Maximum Edge Colorable Subgraph. Algorithmica 84 (10) (2022)
Prafullkumar Tale
Sparsification Lower Bound for Linear Spanners in Directed Graphs. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Weighted Multicut in Trees. WG (2022)
Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. SODA (2022)
Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale
On the parameterized complexity of Grid Contraction. J. Comput. Syst. Sci. 129 (2022)
Saket Saurabh, Prafullkumar Tale
On the Parameterized Complexity of Maximum Degree Contraction Problem. Algorithmica 84 (2) (2022)
R. Krithika, Roohani Sharma, Prafullkumar Tale
The Complexity of Contracting Bipartite Graphs into Small Cycles. WG (2022)
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. CoRR (2022)
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami
Romeo and Juliet Meeting in Forest Like Regions. CoRR (2022)
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
Parameterized and Exact Algorithms for Class Domination Coloring. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC (2022)
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami
Romeo and Juliet Meeting in Forest like Regions. FSTTCS (2022)
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
Parameterized and exact algorithms for class domination coloring. Discret. Appl. Math. 291 (2021)
Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. CoRR (2021)
Fredrik Manne, Geevarghese Philip, Saket Saurabh, Prafullkumar Tale
α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms. CoRR (2021)
Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
Paths to trees and cacti. Theor. Comput. Sci. 860 (2021)
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ACM Trans. Comput. Theory 13 (4) (2021)
Saket Saurabh, Prafullkumar Tale
On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem. CoRR (2020)
Saket Saurabh, Prafullkumar Tale
On the Parameterized Complexity of Maximum Degree Contraction Problem. IPEC (2020)
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. CoRR (2020)
Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale
On the Parameterized Complexity of Grid Contraction. SWAT (2020)
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
Parameterized Complexity of Maximum Edge Colorable Subgraph. CoRR (2020)
Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
. SIAM J. Discret. Math. 34 (2) (2020)
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
Parameterized Complexity of Maximum Edge Colorable Subgraph. COCOON (2020)
Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale
On the Parameterized Complexity Of Grid Contraction. CoRR (2020)
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. APPROX-RANDOM (2020)
Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
Subset Feedback Vertex Set in Chordal and Split Graphs. CoRR (2019)
Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
Subset Feedback Vertex Set in Chordal and Split Graphs. Algorithmica 81 (9) (2019)
Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comput. Sci. 772 (2019)
Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
On the Parameterized Complexity of Contraction to Generalization of Trees. Theory Comput. Syst. 63 (3) (2019)
Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
Subset Feedback Vertex Set in Chordal and Split Graphs. CIAC (2019)
Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
. ICALP (2019)
R. Krithika, Pranabendu Misra, Prafullkumar Tale
An FPT Algorithm for Contraction to Cactus. COCOON (2018)
R. Krithika, Abhishek Sahu, Prafullkumar Tale
Dynamic Parameterized Problems. Algorithmica 80 (9) (2018)
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale
Exact and Parameterized Algorithms for (k, i)-Coloring. CALDAM (2017)
Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
On the Parameterized Complexity of Contraction to Generalization of Trees. CoRR (2017)
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
Parameterized and Exact Algorithms for Class Domination Coloring. SOFSEM (2017)
Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
On the Parameterized Complexity of Contraction to Generalization of Trees. IPEC (2017)
Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
Paths to Trees and Cacti. CIAC (2017)
R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale
Lossy Kernels for Graph Contraction Problems. FSTTCS (2016)
Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
Harmonious Coloring: Parameterized Algorithms and Upper Bounds. WG (2016)
R. Krithika, Abhishek Sahu, Prafullkumar Tale
Dynamic Parameterized Problems. IPEC (2016)