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

• 2020
• 
  Evripidis Bampis, Nicole Megow:
  Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers. Lecture Notes in Computer Science 11926, Springer 2020, ISBN 978-3-030-39478-3 [contents]
• 2019
• 
  Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler:
  Fair Coresets and Streaming Algorithms for Fair k-means. WAOA 2019: 232-251
• 
  Stav Ashur, Omrit Filtser, Matthew J. Katz, Rachel Saban:
  Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains. WAOA 2019: 1-17
• 
  János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
  A New Lower Bound for Classic Online Bin Packing. WAOA 2019: 18-28
• 
  Pierre Bergé, Lou Salaün:
  Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts. WAOA 2019: 29-42
• 
  Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof:
  Robust Online Algorithms for Certain Dynamic Packing Problems. WAOA 2019: 43-59
• 
  Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder:
  Approximation Results for Makespan Minimization with Budgeted Uncertainty. WAOA 2019: 60-71
• 
  Graham Cormode, Pavel Veselý:
  Streaming Algorithms for Bin Packing and Vector Scheduling. WAOA 2019: 72-88
• 
  Karl Däubel:
  An Improved Upper Bound for the Ring Loading Problem. WAOA 2019: 89-105
• 
  Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt:
  Parallel Online Algorithms for the Bin Packing Problem. WAOA 2019: 106-119
• 
  Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
  Managing Multiple Mobile Resources. WAOA 2019: 120-137
• 
  Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat:
  On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. WAOA 2019: 138-153
• 
  Nicolas Grelier, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
  Approximate Strong Edge-Colouring of Unit Disk Graphs. WAOA 2019: 154-169
• 
  Felix Happach, Andreas S. Schulz:
  Precedence-Constrained Scheduling and Min-Sum Set Cover. WAOA 2019: 170-187
• 
  Tanmay Inamdar, Kasturi R. Varadarajan:
  Fault Tolerant Clustering with Outliers. WAOA 2019: 188-201
• 
  Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
  Improved (In-)Approximability Bounds for d-Scattered Set. WAOA 2019: 202-216
• 
  Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong:
  Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. WAOA 2019: 217-231