1. Faster Approximate Diameter and Distance Oracles in Planar Graphs

   • Timothy M. Chan
   • Dimitrios Skrepetos

   OriginalPaper 11 April 2019 Pages: 3075 - 3098

   

2. An Algorithm to Compute the Nucleolus of Shortest Path Games

   • Mourad Baïou
   • Francisco Barahona

   OriginalPaper 13 April 2019 Pages: 3099 - 3113

   

3. Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly

   • Robert Schweller
   • Andrew Winslow
   • Tim Wylie

   OriginalPaper 13 April 2019 Pages: 3114 - 3135

   

4. Stable Secretaries

   • Yakov Babichenko
   • Yuval Emek
   • Rann Smorodinsky

   OriginalPaper 17 April 2019 Pages: 3136 - 3161

   

5. Dynamic Space Efficient Hashing

   • Tobias Maier
   • Peter Sanders
   • Stefan Walzer

   OriginalPaper 17 June 2019 Pages: 3162 - 3185

   

6. Approximately Coloring Graphs Without Long Induced Paths

   • Maria Chudnovsky
   • Oliver Schaudt
   • Mingxian Zhong

   OriginalPaper 26 April 2019 Pages: 3186 - 3199

7. A Tight Lower Bound for Planar Steiner Orientation

   • Rajesh Chitnis
   • Andreas Emil Feldmann
   • Ondřej Suchý

   OriginalPaper Open access 04 May 2019 Pages: 3200 - 3216

   

8. Flexible Resource Allocation to Interval Jobs

   • Dmitriy Katz
   • Baruch Schieber
   • Hadas Shachnai

   OriginalPaper 07 May 2019 Pages: 3217 - 3244