- Frédéric Simard, Clémence Magnien, Matthieu Latapy. Computing Betweenness Centrality in Link Streams. J. Graph Algorithms Appl., 27(3):195-217, 2023.
- Jonathan Klawitter, Johannes Zink. Upward Planar Drawings with Three and More Slopes. J. Graph Algorithms Appl., 27(2):49-70, 2023.
- Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier. Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. J. Graph Algorithms Appl., 27(3):173-194, 2023.
- Jeff Erickson 0001, Patrick Lin 0001. Planar and Toroidal Morphs Made Easier. J. Graph Algorithms Appl., 27(2):95-118, 2023.
- Sarah Carmesin, André Schulz 0001. Arrangements of orthogonal circles with many intersections. J. Graph Algorithms Appl., 27(2):49-70, 2023.
- Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid. The Minimum Moving Spanning Tree Problem. J. Graph Algorithms Appl., 27(1):1-18, 2023.
- Md. Saidur Rahman 0001, Petra Mutzel, S. Slamin 0001. Guest Editors' forewords. J. Graph Algorithms Appl., 27(4):239-240, 2023.
- Elena Arseneva, Rahul Gangopadhyay, Aleksandra Istomina. Morphing tree drawings in a small 3D grid. J. Graph Algorithms Appl., 27(4):241-279, 2023.
- Rahnuma Islam Nishat, Venkatesh Srinivasan 0001, Sue Whitesides. 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. J. Graph Algorithms Appl., 27(4):281-327, 2023.
- Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder. Simplifying Non-Simple Fan-Planar Drawings. J. Graph Algorithms Appl., 27(2):147-172, 2023.