Search Results - Tale, Prafullkumar
- Showing 1 - 18 results of 18
-
1
Double Exponential Lower Bound for Telephone Broadcast by Tale, Prafullkumar
Published 2024Fuente: arXivPreprintAcceso al recurso -
2
Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number by Tale, Prafullkumar
Published 2025Fuente: arXivPreprintAcceso al recurso -
3
A Finer View of the Parameterized Landscape of Labeled Graph Contractions by Mathur, Yashaswini, Tale, Prafullkumar
Published 2025Fuente: arXivPreprintAcceso al recurso -
4
The Complexity of Contracting Bipartite Graphs into Small Cycles by Krithika, R., Sharma, Roohani, Tale, Prafullkumar
Published 2022Fuente: arXivPreprintAcceso al recurso -
5
A Single Exponential-Time FPT Algorithm for Cactus Contraction by Krithika, R., Misra, Pranabendu, Tale, Prafullkumar
Published 2025Fuente: arXivPreprintAcceso al recurso -
6
Revisiting Token Sliding on Chordal Graphs by Adak, Rajat, Nanoti, Saraswati Girish, Tale, Prafullkumar
Published 2025Fuente: arXivPreprintAcceso al recurso -
7
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover by Chakraborty, Dipayan, Foucaud, Florent, Majumdar, Diptapriyo, Tale, Prafullkumar
Published 2024Fuente: arXivPreprintAcceso al recurso -
8
Revisiting Path Contraction and Cycle Contraction by Krithika, R., Malu, V. K. Kutty, Tale, Prafullkumar
Published 2024Fuente: arXivPreprintAcceso al recurso -
9
Structural Parameterization of Locating-Dominating Set and Test Cover by Chakraborty, Dipayan, Foucaud, Florent, Majumdar, Diptapriyo, Tale, Prafullkumar
Published 2024Fuente: arXivPreprintAcceso al recurso -
10
The Parameterized Complexity of Computing the VC-Dimension by Foucaud, Florent, Gahlawat, Harmender, Inerney, Fionn Mc, Tale, Prafullkumar
Published 2025Fuente: arXivPreprintAcceso al recurso -
11
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction by Krithika, R., Malu, V. K. Kutty, Sharma, Roohani, Tale, Prafullkumar
Published 2023Fuente: arXivPreprintAcceso al recurso -
12
Parameterized complexity of isometric path partition: treewidth and diameter by Chakraborty, Dibyayan, Defrain, Oscar, Foucaud, Florent, Mari, Mathieu, Tale, Prafullkumar
Published 2025Fuente: arXivPreprintAcceso al recurso -
13
Path Contraction Faster than $2^n$ by Agrawal, Akanksha, Fomin, Fedor V., Lokshtanov, Daniel, Saurabh, Saket, Tale, Prafullkumar
Published 2025Fuente: arXivPreprintAcceso al recurso -
14
Conflict and Fairness in Resource Allocation by Bandopadhyay, Susobhan, Banik, Aritra, Gupta, Sushmita, Jain, Pallavi, Sahu, Abhishek, Saurabh, Saket, Tale, Prafullkumar
Published 2024Fuente: arXivPreprintAcceso al recurso -
15
Algorithms and Hardness for Geodetic Set on Tree-like Digraphs by Foucaud, Florent, Ghareghani, Narges, Lorieau, Lucas, Mohammad-Noori, Morteza, Oskuei, Rasa Parvini, Tale, Prafullkumar
Published 2026Fuente: arXivPreprintAcceso al recurso -
16
Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover by Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Inerney, Fionn Mc, Sharma, Roohani, Tale, Prafullkumar
Published 2023Fuente: arXivPreprintAcceso al recurso -
17
Metric Dimension and Geodetic Set Parameterized by Vertex Cover by Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Inerney, Fionn Mc, Sharma, Roohani, Tale, Prafullkumar
Published 2024Fuente: arXivPreprintAcceso al recurso -
18
Robust Contraction Decomposition for Minor-Free Graphs and its Applications by Bandyapadhyay, Sayan, Lochet, William, Lokshtanov, Daniel, Marx, Dániel, Misra, Pranabendu, Neuen, Daniel, Saurabh, Saket, Tale, Prafullkumar, Xue, Jie
Published 2024Fuente: arXivPreprintAcceso al recurso