Follow
Prafullkumar Tale
Prafullkumar Tale
INSPIRE Faculty, Mathematics Department, IISER Pune
Verified email at iiserpune.ac.in - Homepage
Title
Cited by
Cited by
Year
Dynamic parameterized problems
R Krithika, A Sahu, P Tale
Algorithmica 80, 2637-2655, 2018
222018
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
222016
Parameterized and exact algorithms for class domination coloring
R Krithika, A Rai, S Saurabh, P Tale
Discrete Applied Mathematics 291, 286-299, 2021
162021
On the parameterized complexity of contraction to generalization of trees
A Agarwal, S Saurabh, P Tale
Theory of Computing Systems 63, 587-614, 2019
142019
Paths to trees and cacti
A Agrawal, L Kanesh, S Saurabh, P Tale
Theoretical Computer Science 860, 98-116, 2021
132021
Subset feedback vertex set in chordal and split graphs
G Philip, V Rajan, S Saurabh, P Tale
Algorithmica 81, 3586-3629, 2019
112019
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
82023
An FPT algorithm for contraction to cactus
R Krithika, P Misra, P Tale
International Computing and Combinatorics Conference, 341-352, 2018
82018
Parameterized complexity of maximum edge colorable subgraph
A Agrawal, M Kundu, A Sahu, S Saurabh, P Tale
Algorithmica 84 (10), 3075-3100, 2022
72022
On the parameterized complexity of grid contraction
S Saurabh, US Souza, P Tale
arXiv preprint arXiv:2008.07967, 2020
72020
Path Contraction Faster than
A Agrawal, FV Fomin, D Lokshtanov, S Saurabh, P Tale
SIAM Journal on Discrete Mathematics 34 (2), 1302-1325, 2020
72020
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
62024
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
52024
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
52022
Harmonious coloring: Parameterized algorithms and upper bounds
S Kolay, R Pandurangan, F Panolan, V Raman, P Tale
Theoretical Computer Science 772, 132-142, 2019
52019
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
42024
Double Exponential Lower Bound for Telephone Broadcast
P Tale
arXiv preprint arXiv:2403.03501, 2024
42024
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
42022
On the parameterized complexity of maximum degree contraction problem
S Saurabh, P Tale
Algorithmica, 1-31, 2020
42020
Exact and Parameterized Algorithms for (ki)-Coloring
D Majumdar, R Neogi, V Raman, P Tale
Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017
42017
The system can't perform the operation now. Try again later.
Articles 1–20