• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 65 matches

• 2024
• 
  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)
• 
  Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami:
  Romeo and Juliet Meeting in Forest Like Regions. Algorithmica 86(11): 3465-3495 (2024)
• 
  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
• 
  Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale:
  Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. ISAAC 2024: 19:1-19:18
• 
  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)
• 
  Prafullkumar Tale:
  Double Exponential Lower Bound for Telephone Broadcast. CoRR abs/2403.03501 (2024)
• 
  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)
• 
  R. Krithika, V. K. Kutty Malu, Prafullkumar Tale:
  Revisiting Path Contraction and Cycle Contraction. CoRR abs/2403.06290 (2024)
• 
  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
• 
  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)
• 
  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)
• 
  R. Krithika, Pranabendu Misra, Prafullkumar Tale:
  A single exponential-time FPT algorithm for cactus contraction. Theor. Comput. Sci. 954: 113803 (2023)
• 
  Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
  Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. 978: 114174 (2023)
• 
  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
• 
  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)
• 
  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
• 
  Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
  Parameterized Complexity of Maximum Edge Colorable Subgraph. Algorithmica 84(10): 3075-3100 (2022)
• 
  Saket Saurabh, Prafullkumar Tale:
  On the Parameterized Complexity of Maximum Degree Contraction Problem. Algorithmica 84(2): 405-435 (2022)
• 
  Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale:
  On the parameterized complexity of Grid Contraction. J. Comput. Syst. Sci. 129: 22-38 (2022)
• 
  Prafullkumar Tale:
  Sparsification lower bound for linear spanners in directed graphs. Theor. Comput. Sci. 898: 69-74 (2022)
• 
  Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami:
  Romeo and Juliet Meeting in Forest like Regions. FSTTCS 2022: 27:1-27:22
• 
  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
• 
  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
• 
  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
• 
  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
• 
  Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
  Parameterized Complexity of Weighted Multicut in Trees. WG 2022: 257-270
• 
  R. Krithika, Roohani Sharma, Prafullkumar Tale:
  The Complexity of Contracting Bipartite Graphs into Small Cycles. WG 2022: 356-369
• 
  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)
• 
  Prafullkumar Tale:
  Sparsification Lower Bound for Linear Spanners in Directed Graphs. CoRR abs/2203.08601 (2022)
• 
  R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
  Parameterized and Exact Algorithms for Class Domination Coloring. CoRR abs/2203.09106 (2022)

skipping 35 more matches