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

• 2018
• 
  Roberto Solis-Oba, Rudolf Fleischer:
  Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10787, Springer 2018, ISBN 978-3-319-89440-9 [contents]
• 2017
• 
  Abhijin Adiga, Alexander D. Friedman, Sharath Raghvendra:
  A k-Median Based Online Algorithm for the Stochastic k-Server Problem. WAOA 2017: 176-189
• 
  Soroush Alamdari, David B. Shmoys:
  A Bicriteria Approximation Algorithm for the k-Center and k-Median Problems. WAOA 2017: 66-75
• 
  Antonios Antoniadis, Kevin Schewior:
  A Tight Lower Bound for Online Convex Optimization with Switching Costs. WAOA 2017: 164-175
• 
  János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
  Lower Bounds for Several Online Variants of Bin Packing. WAOA 2017: 102-117
• 
  Amariah Becker:
  Capacitated Domination Problems on Planar Graphs. WAOA 2017: 1-16
• 
  Marcin Bienkowski, Artur Kraska, Pawel Schmidt:
  A Match in Time Saves Nine: Deterministic Online Matching with Delays. WAOA 2017: 132-146
• 
  Felix Biermeier, Björn Feldkord, Manuel Malatyali, Friedhelm Meyer auf der Heide:
  A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. WAOA 2017: 285-300
• 
  Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý:
  On Packet Scheduling with Adversarial Jamming and Speedup. WAOA 2017: 190-206
• 
  Allan Borodin, Denis Pankratov, Amirali Salehi-Abari:
  On Conceptually Simple Algorithms for Variants of Online Bipartite Matching. WAOA 2017: 253-268
• 
  Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein:
  Improved PTASs for Convex Barrier Coverage. WAOA 2017: 26-40
• 
  Dariusz Dereniowski, Dorota Urbanska:
  On-line Search in Two-Dimensional Environment. WAOA 2017: 223-237
• 
  Adrian Dumitrescu, Csaba D. Tóth:
  Online Unit Clustering in Higher Dimensions. WAOA 2017: 238-252
• 
  Boaz Farbstein, Asaf Levin:
  Deadline TSP. WAOA 2017: 52-65
• 
  Mário César San Felice, Cristina G. Fernandes, Carla Negri Lintzmayer:
  The Online Multicommodity Connected Facility Location Problem. WAOA 2017: 118-131
• 
  Michele Flammini, Gianpiero Monaco, Qiang Zhang:
  Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. WAOA 2017: 301-316
• 
  Toshihiro Fujito:
  On Approximability of Connected Path Vertex Cover. WAOA 2017: 17-25
• 
  Janusz Januszewski, Lukasz Zielonka:
  Online Packing of Rectangular Items into Square Bins. WAOA 2017: 147-163
• 
  Jasper de Jong, Walter Kern, Berend Steenhuisen, Marc Uetz:
  The Asymptotic Price of Anarchy for k-uniform Congestion Games. WAOA 2017: 317-328
• 
  Naoyuki Kamiyama:
  Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints. WAOA 2017: 90-101
• 
  Itay Laish, Shay Mozes:
  Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs. WAOA 2017: 269-284
• 
  Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
  Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. WAOA 2017: 207-222
• 
  Saeed Mehrabi:
  Approximating Domination on Intersection Graphs of Paths on a Grid. WAOA 2017: 76-89
• 
  Vladimir Shenmaier:
  Complexity and Approximation of the Longest Vector Sum Problem. WAOA 2017: 41-51