1. Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs

   • Alessio Conte
   • Roberto Grossi
   • Luca Versari

   OriginalPaper 14 December 2019 Pages: 1547 - 1573

   

2. On the Complexity of Computing Treebreadth

   • Guillaume Ducoffe
   • Sylvain Legay
   • Nicolas Nisse

   OriginalPaper 12 December 2019 Pages: 1574 - 1600

   

3. Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions

   • Charles Maske
   • Jaime Cohen
   • Elias P. Duarte Jr.

   OriginalPaper 14 December 2019 Pages: 1601 - 1615

   

4. On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths

   • Júlio Araújo
   • Victor A. Campos
   • Ana Silva

   OriginalPaper 12 December 2019 Pages: 1616 - 1639

   

5. Nested Convex Bodies are Chaseable

   • Nikhil Bansal
   • Martin Böhm
   • Seeun William Umboh

   OriginalPaper 20 December 2019 Pages: 1640 - 1653

   

6. An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width

   • Benjamin Bergougnoux
   • Mamadou Moustapha Kanté
   • O-joung Kwon

   OriginalPaper 19 December 2019 Pages: 1654 - 1674

   

7. High-Dimensional Approximate r-Nets

   • Z. Avarikioti
   • I. Z. Emiris
   • I. Psarros

   OriginalPaper 07 January 2020 Pages: 1675 - 1702

   

8. Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

   • Michał Pilipczuk
   • Erik Jan van Leeuwen
   • Andreas Wiese

   OriginalPaper 13 January 2020 Pages: 1703 - 1739