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

• 2023
• 
  Sander Aarts, David B. Shmoys:
  Hitting Sets when the Shallow Cell Complexity is Small. WAOA 2023: 160-174
• 
  Shanli Alefkhani, Nima Khodaveisi, Mathieu Mari:
  Online Hitting Set of d-Dimensional Fat Objects. WAOA 2023: 134-144
• 
  Eric Balkanski, Tingting Ou, Clifford Stein, Hao-Ting Wei:
  Scheduling with Speed Predictions. WAOA 2023: 74-89
• 
  Mateusz Basiak, Marcin Bienkowski, Agnieszka Tatarczuk:
  An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem. WAOA 2023: 45-58
• 
  Gunther Bidlingmaier:
  Greedy Minimum-Energy Scheduling. WAOA 2023: 59-73
• 
  Allan Borodin, Christodoulos Karavasilis:
  Any-Order Online Interval Selection. WAOA 2023: 175-189
• 
  Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie:
  Total Completion Time Scheduling Under Scenarios. WAOA 2023: 104-118
• 
  Philip Cervenjak, Junhao Gan, Anthony Wirth:
  Fast Parallel Algorithms for Submodular p-Superseparable Maximization. WAOA 2023: 219-233
• 
  Vítor Gomes Chagas, Elisa Dell'Arriva, Flávio Keidi Miyazawa:
  Approximation Schemes Under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes. WAOA 2023: 145-159
• 
  Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase:
  Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations. WAOA 2023: 205-218
• 
  Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov:
  Improved Approximations for Relative Survivable Network Design. WAOA 2023: 190-204
• 
  Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt, Julian Wargalla:
  Approximating Fair k-Min-Sum-Radii in Euclidean Space. WAOA 2023: 119-133
• 
  William S. Evans, David G. Kirkpatrick:
  A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities. WAOA 2023: 14-28
• 
  Alison Hsiang-Hsuan Liu, Fu-Hong Liu, Prudence W. H. Wong, Xiao-Ou Zhang:
  The Power of Amortization on Scheduling with Explorable Uncertainty. WAOA 2023: 90-103
• 
  Bodo Manthey, Jesse van Rhijn:
  Approximation Ineffectiveness of a Tour-Untangling Heuristic. WAOA 2023: 1-13
• 
  Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze:
  Approximating Maximum Edge 2-Coloring by Normalizing Graphs. WAOA 2023: 29-44
• 
  Jaroslaw Byrka, Andreas Wiese:
  Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings. Lecture Notes in Computer Science 14297, Springer 2023, ISBN 978-3-031-49814-5 [contents]
• 2022
• 
  Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer:
  Knapsack Secretary Through Boosting. WAOA 2022: 61-81
• 
  Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker:
  An Improved Algorithm for Open Online Dial-a-Ride. WAOA 2022: 154-171
• 
  Evripidis Bampis, Bruno Escoffier, Michalis Xefteris:
  Canadian Traveller Problem with Predictions. WAOA 2022: 116-133
• 
  Sujoy Bhore, Fabian Klute, Jelle J. Oostveen:
  On Streaming Algorithms for Geometric Independent Set and Clique. WAOA 2022: 211-224
• 
  Moritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt:
  Scheduling with Machine Conflicts. WAOA 2022: 36-60
• 
  Maike Buchin, Anne Driemel, Koen van Greevenbroek, Ioannis Psarros, Dennis Rohde:
  Approximating Length-Restricted Means Under Dynamic Time Warping. WAOA 2022: 225-253
• 
  Ilan Reuven Cohen:
  Stochastic Graph Exploration with Limited Resources. WAOA 2022: 172-189
• 
  Rajni Dabas, Naveen Garg, Neelima Gupta, Dilpreet Kaur:
  Locating Service and Charging Stations. WAOA 2022: 1-19
• 
  Lisa Hellerstein, Devorah Kletenik, Naifeng Liu, R. Teal Witter:
  Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem. WAOA 2022: 190-210
• 
  Matej Lieskovský, Jirí Sgall:
  Graph Burning and Non-uniform k-centers for Small Treewidth. WAOA 2022: 20-35
• 
  Alison Hsiang-Hsuan Liu, Jonathan Toole-Charignon:
  The Power of Amortized Recourse for Online Graph Problems. WAOA 2022: 134-153
• 
  Devin Smedira, David B. Shmoys:
  Scheduling Appointments Online: The Power of Deferred Decision-Making. WAOA 2022: 82-115
• 
  Parinya Chalermsook, Bundit Laekhanukit:
  Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings. Lecture Notes in Computer Science 13538, Springer 2022, ISBN 978-3-031-18366-9 [contents]

skipping 411 more matches