Abstract is missing.
- Some Easy and Some Not so Easy Geometric Optimization ProblemsGerhard J. Woeginger. 3-18 [doi]
- Deterministic Min-Cost Matching with DelaysYossi Azar, Amit Jacob Fanani. 21-35 [doi]
- Sequential Metric DimensionJulien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. 36-50 [doi]
- A Primal-Dual Online Deterministic Algorithm for Matching with DelaysMarcin Bienkowski, Artur Kraska, Hsiang Hsuan Liu, Pawel Schmidt. 51-68 [doi]
- Advice Complexity of Priority AlgorithmsAllan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov. 69-86 [doi]
- Approximating Node-Weighted k-MST on Planar GraphsJaroslaw Byrka, Mateusz Lewandowski, Joachim Spoerhase. 87-101 [doi]
- Exploring Sparse Graphs with Advice (Extended Abstract)Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger. 102-117 [doi]
- Call Admission Problems on Grids with Advice (Extended Abstract)Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner. 118-133 [doi]
- Improved Approximation Algorithms for Minimum Power Covering ProblemsGruia Calinescu, Guy Kortsarz, Zeev Nutov. 134-148 [doi]
- DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. ArrivalsMinjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky. 149-164 [doi]
- Strategic Contention Resolution in Multiple ChannelsGeorge Christodoulou 0001, Themistoklis Melissourgos, Paul G. Spirakis. 165-180 [doi]
- Sublinear Graph Augmentation for Fast Query ImplementationArtur Czumaj, Yishay Mansour, Shai Vardi. 181-203 [doi]
- Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of AnarchyGyörgy Dósa, Hans Kellerer, Zsolt Tuza. 204-217 [doi]
- Probabilistic Embeddings of the Fréchet DistanceAnne Driemel, Amer Krivosija. 218-237 [doi]
- Algorithms for Dynamic NFV WorkloadYaron Fairstein, Seffi Naor, Danny Raz. 238-258 [doi]
- Longest Increasing Subsequence Under Persistent Comparison ErrorsBarbara Geissmann. 259-276 [doi]
- Cut Sparsifiers for Balanced DigraphsMotoki Ikeda, Shin-ichi Tanigawa. 277-294 [doi]
- Reconfiguration of Graphs with Connectivity ConstraintsNicolas Bousquet, Arnaud Mary. 295-309 [doi]
- The Itinerant List Update ProblemNeil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie. 310-326 [doi]
- The Price of Fixed Assignments in Stochastic Extensible Bin PackingGuillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Alexander Tesch. 327-347 [doi]