Lossy kernels for graph contraction problems R Krithika, P Misra, A Rai, P Tale
36th IARCS Annual Conference on Foundations of Software Technology and …, 2016
22 2016 Dynamic parameterized problems R Krithika, A Sahu, P Tale
Algorithmica 80, 2637-2655, 2018
20 2018 Parameterized and exact algorithms for class domination coloring R Krithika, A Rai, S Saurabh, P Tale
Discrete Applied Mathematics 291, 286-299, 2021
16 2021 On the parameterized complexity of contraction to generalization of trees A Agarwal, S Saurabh, P Tale
Theory of Computing Systems 63, 587-614, 2019
14 2019 Paths to trees and cacti A Agrawal, L Kanesh, S Saurabh, P Tale
Theoretical Computer Science 860, 98-116, 2021
12 2021 Subset feedback vertex set in chordal and split graphs G Philip, V Rajan, S Saurabh, P Tale
Algorithmica 81, 3586-3629, 2019
10 2019 An FPT algorithm for contraction to cactus R Krithika, P Misra, P Tale
International Computing and Combinatorics Conference, 341-352, 2018
8 2018 Metric dimension parameterized by feedback vertex set and other structural parameters E Galby, L Khazaliya, F Mc Inerney, R Sharma, P Tale
SIAM Journal on Discrete Mathematics 37 (4), 2241-2264, 2023
7 2023 On the parameterized complexity of grid contraction S Saurabh, US Souza, P Tale
arXiv preprint arXiv:2008.07967, 2020
7 2020 Path Contraction Faster than A Agrawal, FV Fomin, D Lokshtanov, S Saurabh, P Tale
SIAM Journal on Discrete Mathematics 34 (2), 1302-1325, 2020
7 2020 Parameterized complexity of maximum edge colorable subgraph A Agrawal, M Kundu, A Sahu, S Saurabh, P Tale
Algorithmica 84 (10), 3075-3100, 2022
6 2022 Tight (double) exponential bounds for identification problems: Locating-dominating set and test cover D Chakraborty, F Foucaud, D Majumdar, P Tale
arXiv preprint arXiv:2402.08346, 2024
4 2024 Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover F Foucaud, E Galby, L Khazaliya, S Li, F Mc Inerney, R Sharma, P Tale
51st International Colloquium on Automata, Languages, and Programming (ICALP …, 2024
4 2024 Parameterized complexity of weighted multicut in trees E Galby, D Marx, P Schepper, R Sharma, P Tale
International Workshop on Graph-Theoretic Concepts in Computer Science, 257-270, 2022
4 2022 A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs∗ D Marx, P Misra, D Neuen, P Tale
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
4 2022 On the parameterized complexity of maximum degree contraction problem S Saurabh, P Tale
Algorithmica, 1-31, 2020
4 2020 Exact and Parameterized Algorithms for (k , i )-Coloring D Majumdar, R Neogi, V Raman, P Tale
Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017
4 2017 Domination and cut problems on chordal graphs with bounded leafage E Galby, D Marx, P Schepper, R Sharma, P Tale
Algorithmica 86 (5), 1428-1474, 2024
3 2024 Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations F Foucaud, E Galby, L Khazaliya, S Li, FM Inerney, R Sharma, P Tale
arXiv preprint arXiv:2307.08149, 2023
3 2023 On the parameterized approximability of contraction to classes of chordal graphs S Gunda, P Jain, D Lokshtanov, S Saurabh, P Tale
ACM Transactions on Computation Theory (TOCT) 13 (4), 1-40, 2021
3 2021 