P. Tale

Most-cited papers

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
F. Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li +3 more
2023International Colloquium on Automata, Languages and Programming21 citations
Semantic Scholar
Lossy Kernels for Graph Contraction Problems
R. Krithika, Pranabendu Misra, Ashutosh Rai, P. Tale
2016Foundations of Software Technology and Theoretical Computer Science19 citations
Semantic Scholar
Dynamic Parameterized Problems
R. Krithika, Abhishek Sahu, P. Tale
2017Algorithmica18 citations Open access
Semantic Scholar
Parameterized and Exact Algorithms for Class Domination Coloring
R. Krithika, Ashutosh Rai, Saket Saurabh, P. Tale
2021Conference on Current Trends in Theory and Practice of Informatics15 citations Open access
Semantic Scholar
Double Exponential Lower Bound for Telephone Broadcast
P. Tale
2024arXiv.org14 citations
Semantic Scholar
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
F. Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li +3 more
2024Symposium on Theoretical Aspects of Computer Science13 citations
Semantic Scholar
On the Parameterized Complexity of Contraction to Generalization of Trees
A. Agarwal, Saket Saurabh, P. Tale
2017Theory of Computing Systems12 citations
Semantic Scholar
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
Dipayan Chakraborty, F. Foucaud, Diptapriyo Majumdar, P. Tale
2024International Symposium on Algorithms and Computation11 citations
Semantic Scholar
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma +1 more
2022International Symposium on Mathematical Foundations of Computer Science10 citations Open access
Semantic Scholar
On the Parameterized Complexity of Grid Contraction
Saket Saurabh, U. Souza, P. Tale
2020Scandinavian Workshop on Algorithm Theory9 citations
Semantic Scholar
Subset Feedback Vertex Set in Chordal and Split Graphs
Geevarghese Philip, Varun Rajan, Saket Saurabh, P. Tale
2019Algorithmica9 citations
Semantic Scholar
Telephone Broadcast on graphs of treewidth two
P. Tale
2025Theoretical Computer Science8 citations
Semantic Scholar
Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number
P. Tale
2025International Symposium on Parameterized and Exact Computation7 citations
Semantic Scholar
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs
Dániel Marx, Pranabendu Misra, Daniel Neuen, P. Tale
2021ACM-SIAM Symposium on Discrete Algorithms7 citations Open access
Semantic Scholar
Parameterized complexity of isometric path partition: treewidth and diameter
Dibyayan Chakraborty, Oscar Defrain, F. Foucaud, Mathieu Mari +1 more
2025International Workshop on Graph-Theoretic Concepts in Computer Science6 citations
Semantic Scholar
Parameterized Complexity of Maximum Edge Colorable Subgraph
A. Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh +1 more
2020Algorithmica6 citations
Semantic Scholar
Path Contraction Faster Than 2n
A. Agrawal, F. Fomin, D. Lokshtanov, Saket Saurabh +1 more
2019International Colloquium on Automata, Languages and Programming6 citations Open access
Semantic Scholar
Paths to Trees and Cacti
A. Agrawal, Lawqueen Kanesh, Saket Saurabh, P. Tale
2017International/Italian Conference on Algorithms and Complexity6 citations
Semantic Scholar
On the Parameterized Complexity of Maximum Degree Contraction Problem
Saket Saurabh, P. Tale
2020Algorithmica5 citations Open access
Semantic Scholar
Harmonious Coloring: Parameterized Algorithms and Upper Bounds
Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman +1 more
2016International Workshop on Graph-Theoretic Concepts in Computer Science5 citations Open access
Semantic Scholar
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma +1 more
2022Algorithmica4 citations Open access
Semantic Scholar
An FPT Algorithm for Contraction to Cactus
R. Krithika, Pranabendu Misra, P. Tale
2018International Computing and Combinatorics Conference4 citations
Semantic Scholar
The Parameterized Complexity of Computing the VC-Dimension
F. Foucaud, Harmender Gahlawat, Fionn Mc Inerney, P. Tale
2025Neural Information Processing Systems3 citations
Semantic Scholar
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations
F. Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li +3 more
2023arXiv.org3 citations Open access
Semantic Scholar
Parameterized Complexity of Weighted Multicut in Trees
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma +1 more
2022International Workshop on Graph-Theoretic Concepts in Computer Science3 citations Open access
Semantic Scholar
Paths to trees and cacti
A. Agrawal, Lawqueen Kanesh, Saket Saurabh, P. Tale
2021Theoretical Computer Science3 citations Open access
Semantic Scholar
Path Contraction Faster Than 2
A. Agrawal, F. Fomin, D. Lokshtanov, Saket Saurabh +1 more
20193 citations
Semantic Scholar
Exact and Parameterized Algorithms for (k, i)-Coloring
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, P. Tale
2017International Conference on Algorithms and Discrete Applied Mathematics3 citations
Semantic Scholar
Structural Parameterization of Locating-Dominating Set and Test Cover
Dipayan Chakraborty, F. Foucaud, Diptapriyo Majumdar, P. Tale
2024arXiv.org2 citations
Semantic Scholar
The Complexity of Contracting Bipartite Graphs into Small Cycles
R. Krithika, Roohani Sharma, P. Tale
2022International Workshop on Graph-Theoretic Concepts in Computer Science2 citations Open access
Semantic Scholar
Romeo and Juliet Meeting in Forest Like Regions
Neeldhara Misra, M. Mulpuri, P. Tale, Gaurav Viramgami
2022Algorithmica2 citations Open access
Semantic Scholar
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
Spoorthy Gunda, P. Jain, D. Lokshtanov, Saket Saurabh +1 more
2020International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques2 citations Open access
Semantic Scholar
Algorithms and Hardness for Geodetic Set on Tree-Like Digraphs
F. Foucaud, N. Ghareghani, Lucas Lorieau, M. Noori +2 more
2026International Conference on Algorithms and Discrete Applied Mathematics1 citations Open access
Semantic Scholar
A Single Exponential-Time FPT Algorithm for Cactus Contraction
R. Krithika, Pranabendu Misra, P. Tale
2025arXiv.org1 citations
Semantic Scholar
Conflict and Fairness in Resource Allocation
S. Bandopadhyay, Aritra Banik, Sushmita Gupta, P. Jain +3 more
2024arXiv.org1 citations
Semantic Scholar
Revisiting Path Contraction and Cycle Contraction
R. Krithika, V. K. Kutty Malu, P. Tale
2024International Workshop on Graph-Theoretic Concepts in Computer Science1 citations
Semantic Scholar
A single exponential-time FPT algorithm for cactus contraction
R. Krithika, Pranabendu Misra, P. Tale
2023Theoretical Computer Science1 citations Open access
Semantic Scholar
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
R. Krithika, V. K. Kutty Malu, Roohani Sharma, P. Tale
2023Foundations of Software Technology and Theoretical Computer Science1 citations Open access
Semantic Scholar
Parameterized Complexity of Isometric Path Cover: Treewidth and Diameter
Dibyayan Chakraborty, Oscar Defrain, F. Foucaud, Mathieu Mari +1 more
20260 citations
Semantic Scholar
On the Hardness of Strong Metric Dimension
P. Tale
20260 citations
Semantic Scholar
Structural parameterizations of Geodetic Set on directed (acyclic) graphs
Laurent Beaudou, F. Foucaud, Lucas Lorieau, P. Tale
2026International Symposium on Mathematical Foundations of Computer Science0 citations
Semantic Scholar
Revisiting Token Sliding on Chordal Graphs
Rajat Adak, S. Nanoti, P. Tale
2025International Workshop on Graph-Theoretic Concepts in Computer Science0 citations
Semantic Scholar
A Finer View of the Parameterized Landscape of Labeled Graph Contractions
Yashaswini Mathur, P. Tale
2025Foundations of Software Technology and Theoretical Computer Science0 citations
Semantic Scholar
Revisiting path contraction and cycle contraction
R. Krithika, V. K. Kutty Malu, P. Tale
2025Journal of computer and system sciences (Print)0 citations
Semantic Scholar
Structural Parameterization of Locating-Dominating Set and Test Cover
Dipayan Chakraborty, F. Foucaud, Diptapriyo Majumdar, P. Tale
2025International/Italian Conference on Algorithms and Complexity0 citations Open access
Semantic Scholar
Robust Contraction Decomposition for Minor-Free Graphs and Its Applications
Sayan Bandyapadhyay, William Lochet, D. Lokshtanov, Dániel Marx +5 more
2025International Colloquium on Automata, Languages and Programming0 citations
Semantic Scholar
Robust Contraction Decomposition for Minor-Free Graphs and its Applications
Sayan Bandyapadhyay, William Lochet, D. Lokshtanov, Dániel Marx +5 more
2024arXiv.org0 citations
Semantic Scholar
Parameterized complexity of multicut in weighted trees
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma +1 more
2023Theoretical Computer Science0 citations Open access
Semantic Scholar
Reducing the Vertex Cover Number via Edge Contractions
Paloma T. Lima, V. D. dos Santos, Ignasi Sau, Uéverton dos Santos Souza +1 more
2022International Symposium on Mathematical Foundations of Computer Science0 citations
Semantic Scholar
Parameterized Complexity of Multicut in Weighted Trees
Roohani Sharma, Esther Galby, Dániel Marx, Philipp Schepper +1 more
2022Social Science Research Network0 citations Open access
Semantic Scholar