- Miriam Münch, Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter. Heuristics for Exact 1-Planarity Testing. J. Graph Algorithms Appl., 30(2):121-147, 2026.
- Lucas Joos, Gavin J. Mooney, Maximilian T. Fischer, Daniel A. Keim, Falk Schreiber, Helen C. Purchase, Karsten Klein 0001. Show Me Your Best Side: Characteristics of User-Preferred Perspectives for 3D Graph Drawings. J. Graph Algorithms Appl., 30(2):57-119, 2026.
- Sergey Pupyrev. OOPS: Optimized One-Planarity Solver via SAT. J. Graph Algorithms Appl., 30(2):175-197, 2026.
- Dieter Rautenbach, Florian Werner 0003. Largest Common Subgraph of Two Forests. J. Graph Algorithms Appl., 30(1):47-63, 2026.
- Benedikt Hahn, Torsten Ueckerdt, Birgit Vogtenhuber. Edge Densities of Drawings of Graphs with One Forbidden Cell. J. Graph Algorithms Appl., 30(2):149-173, 2026.
- Mojtaba Ostovari, Alireza Zarei. Improved Combinatorial Approximation Algorithms for Feedback Arc Set and Rank Aggregation Problems. J. Graph Algorithms Appl., 30(1):133-150, 2026.
- Ernestine Großmann, Felix Joos, Henrik Reinstädtler, Christian Schulz 0003. Engineering Hypergraph $b$-Matching Algorithms. J. Graph Algorithms Appl., 30(1):1-24, 2026.
- Torsten Ueckerdt, Miriam Goetze, Michael Hoffmann 0001, Ignaz Rutter. Crossing Number of Simple 3-Plane Drawings. J. Graph Algorithms Appl., 30(2):1-21, 2026.
- Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz. Degree Realization by Bipartite Cactus Graphs. J. Graph Algorithms Appl., 30(1):65-87, 2026.
- Zayed Asiri, Ryan Burdett, Markus Chimani, Michael Haythorpe, Alex Newcombe, Mirko H. Wagner. A Systematic Approach to Crossing Numbers of Cartesian Products with Paths. J. Graph Algorithms Appl., 30(2):23-57, 2026.