Folgen
Prafullkumar Tale
Prafullkumar Tale
INSPIRE Faculty, Mathematics Department, IISER Pune
Bestätigte E-Mail-Adresse bei iiserpune.ac.in - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
Dynamic parameterized problems
R Krithika, A Sahu, P Tale
Algorithmica 80, 2637-2655, 2018
202018
Parameterized and exact algorithms for class domination coloring
R Krithika, A Rai, S Saurabh, P Tale
Discrete Applied Mathematics 291, 286-299, 2021
152021
On the parameterized complexity of contraction to generalization of trees
A Agarwal, S Saurabh, P Tale
Theory of Computing Systems 63, 587-614, 2019
152019
Paths to trees and cacti
A Agrawal, L Kanesh, S Saurabh, P Tale
Theoretical Computer Science 860, 98-116, 2021
112021
Subset feedback vertex set in chordal and split graphs
G Philip, V Rajan, S Saurabh, P Tale
Algorithmica 81, 3586-3629, 2019
92019
An FPT algorithm for contraction to cactus
R Krithika, P Misra, P Tale
International Computing and Combinatorics Conference, 341-352, 2018
82018
On the parameterized complexity of grid contraction
S Saurabh, US Souza, P Tale
arXiv preprint arXiv:2008.07967, 2020
62020
Path Contraction Faster than
A Agrawal, FV Fomin, D Lokshtanov, S Saurabh, P Tale
SIAM Journal on Discrete Mathematics 34 (2), 1302-1325, 2020
62020
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
42023
Parameterized complexity of maximum edge colorable subgraph
A Agrawal, M Kundu, A Sahu, S Saurabh, P Tale
Algorithmica 84 (10), 3075-3100, 2022
42022
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
42022
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
42021
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
On the parameterized complexity of maximum degree contraction problem
S Saurabh, P Tale
Algorithmica, 1-31, 2020
32020
Harmonious coloring: Parameterized algorithms and upper bounds
S Kolay, R Pandurangan, F Panolan, V Raman, P Tale
Theoretical Computer Science 772, 132-142, 2019
32019
Path contraction faster than 2n
A Agrawal, F Fomin, D Lokshtanov, S Saurabh, P Tale
Dagstuhl Publishing, 2019
32019
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
22022
Domination and cut problems on chordal graphs with bounded leafage
E Galby, D Marx, P Schepper, R Sharma, P Tale
Algorithmica, 1-47, 2023
12023
Reducing the vertex cover number via edge contractions
PT Lima, VF dos Santos, I Sau, US Souza, P Tale
Journal of Computer and System Sciences 136, 63-87, 2023
12023
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20