Abstract is missing.
- Approximation Ineffectiveness of a Tour-Untangling HeuristicBodo Manthey, Jesse van Rhijn. 1-13 [doi]
- A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving EntitiesWilliam S. Evans, David G. Kirkpatrick. 14-28 [doi]
- Approximating Maximum Edge 2-Coloring by Normalizing GraphsTobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze. 29-44 [doi]
- An Improved Deterministic Algorithm for the Online Min-Sum Set Cover ProblemMateusz Basiak, Marcin Bienkowski, Agnieszka Tatarczuk. 45-58 [doi]
- Greedy Minimum-Energy SchedulingGunther Bidlingmaier. 59-73 [doi]
- Scheduling with Speed PredictionsEric Balkanski, Tingting Ou, Clifford Stein 0001, Hao-Ting Wei. 74-89 [doi]
- The Power of Amortization on Scheduling with Explorable UncertaintyAlison Hsiang-Hsuan Liu, Fu-Hong Liu, Prudence W. H. Wong, Xiao-Ou Zhang. 90-103 [doi]
- Total Completion Time Scheduling Under ScenariosThomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie. 104-118 [doi]
- Approximating Fair k-Min-Sum-Radii in Euclidean SpaceLukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt 0001, Julian Wargalla. 119-133 [doi]
- Online Hitting Set of d-Dimensional Fat ObjectsShanli Alefkhani, Nima Khodaveisi, Mathieu Mari. 134-144 [doi]
- Approximation Schemes Under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other ShapesVítor Gomes Chagas, Elisa Dell'Arriva, Flávio Keidi Miyazawa. 145-159 [doi]
- Hitting Sets when the Shallow Cell Complexity is SmallSander Aarts, David B. Shmoys. 160-174 [doi]
- Any-Order Online Interval SelectionAllan Borodin, Christodoulos Karavasilis. 175-189 [doi]
- Improved Approximations for Relative Survivable Network DesignMichael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov. 190-204 [doi]
- Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP RelaxationsParinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase. 205-218 [doi]
- Fast Parallel Algorithms for Submodular p-Superseparable MaximizationPhilip Cervenjak, Junhao Gan, Anthony Wirth. 219-233 [doi]