• 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 53 matches

• 2024
• 
  Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit:
  Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms. Theor. Comput. Sci. 990: 114402 (2024)
• 
  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
• 
  Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi:
  A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. ISAAC 2024: 41:1-41:17
• 
  Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu:
  Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. MFCS 2024: 16:1-16: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)
• 
  Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
  Bi-objective Optimization in Role Mining. CoRR abs/2403.16757 (2024)
• 
  Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman:
  Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs. CoRR abs/2405.10556 (2024)
• 
  Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi:
  A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. CoRR abs/2409.14209 (2024)
• 2023
• 
  Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
  Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. Algorithms 16(3): 144 (2023)
• 
  Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström:
  p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms. J. Comput. Syst. Sci. 133: 23-40 (2023)
• 
  Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman:
  Deletion to scattered graph classes I - Case of finite number of graph classes. J. Comput. Syst. Sci. 138: 103460 (2023)
• 
  Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
  Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes. J. Comput. Syst. Sci. 136: 280-301 (2023)
• 
  Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
  Finding a Highly Connected Steiner Subgraph and its Applications. MFCS 2023: 45:1-45:15
• 
  Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
  Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. CoRR abs/2303.02687 (2023)
• 
  Diptapriyo Majumdar:
  Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree. CoRR abs/2308.01286 (2023)
• 
  Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan:
  Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective. CoRR abs/2309.04346 (2023)
• 
  Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
  Highly Connected Steiner Subgraph - Parameterized Algorithms and Applications to Hitting Set Problems. CoRR abs/2311.02708 (2023)
• 2022
• 
  Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
  Valued Authorization Policy Existence Problem: Theory and Experiments. ACM Trans. Priv. Secur. 25(4): 28:1-28:32 (2022)
• 
  Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
  Generalized Noise Role Mining. SACMAT 2022: 91-102
• 
  Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
  On the Lossy Kernelization for Connected Treedepth Deletion Set. WG 2022: 201-214
• 
  Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
  Deletion to Scattered Graph Classes II - Improved FPT Algorithms for Deletion to Pairs of Graph Classes. CoRR abs/2201.03142 (2022)
• 
  Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
  An Improved Time-Efficient Approximate Kernelization for Connected Treedepth Deletion Set. CoRR abs/2212.00418 (2022)
• 2021
• 
  Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
  Parameterized Complexity of Conflict-Free Set Cover. Theory Comput. Syst. 65(3): 515-540 (2021)
• 
  Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
  Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM J. Discret. Math. 35(1): 575-596 (2021)
• 
  Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar:
  Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis. ACM Trans. Priv. Secur. 24(3): 21:1-21:22 (2021)
• 
  Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit:
  Constrained Hitting Set Problem with Intervals. COCOON 2021: 604-616
• 
  Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
  Faster FPT Algorithms for Deletion to Pairs of Graph Classes. FCT 2021: 314-326
• 
  Jason Crampton, Eduard Eiben, Gregory Z. Gutin, Daniel Karapetyan, Diptapriyo Majumdar:
  Valued Authorization Policy Existence Problem. SACMAT 2021: 83-94
• 
  Jason Crampton, Gregory Z. Gutin, Diptapriyo Majumdar:
  Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis. CoRR abs/2104.05983 (2021)
• 
  Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman:
  Deletion to Scattered Graph Classes I -- case of finite number of graph classes. CoRR abs/2105.04660 (2021)

skipping 23 more matches