| 0 | -- | 0 | Deepak Ajwani, Tobias Friedrich, Ulrich Meyer. An ::::O::::(::::n:::::::2.75:::) algorithm for incremental topological ordering |
| 0 | -- | 0 | Joan Boyar, Paul Medvedev. The relative worst order ratio applied to seat reservation |
| 0 | -- | 0 | Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis. Atomic congestion games among coalitions |
| 0 | -- | 0 | Tim Nieberg, Johann Hurink, Walter Kern. Approximation schemes for wireless networks |
| 0 | -- | 0 | Akiko Suzuki, Takeshi Tokuyama. Dense subgraph problems with output-density conditions |
| 0 | -- | 0 | Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky. Deterministic conflict-free coloring for intervals: From offline to online |
| 0 | -- | 0 | Markus Bläser. A new approximation algorithm for the asymmetric TSP with triangle inequality |
| 0 | -- | 0 | Jens Maßberg, Jens Vygen. Approximation algorithms for a facility location problem with service capacities |
| 0 | -- | 0 | Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos. Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics |
| 0 | -- | 0 | Chaitanya Swamy, David B. Shmoys. Fault-tolerant facility location |
| 0 | -- | 0 | Louis Ibarra. Fully dynamic algorithms for chordal graphs and split graphs |
| 0 | -- | 0 | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg. Label-guided graph exploration by a finite automaton |
| 0 | -- | 0 | Amos Korman, David Peleg. Dynamic routing schemes for graphs with low local density |
| 0 | -- | 0 | Nishanth Chandran, Ryan Moriarty, Rafail Ostrovsky, Omkant Pandey, Mohammad Ali Safari, Amit Sahai. Improved algorithms for optimal embeddings |