Prafullkumar Tale

85 papers A* 4A 1B 13C 2Misc 2Journal 54Unranked 9
YearRankTypeTitle / Venue / Authors
2026 — conf
Algorithms and Hardness for Geodetic Set on Tree-Like Digraphs.
CALDAM
Florent Foucaud, Narges Ghareghani, Lucas Lorieau, Morteza Mohammad Noori, Rasa Parvini Oskuei, Prafullkumar Tale
2026 J jnl
Algorithms and Hardness for Geodetic Set on Tree-like Digraphs.
CoRR
Florent Foucaud, Narges Ghareghani, Lucas Lorieau, Morteza Mohammad Noori, Rasa Parvini Oskuei, Prafullkumar Tale
2026 J jnl
Revisiting path contraction and cycle contraction.
J. Comput. Syst. Sci.
R. Krithika, V. K. Kutty Malu, Prafullkumar Tale
2025 — conf
A Finer View of the Parameterized Landscape of Labeled Graph Contractions.
FSTTCS
Yashaswini Mathur, Prafullkumar Tale
2025 J jnl
A Finer View of the Parameterized Landscape of Labeled Graph Contractions.
CoRR
Yashaswini Mathur, Prafullkumar Tale
2025 J jnl
A Single Exponential-Time FPT Algorithm for Cactus Contraction.
CoRR
R. Krithika, Pranabendu Misra, Prafullkumar Tale
2025 B conf
Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number.
IPEC
Prafullkumar Tale
2025 J jnl
Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number.
CoRR
Prafullkumar Tale
2025 A conf
Metric Dimension and Geodetic Set Parameterized by Vertex Cover.
STACS
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2025 J jnl
Parameterized complexity of isometric path partition: treewidth and diameter.
CoRR
Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, Prafullkumar Tale
2025 J jnl
Path Contraction Faster than 2
CoRR
Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2025 J jnl
Revisiting Token Sliding on Chordal Graphs.
CoRR
Rajat Adak, Saraswati Girish Nanoti, Prafullkumar Tale
2025 A* conf
Robust Contraction Decomposition for Minor-Free Graphs and Its Applications.
ICALP
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2025 — conf
Structural Parameterization of Locating-Dominating Set and Test Cover.
CIAC (1)
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2025 J jnl
Telephone Broadcast on graphs of treewidth two.
Theor. Comput. Sci.
Prafullkumar Tale
2025 J jnl
The Complexity of Contracting Bipartite Graphs into Small Cycles.
Discret. Math. Theor. Comput. Sci.
R. Krithika, Roohani Sharma, Prafullkumar Tale
2025 J jnl
The Parameterized Complexity of Computing the VC-Dimension.
CoRR
Florent Foucaud, Harmender Gahlawat, Fionn Mc Inerney, Prafullkumar Tale
2024 J jnl
Conflict and Fairness in Resource Allocation.
CoRR
Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2024 J jnl
Domination and Cut Problems on Chordal Graphs with Bounded Leafage.
Algorithmica
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2024 J jnl
Double Exponential Lower Bound for Telephone Broadcast.
CoRR
Prafullkumar Tale
2024 J jnl
Metric Dimension and Geodetic Set Parameterized by Vertex Cover.
CoRR
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2024 A* conf
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover.
ICALP
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2024 B conf
Revisiting Path Contraction and Cycle Contraction.
WG
R. Krithika, V. K. Kutty Malu, Prafullkumar Tale
2024 J jnl
Revisiting Path Contraction and Cycle Contraction.
CoRR
R. Krithika, V. K. Kutty Malu, Prafullkumar Tale
2024 J jnl
Robust Contraction Decomposition for Minor-Free Graphs and its Applications.
CoRR
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2024 J jnl
Romeo and Juliet Meeting in Forest Like Regions.
Algorithmica
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami
2024 J jnl
Structural Parameterization of Locating-Dominating Set and Test Cover.
CoRR
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2024 B conf
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover.
ISAAC
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2024 J jnl
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover.
CoRR
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2023 J jnl
A single exponential-time FPT algorithm for cactus contraction.
Theor. Comput. Sci.
R. Krithika, Pranabendu Misra, Prafullkumar Tale
2023 J jnl
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
SIAM J. Discret. Math.
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2023 — conf
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction.
FSTTCS
R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale
2023 J jnl
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction.
CoRR
R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale
2023 J jnl
Parameterized complexity of multicut in weighted trees.
Theor. Comput. Sci.
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2023 J jnl
Reducing the vertex cover number via edge contractions.
J. Comput. Syst. Sci.
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
2023 J jnl
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations.
CoRR
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2022 A* conf
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.
SODA
Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
2022 B conf
Domination and Cut Problems on Chordal Graphs with Bounded Leafage.
IPEC
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022 J jnl
Domination and Cut Problems on Chordal Graphs with Bounded Leafage.
CoRR
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022 B conf
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
MFCS
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2022 J jnl
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
CoRR
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2022 J jnl
On the Parameterized Complexity of Maximum Degree Contraction Problem.
Algorithmica
Saket Saurabh, Prafullkumar Tale
2022 J jnl
On the parameterized complexity of Grid Contraction.
J. Comput. Syst. Sci.
Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale
2022 J jnl
Parameterized Complexity of Maximum Edge Colorable Subgraph.
Algorithmica
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2022 B conf
Parameterized Complexity of Weighted Multicut in Trees.
WG
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022 J jnl
Parameterized Complexity of Weighted Multicut in Trees.
CoRR
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022 J jnl
Parameterized and Exact Algorithms for Class Domination Coloring.
CoRR
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
2022 B conf
Reducing the Vertex Cover Number via Edge Contractions.
MFCS
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
2022 J jnl
Reducing the Vertex Cover Number via Edge Contractions.
CoRR
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
2022 J jnl
Romeo and Juliet Meeting in Forest Like Regions.
CoRR
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami
2022 — conf
Romeo and Juliet Meeting in Forest like Regions.
FSTTCS
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami
2022 J jnl
Sparsification Lower Bound for Linear Spanners in Directed Graphs.
CoRR
Prafullkumar Tale
2022 J jnl
Sparsification lower bound for linear spanners in directed graphs.
Theor. Comput. Sci.
Prafullkumar Tale
2022 B conf
The Complexity of Contracting Bipartite Graphs into Small Cycles.
WG
R. Krithika, Roohani Sharma, Prafullkumar Tale
2022 J jnl
The Complexity of Contracting Bipartite Graphs into Small Cycles.
CoRR
R. Krithika, Roohani Sharma, Prafullkumar Tale
2021 J jnl
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.
CoRR
Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale
2021 J jnl
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.
ACM Trans. Comput. Theory
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2021 J jnl
Parameterized and exact algorithms for class domination coloring.
Discret. Appl. Math.
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
2021 J jnl
Paths to trees and cacti.
Theor. Comput. Sci.
Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
2021 J jnl
α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms.
CoRR
Fredrik Manne, Geevarghese Philip, Saket Saurabh, Prafullkumar Tale
2020 — conf
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.
APPROX-RANDOM
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2020 J jnl
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.
CoRR
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2020 J jnl
On the Parameterized Complexity Of Grid Contraction.
CoRR
Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale
2020 — conf
On the Parameterized Complexity of Grid Contraction.
SWAT
Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale
2020 B conf
On the Parameterized Complexity of Maximum Degree Contraction Problem.
IPEC
Saket Saurabh, Prafullkumar Tale
2020 J jnl
On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem.
CoRR
Saket Saurabh, Prafullkumar Tale
2020 Misc conf
Parameterized Complexity of Maximum Edge Colorable Subgraph.
COCOON
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2020 J jnl
Parameterized Complexity of Maximum Edge Colorable Subgraph.
CoRR
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2020 J jnl
Path Contraction Faster than 2
SIAM J. Discret. Math.
Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2019 J jnl
Harmonious coloring: Parameterized algorithms and upper bounds.
Theor. Comput. Sci.
Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
2019 J jnl
On the Parameterized Complexity of Contraction to Generalization of Trees.
Theory Comput. Syst.
Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
2019 A* conf
Path Contraction Faster Than 2
ICALP
Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2019 C conf
Subset Feedback Vertex Set in Chordal and Split Graphs.
CIAC
Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
2019 J jnl
Subset Feedback Vertex Set in Chordal and Split Graphs.
Algorithmica
Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
2019 J jnl
Subset Feedback Vertex Set in Chordal and Split Graphs.
CoRR
Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
2018 Misc conf
An FPT Algorithm for Contraction to Cactus.
COCOON
R. Krithika, Pranabendu Misra, Prafullkumar Tale
2018 J jnl
Dynamic Parameterized Problems.
Algorithmica
R. Krithika, Abhishek Sahu, Prafullkumar Tale
2017 — conf
Exact and Parameterized Algorithms for (k, i)-Coloring.
CALDAM
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale
2017 B conf
On the Parameterized Complexity of Contraction to Generalization of Trees.
IPEC
Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
2017 J jnl
On the Parameterized Complexity of Contraction to Generalization of Trees.
CoRR
Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
2017 B conf
Parameterized and Exact Algorithms for Class Domination Coloring.
SOFSEM
R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale
2017 C conf
Paths to Trees and Cacti.
CIAC
Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
2016 B conf
Dynamic Parameterized Problems.
IPEC
R. Krithika, Abhishek Sahu, Prafullkumar Tale
2016 B conf
Harmonious Coloring: Parameterized Algorithms and Upper Bounds.
WG
Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
2016 — conf
Lossy Kernels for Graph Contraction Problems.
FSTTCS
R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale