- Markus Chimani, Petr Hlinený. Inserting Multiple Edges into a Planar Graph. J. Graph Algorithms Appl., 27(6):489-522, 2023.
- David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams. Quasipolynomiality of the Smallest Missing Induced Subgraph. J. Graph Algorithms Appl., 27(5):329-339, 2023.
- Frédéric Simard, Clémence Magnien, Matthieu Latapy. Computing Betweenness Centrality in Link Streams. J. Graph Algorithms Appl., 27(3):195-217, 2023.
- Giordano Da Lozzo, Philipp Kindermann. Guest Editors' Foreword. J. Graph Algorithms Appl., 27(6):405-408, 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.
- Sabine Cornelsen, Gregor Diatzko. Planar Confluent Orthogonal Drawings of 4-Modal Digraphs. J. Graph Algorithms Appl., 27(7):523-540, 2023.
- David R. Wood. 2-Layer Graph Drawings with Bounded Pathwidth. J. Graph Algorithms Appl., 27(9):843-851, 2023.
- Mathieu Jacomy. Connected-closeness: A Visual Quantification of Distances in Network Layouts. J. Graph Algorithms Appl., 27(5):341-404, 2023.
- Jeff Erickson 0001, Patrick Lin 0001. Planar and Toroidal Morphs Made Easier. J. Graph Algorithms Appl., 27(2):95-118, 2023.