Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th WAOA 2018: Helsinki, Finland
- Leah Epstein, Thomas Erlebach:
Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11312, Springer 2018, ISBN 978-3-030-04692-7
Invited Contribution
- Gerhard J. Woeginger:
Some Easy and Some Not so Easy Geometric Optimization Problems. 3-18
Regular Papers
- Yossi Azar, Amit Jacob Fanani:
Deterministic Min-Cost Matching with Delays. 21-35 - Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney
, Nicolas Nisse, Stéphane Pérennes:
Sequential Metric Dimension. 36-50 - Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu, Pawel Schmidt:
A Primal-Dual Online Deterministic Algorithm for Matching with Delays. 51-68 - Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice Complexity of Priority Algorithms. 69-86 - Jaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase:
Approximating Node-Weighted k-MST on Planar Graphs. 87-101 - Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger:
Exploring Sparse Graphs with Advice (Extended Abstract). 102-117 - Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner:
Call Admission Problems on Grids with Advice (Extended Abstract). 118-133 - Gruia Calinescu, Guy Kortsarz, Zeev Nutov:
Improved Approximation Algorithms for Minimum Power Covering Problems. 134-148 - Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky:
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. 149-164 - George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis:
Strategic Contention Resolution in Multiple Channels. 165-180 - Artur Czumaj, Yishay Mansour, Shai Vardi:
Sublinear Graph Augmentation for Fast Query Implementation. 181-203 - György Dósa, Hans Kellerer, Zsolt Tuza:
Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy. 204-217 - Anne Driemel, Amer Krivosija:
Probabilistic Embeddings of the Fréchet Distance. 218-237 - Yaron Fairstein, Seffi Naor, Danny Raz:
Algorithms for Dynamic NFV Workload. 238-258 - Barbara Geissmann:
Longest Increasing Subsequence Under Persistent Comparison Errors. 259-276 - Motoki Ikeda, Shin-ichi Tanigawa:
Cut Sparsifiers for Balanced Digraphs. 277-294 - Nicolas Bousquet, Arnaud Mary:
Reconfiguration of Graphs with Connectivity Constraints. 295-309 - Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie:
The Itinerant List Update Problem. 310-326 - Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Alexander Tesch:
The Price of Fixed Assignments in Stochastic Extensible Bin Packing. 327-347
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-21 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
