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

• 2021
• 
  Christos Kaklamanis, Asaf Levin:
  Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12806, Springer 2021, ISBN 978-3-030-80878-5 [contents]
• 2020
• 
  Susanne Albers, Alexander Eckl:
  Explorable Uncertainty in Scheduling with Non-uniform Testing Times. WAOA 2020: 127-142
• 
  Stav Ashur, Omrit Filtser, Matthew J. Katz:
  A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon. WAOA 2020: 81-96
• 
  Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov:
  LP-Based Algorithms for Multistage Minimization Problems. WAOA 2020: 1-15
• 
  Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk:
  To Close Is Easier Than To Open: Dual Parameterization To k-Median. WAOA 2020: 113-126
• 
  Jaroslaw Byrka, Mateusz Lewandowski:
  Concave Connection Cost Facility Location and the Star Inventory Routing Problem. WAOA 2020: 174-188
• 
  Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos:
  Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics. WAOA 2020: 143-158
• 
  Michael Dinitz, Yasamin Nazari, Zeyu Zhang:
  Lasserre Integrality Gaps for Graph Spanners and Related Problems. WAOA 2020: 97-112
• 
  Magnús M. Halldórsson, Guy Kortsarz, Marek Cygan:
  Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. WAOA 2020: 159-173
• 
  Oussama Hanguir, Clifford Stein:
  Distributed Algorithms for Matching in Hypergraphs. WAOA 2020: 30-46
• 
  Ardalan Khazraei, Stephan Held:
  An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem. WAOA 2020: 189-203
• 
  Wenxin Li, Joohyun Lee, Ness B. Shroff:
  A Faster FPTAS for Knapsack Problem with Cardinality Constraint. WAOA 2020: 16-29
• 
  Yaqiao Li, Vishnu V. Narayan, Denis Pankratov:
  Online Coloring and a New Type of Adversary for Online Graph Problems. WAOA 2020: 47-62
• 
  Raghunath Reddy Madireddy, Apurva Mudgal:
  A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks. WAOA 2020: 204-219
• 
  Zeev Nutov:
  2-Node-Connectivity Network Design. WAOA 2020: 220-235
• 
  Guido Schäfer, Bernard G. Zweers:
  Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique. WAOA 2020: 63-80