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

• 2023
• 
  Manuel Cáceres:
  Parameterized and Safe & Complete Graph Algorithms for Bioinformatics. University of Helsinki, Finland, 2023
• 
  Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
  Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Algorithmica 85(7): 2065-2086 (2023)
• 
  Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach:
  A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev. 48: 100556 (2023)
• 
  Stefan Kratsch, Florian Nelles:
  Efficient parameterized algorithms for computing all-pairs shortest paths. Discret. Appl. Math. 341: 102-119 (2023)
• 
  Xiangyan Kong, Zhen Zhang, Qilong Feng:
  On parameterized approximation algorithms for balanced clustering. J. Comb. Optim. 45(1): 49 (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)
• 
  Nan Jiang, Huanhuan Yang:
  Fast and Accurate Artificial Compressibility Ensemble Algorithms for Computing Parameterized Stokes-Darcy Flow Ensembles. J. Sci. Comput. 94(1): 17 (2023)
• 
  Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
  Parameterized algorithms for finding highly connected solution. Theor. Comput. Sci. 942: 47-56 (2023)
• 
  Bin Sheng, Gregory Z. Gutin:
  Fixed parameterized algorithms for generalized feedback vertex set problems. Theor. Comput. Sci. 953: 113798 (2023)
• 
  Dekel Tsur:
  Faster parameterized algorithms for two vertex deletion problems. Theor. Comput. Sci. 940(Part): 112-123 (2023)
• 
  Dekel Tsur:
  Faster parameterized algorithms for Bicluster Editing and Flip Consensus Tree. Theor. Comput. Sci. 953: 113796 (2023)
• 
  Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier:
  Parameterized Algorithms for Colored Clustering. AAAI 2023: 4400-4408
• 
  Tom Peham, Lukas Burgholzer, Robert Wille:
  Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation of Variational Quantum Algorithms. ASP-DAC 2023: 702-708
• 
  Vedangi Bengali, Nate Veldt:
  Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. CIKM 2023: 78-87
• 
  Manuel Cáceres:
  Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond. CPM 2023: 7:1-7:19
• 
  Matthias Bentert, Klaus Heeger, Tomohiro Koana:
  Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. ESA 2023: 16:1-16:16
• 
  Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
  Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA 2023: 18:1-18:18
• 
  Falko Hegerfeld, Stefan Kratsch:
  Tight Algorithms for Connectivity Problems Parameterized by Clique-Width. ESA 2023: 59:1-59:19
• 
  Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza:
  Exact and Parameterized Algorithms for the Independent Cutset Problem. FCT 2023: 378-391
• 
  Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
  Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. ICALP 2023: 93:1-93:19
• 
  Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma:
  Parameterized Algorithms for Eccentricity Shortest Path Problem. IWOCA 2023: 74-86
• 
  Bastien Thomas, Ocan Sankur:
  PyLTA: A Verification Tool for Parameterized Distributed Algorithms. TACAS (2) 2023: 28-35
• 
  Falko Hegerfeld, Stefan Kratsch:
  Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth. WG 2023: 388-402
• 
  Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier:
  Parameterized Algorithms for Colored Clustering. CoRR abs/2302.00630 (2023)
• 
  Falko Hegerfeld, Stefan Kratsch:
  Tight algorithms for connectivity problems parameterized by clique-width. CoRR abs/2302.03627 (2023)
• 
  Falko Hegerfeld, Stefan Kratsch:
  Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth. CoRR abs/2302.14128 (2023)
• 
  Giovanna K. Conrado, Amir Kafshdar Goharshady, Harshit J. Motwani, Sergei Novozhilov:
  Parameterized Algorithms for Topological Indices in Chemistry. CoRR abs/2303.13279 (2023)
• 
  Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma:
  Parameterized algorithms for Eccentricity Shortest Path Problem. CoRR abs/2304.03233 (2023)
• 
  Yichuan Deng, Sridhar Mahadevan, Zhao Song:
  Randomized and Deterministic Attention Sparsification Algorithms for Over-parameterized Feature Dimension. CoRR abs/2304.04397 (2023)
• 
  Vedangi Bengali, Nate Veldt:
  Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. CoRR abs/2306.04884 (2023)

skipping 562 more matches