JGAA Volumes Volume 24, no. 1, 2020 Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width) Johannes Batzill and Therese Biedl Vol. 24, no. 1, pp. 1-19, 2020. Regular paper. On the Circumference of Essentially 4-connected Planar Graphs Igor Fabrici, Jochen Harant, Samuel Mohr, and Jens M. Schmidt Vol. 24, no. 1, pp. 21-46, 2020. Regular paper. Reconfiguring Minimum Dominating Sets in Trees Vol. 24, no. 1, pp. 47-61, 2020. Regular paper. Volume 24, no. 2, 2020 Special Issue on Selected Papers from the 13th International Conference and Workshops on Algorithms and Computation, WALCOM 2019 Guest Editor(s): Krishnendu Mukhopadhyaya and Shin-ichi Nakano Guest Editors' Foreword Krishnendu Mukhopadhyaya and Shin-ichi Nakano Vol. 24, no. 2, pp. 63-64, 2020. Weighted Upper Edge Cover: Complexity and Approximability Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, and Florian Sikora Vol. 24, no. 2, pp. 65-88, 2020. Regular paper. Efficient Algorithm for Box Folding Koichi Mizunashi, Takashi Horiyama, and Ryuhei Uehara Vol. 24, no. 2, pp. 89-103, 2020. Regular paper. Drawing Clustered Planar Graphs on Disk Arrangements Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, and Nina Zimbel Vol. 24, no. 2, pp. 105-131, 2020. Regular paper. Volume 24, no. 3, 2020 Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network Wilfried Ehounou, Dominique Barth, Arnaud de Moissac, Dimitri Watel, and Marc-Antoine Weisser Vol. 24, no. 3, pp. 133-153, 2020. Regular paper. Maximum Cut Parameterized by Crossing Number Vol. 24, no. 3, pp. 155-170, 2020. Regular paper. On the Approximability of the Minimum Weight $t$-partite Clique Problem Vol. 24, no. 3, pp. 171-190, 2020. Regular paper. Bounds and algorithms for graph trusses Paul Burkhardt, Vance Faber, and David G. Harris Vol. 24, no. 3, pp. 191-214, 2020. Regular paper. Parameterized Complexity of Safe Set Vol. 24, no. 3, pp. 215-245, 2020. Regular paper. A Note on Universal Point Sets for Planar Graphs Vol. 24, no. 3, pp. 247-267, 2020. Regular paper. Graph Stories in Small Area Vol. 24, no. 3, pp. 269-292, 2020. Regular paper. Not all planar graphs are in PURE-4-DIR Vol. 24, no. 3, pp. 293-301, 2020. Concise paper. On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow Kateřina Altmanová, Petr Kolman, and Jan Voborník Vol. 24, no. 3, pp. 303-322, 2020. Regular paper. Improved Bounds for Track Numbers of Planar Graphs Vol. 24, no. 3, pp. 323-341, 2020. Regular paper. On L-shaped point set embeddings of trees: first non-embeddable examples Vol. 24, no. 3, pp. 343-369, 2020. Regular paper. Graph Motif Problems Parameterized by Dual Vol. 24, no. 3, pp. 371-396, 2020. Regular paper. Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm Kamiel Cornelissen and Bodo Manthey Vol. 24, no. 3, pp. 397-421, 2020. Regular paper. An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants Oswin Aichholzer, Frank Duque, Ruy Fabila-Monroy, Oscar E. García-Quintero, and Carlos Hidalgo-Toscano Vol. 24, no. 3, pp. 421-432, 2020. Regular paper. Enumerating Grid Layouts of Graphs Peter Damaschke Vol. 24, no. 3, pp. 433-460, 2020. Regular paper. Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A.W.M. de Kroon, and Rolf Morel Vol. 24, no. 3, pp. 461-482, 2020. Regular paper. An Adaptive Version of Brandes' Algorithm for Betweenness Centrality Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, and Rolf Niedermeier Vol. 24, no. 3, pp. 483-522, 2020. Regular paper. Problems on One Way Road Networks Vol. 24, no. 3, pp. 523-546, 2020. Regular paper. Volume 24, no. 4, 2020 "Special issue on Selected papers from the Twenty-seventh International Symposium on Graph Drawing and Network Visualization, GD 2019" Guest Editor(s): Daniel Archambault and Csaba D. Tóth Guest editors' foreword Daniel Archambault and Csaba Toth Vol. 24, no. 4, pp. 547-549, 2020. Regular paper. Minimal Representations of Order Types by Geometric Graphs Vol. 24, no. 4, pp. 551-572, 2020. Regular paper. Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity Vol. 24, no. 4, pp. 573-601, 2020. Regular paper. Parameterized Algorithms for Book Embedding Problems Vol. 24, no. 4, pp. 603-620, 2020. Regular paper. Bundled Crossings Revisited Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, and Alexander Wolff Vol. 24, no. 4, pp. 621-655, 2020. Regular paper. Recognizing Stick Graphs with and without Length Constraints Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, and Johannes Zink Vol. 24, no. 4, pp. 657-681, 2020. Regular paper. Node Overlap Removal Algorithms: an Extended Comparative Study Fati Chen, Laurent Piccinini, Pascal Poncelet, and Arnaud Sallaberry Vol. 24, no. 4, pp. 683-706, 2020. Regular paper.