default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrafullkumar Tale
Person information
- affiliation: Indian Institute of Science Education and Research Pune, Mathematics Department, India
- affiliation (former): CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica 86(5): 1428-1474 (2024)- [j17]Neeldhara Misra
, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami:
Romeo and Juliet Meeting in Forest Like Regions. Algorithmica 86(11): 3465-3495 (2024) - [c23]Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. ICALP 2024: 66:1-66:19 - [i23]Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale:
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. CoRR abs/2402.08346 (2024) - [i22]Prafullkumar Tale:
Double Exponential Lower Bound for Telephone Broadcast. CoRR abs/2403.03501 (2024) - [i21]Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Conflict and Fairness in Resource Allocation. CoRR abs/2403.04265 (2024) - [i20]R. Krithika, V. K. Kutty Malu, Prafullkumar Tale:
Revisiting Path Contraction and Cycle Contraction. CoRR abs/2403.06290 (2024) - [i19]Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension and Geodetic Set Parameterized by Vertex Cover. CoRR abs/2405.01344 (2024) - 2023
- [j16]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale:
Reducing the vertex cover number via edge contractions. J. Comput. Syst. Sci. 136: 63-87 (2023) - [j15]Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. SIAM J. Discret. Math. 37(4): 2241-2264 (2023) - [j14]R. Krithika, Pranabendu Misra, Prafullkumar Tale:
A single exponential-time FPT algorithm for cactus contraction. Theor. Comput. Sci. 954: 113803 (2023) - [j13]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. 978: 114174 (2023) - [c22]R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. FSTTCS 2023: 8:1-8:18 - [i18]Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. CoRR abs/2307.08149 (2023) - [i17]R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. CoRR abs/2307.10607 (2023) - 2022
- [j12]Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Maximum Degree Contraction Problem. Algorithmica 84(2): 405-435 (2022) - [j11]Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Parameterized Complexity of Maximum Edge Colorable Subgraph. Algorithmica 84(10): 3075-3100 (2022) - [j10]Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale:
On the parameterized complexity of Grid Contraction. J. Comput. Syst. Sci. 129: 22-38 (2022) - [j9]Prafullkumar Tale:
Sparsification lower bound for linear spanners in directed graphs. Theor. Comput. Sci. 898: 69-74 (2022) - [c21]Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami:
Romeo and Juliet Meeting in Forest like Regions. FSTTCS 2022: 27:1-27:22 - [c20]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC 2022: 14:1-14:24 - [c19]Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. MFCS 2022: 51:1-51:15 - [c18]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale:
Reducing the Vertex Cover Number via Edge Contractions. MFCS 2022: 69:1-69:14 - [c17]Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale:
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. SODA 2022: 2085-2127 - [c16]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Weighted Multicut in Trees. WG 2022: 257-270 - [c15]R. Krithika, Roohani Sharma, Prafullkumar Tale:
The Complexity of Contracting Bipartite Graphs into Small Cycles. WG 2022: 356-369 - [i16]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale:
Reducing the Vertex Cover Number via Edge Contractions. CoRR abs/2202.03322 (2022) - [i15]Prafullkumar Tale:
Sparsification Lower Bound for Linear Spanners in Directed Graphs. CoRR abs/2203.08601 (2022) - [i14]R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
Parameterized and Exact Algorithms for Class Domination Coloring. CoRR abs/2203.09106 (2022) - [i13]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Weighted Multicut in Trees. CoRR abs/2205.10105 (2022) - [i12]R. Krithika, Roohani Sharma, Prafullkumar Tale:
The Complexity of Contracting Bipartite Graphs into Small Cycles. CoRR abs/2206.07358 (2022) - [i11]Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. CoRR abs/2206.15424 (2022) - [i10]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR abs/2208.02850 (2022) - [i9]Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami:
Romeo and Juliet Meeting in Forest Like Regions. CoRR abs/2210.02582 (2022) - 2021
- [j8]R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
Parameterized and exact algorithms for class domination coloring. Discret. Appl. Math. 291: 286-299 (2021) - [j7]Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale:
Paths to trees and cacti. Theor. Comput. Sci. 860: 98-116 (2021) - [j6]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ACM Trans. Comput. Theory 13(4): 27:1-27:40 (2021) - [i8]Fredrik Manne, Geevarghese Philip, Saket Saurabh, Prafullkumar Tale:
α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms. CoRR abs/2106.14169 (2021) - [i7]Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale:
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. CoRR abs/2110.15098 (2021) - 2020
- [j5]Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
Path Contraction Faster than 2n. SIAM J. Discret. Math. 34(2): 1302-1325 (2020) - [c14]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. APPROX-RANDOM 2020: 51:1-51:19 - [c13]Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Parameterized Complexity of Maximum Edge Colorable Subgraph. COCOON 2020: 615-626 - [c12]Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Maximum Degree Contraction Problem. IPEC 2020: 26:1-26:16 - [c11]Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale:
On the Parameterized Complexity of Grid Contraction. SWAT 2020: 34:1-34:17 - [i6]Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. CoRR abs/2006.10364 (2020) - [i5]Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Parameterized Complexity of Maximum Edge Colorable Subgraph. CoRR abs/2008.07953 (2020) - [i4]Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale:
On the Parameterized Complexity Of Grid Contraction. CoRR abs/2008.07967 (2020) - [i3]Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem. CoRR abs/2009.11793 (2020)
2010 – 2019
- 2019
- [j4]Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale:
Subset Feedback Vertex Set in Chordal and Split Graphs. Algorithmica 81(9): 3586-3629 (2019) - [j3]Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Contraction to Generalization of Trees. Theory Comput. Syst. 63(3): 587-614 (2019) - [j2]Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale:
Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comput. Sci. 772: 132-142 (2019) - [c10]Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale:
Subset Feedback Vertex Set in Chordal and Split Graphs. CIAC 2019: 365-376 - [c9]Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
Path Contraction Faster Than 2n. ICALP 2019: 11:1-11:13 - [i2]Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale:
Subset Feedback Vertex Set in Chordal and Split Graphs. CoRR abs/1901.02209 (2019) - 2018
- [j1]R. Krithika, Abhishek Sahu, Prafullkumar Tale:
Dynamic Parameterized Problems. Algorithmica 80(9): 2637-2655 (2018) - [c8]R. Krithika, Pranabendu Misra, Prafullkumar Tale:
An FPT Algorithm for Contraction to Cactus. COCOON 2018: 341-352 - 2017
- [c7]Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale:
Exact and Parameterized Algorithms for (k, i)-Coloring. CALDAM 2017: 281-293 - [c6]Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale:
Paths to Trees and Cacti. CIAC 2017: 31-42 - [c5]Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Contraction to Generalization of Trees. IPEC 2017: 1:1-1:12 - [c4]R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
Parameterized and Exact Algorithms for Class Domination Coloring. SOFSEM 2017: 336-349 - [i1]Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Contraction to Generalization of Trees. CoRR abs/1708.00622 (2017) - 2016
- [c3]R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale:
Lossy Kernels for Graph Contraction Problems. FSTTCS 2016: 23:1-23:14 - [c2]R. Krithika, Abhishek Sahu, Prafullkumar Tale:
Dynamic Parameterized Problems. IPEC 2016: 19:1-19:14 - [c1]Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale:
Harmonious Coloring: Parameterized Algorithms and Upper Bounds. WG 2016: 245-256
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
