Lossy Kernels for Graph Contraction Problems. - R. Krithika 001; Pranabendu Misra; Ashutosh Rai 001; Prafullkumar Tale (FSTTCS, 2016)

Exact and Parameterized Algorithms for (k, i)-Coloring. - Diptapriyo Majumdar; Rian Neogi; Venkatesh Raman 001; Prafullkumar Tale (CALDAM, 2017)

An FPT Algorithm for Contraction to Cactus. - R. Krithika 001; Pranabendu Misra; Prafullkumar Tale (COCOON, 2018)

Dynamic Parameterized Problems. - R. Krithika 001; Abhishek Sahu; Prafullkumar Tale (Algorithmica, 2018)

Subset Feedback Vertex Set in Chordal and Split Graphs. - Geevarghese Philip; Varun Rajan; Saket Saurabh 001; Prafullkumar Tale (Algorithmica, 2019)

On the Parameterized Complexity of Contraction to Generalization of Trees. - Akanksha Agrawal 001; Saket Saurabh 001; Prafullkumar Tale (Theory Comput. Syst., 2019)

Harmonious coloring: Parameterized algorithms and upper bounds. - Sudeshna Kolay; Ragukumar Pandurangan; Fahad Panolan; Venkatesh Raman 001; Prafullkumar Tale (Theor. Comput. Sci., 2019)

On the Parameterized Complexity of textsc{Maximum Degree Contraction} Problem. - Saket Saurabh 001; Prafullkumar Tale (CoRR, 2020)

Path Contraction Faster than 2n. - Akanksha Agrawal 001; Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Prafullkumar Tale (SIAM J. Discret. Math., 2020)

α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms. - Fredrik Manne; Geevarghese Philip; Saket Saurabh 001; Prafullkumar Tale (CoRR, 2021)

Parameterized and exact algorithms for class domination coloring. - R. Krithika 001; Ashutosh Rai 001; Saket Saurabh 001; Prafullkumar Tale (Discret. Appl. Math., 2021)

Paths to trees and cacti. - Akanksha Agrawal 001; Lawqueen Kanesh; Saket Saurabh 001; Prafullkumar Tale (Theor. Comput. Sci., 2021)

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. - Spoorthy Gunda; Pallavi Jain 001; Daniel Lokshtanov; Saket Saurabh 001; Prafullkumar Tale (ACM Trans. Comput. Theory, 2021)

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. - Dániel Marx; Pranabendu Misra; Daniel Neuen; Prafullkumar Tale (SODA, 2022)

Parameterized Complexity of Weighted Multicut in Trees. - Esther Galby; Dániel Marx; Philipp Schepper; Roohani Sharma; Prafullkumar Tale (WG, 2022)

The Complexity of Contracting Bipartite Graphs into Small Cycles. - R. Krithika 001; Roohani Sharma; Prafullkumar Tale (WG, 2022)

Parameterized Complexity of Maximum Edge Colorable Subgraph. - Akanksha Agrawal 001; Madhumita Kundu; Abhishek Sahu; Saket Saurabh 001; Prafullkumar Tale (Algorithmica, 2022)

On the Parameterized Complexity of Maximum Degree Contraction Problem. - Saket Saurabh 001; Prafullkumar Tale (Algorithmica, 2022)

On the parameterized complexity of Grid Contraction. - Saket Saurabh 001; Uéverton dos Santos Souza; Prafullkumar Tale (J. Comput. Syst. Sci., 2022)

Sparsification lower bound for linear spanners in directed graphs. - Prafullkumar Tale (Theor. Comput. Sci., 2022)

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. - R. Krithika 001; V. K. Kutty Malu; Roohani Sharma; Prafullkumar Tale (FSTTCS, 2023)

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (CoRR, 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)

A single exponential-time FPT algorithm for cactus contraction. - R. Krithika 001; Pranabendu Misra; Prafullkumar Tale (Theor. Comput. Sci., 2023)

Parameterized complexity of multicut in weighted trees. - Esther Galby; Dániel Marx; Philipp Schepper; Roohani Sharma; Prafullkumar Tale (Theor. Comput. Sci., 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., 2023)

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (ICALP, 2024)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. - Dipayan Chakraborty; Florent Foucaud; Diptapriyo Majumdar; Prafullkumar Tale (ISAAC, 2024)

Revisiting Path Contraction and Cycle Contraction. - R. Krithika 001; V. K. Kutty Malu; Prafullkumar Tale (WG, 2024)

Double Exponential Lower Bound for Telephone Broadcast. - Prafullkumar Tale (CoRR, 2024)

Conflict and Fairness in Resource Allocation. - Susobhan Bandopadhyay; Aritra Banik; Sushmita Gupta; Pallavi Jain 001; Abhishek Sahu; Saket Saurabh 001; Prafullkumar Tale (CoRR, 2024)

Domination and Cut Problems on Chordal Graphs with Bounded Leafage. - Esther Galby; Dániel Marx; Philipp Schepper; Roohani Sharma; Prafullkumar Tale (Algorithmica, 2024)

Romeo and Juliet Meeting in Forest Like Regions. - Neeldhara Misra; Manas Mulpuri; Prafullkumar Tale; Gaurav Viramgami (Algorithmica, 2024)

Structural Parameterization of Locating-Dominating Set and Test Cover. - Dipayan Chakraborty; Florent Foucaud; Diptapriyo Majumdar; Prafullkumar Tale (CIAC (1), 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 001; Prafullkumar Tale; Jie Xue 003 (ICALP, 2025)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (STACS, 2025)

Telephone Broadcast on graphs of treewidth two. - Prafullkumar Tale (Theor. Comput. Sci., 2025)

Revisiting Token Sliding on Chordal Graphs. - Rajat Adak; Saraswati Girish Nanoti; Prafullkumar Tale (CoRR, 2025)

Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number. - Prafullkumar Tale (CoRR, 2025)

Parameterized complexity of isometric path partition: treewidth and diameter. - Dibyayan Chakraborty; Oscar Defrain; Florent Foucaud; Mathieu Mari; Prafullkumar Tale (CoRR, 2025)