Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs Alessio ConteRoberto GrossiLuca Versari OriginalPaper 14 December 2019 Pages: 1547 - 1573
On the Complexity of Computing Treebreadth Guillaume DucoffeSylvain LegayNicolas Nisse OriginalPaper 12 December 2019 Pages: 1574 - 1600
Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions Charles MaskeJaime CohenElias P. Duarte Jr. OriginalPaper 14 December 2019 Pages: 1601 - 1615
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths Júlio AraújoVictor A. CamposAna Silva OriginalPaper 12 December 2019 Pages: 1616 - 1639
Nested Convex Bodies are Chaseable Nikhil BansalMartin BöhmSeeun William Umboh OriginalPaper 20 December 2019 Pages: 1640 - 1653
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width Benjamin BergougnouxMamadou Moustapha KantéO-joung Kwon OriginalPaper 19 December 2019 Pages: 1654 - 1674
High-Dimensional Approximate r-Nets Z. AvarikiotiI. Z. EmirisI. Psarros OriginalPaper 07 January 2020 Pages: 1675 - 1702
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs Michał PilipczukErik Jan van LeeuwenAndreas Wiese OriginalPaper 13 January 2020 Pages: 1703 - 1739