default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 27
Volume 27, Number 1, 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. 1-18 - Sean Cleary
:
Restricted rotation distance between k-ary trees. 19-33 - Craig Gotsman, Kai Hormann:
Efficient Point-to-Point Resistance Distance Queries in Large Graphs. 35-44
Volume 27, Number 2, 2023
- Ignaz Rutter, Helen C. Purchase:
Guest Editors' Foreword. 45-47 - Sarah Carmesin, André Schulz:
Arrangements of orthogonal circles with many intersections. 49-70 - Jonathan Klawitter, Johannes Zink:
Upward Planar Drawings with Three and More Slopes. 49-70 - Markus Chimani, Max Ilsen, Tilo Wiedera:
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics. 71-94 - Jeff Erickson, Patrick Lin:
Planar and Toroidal Morphs Made Easier. 95-118 - Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder:
Simplifying Non-Simple Fan-Planar Drawings. 147-172
Volume 27, Number 3, 2023
- Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. 173-194 - Frédéric Simard, Clémence Magnien, Matthieu Latapy:
Computing Betweenness Centrality in Link Streams. 195-217 - Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Improved (In-)Approximability Bounds for d-Scattered Set. 219-238
Volume 27, Number 4, 2023
- Md. Saidur Rahman, Petra Mutzel, S. Slamin:
Guest Editors' forewords. 239-240 - Elena Arseneva, Rahul Gangopadhyay, Aleksandra Istomina:
Morphing tree drawings in a small 3D grid. 241-279 - Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides:
1-Complex s,t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. 281-327
Volume 27, Number 5, 2023
- David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams:
Quasipolynomiality of the Smallest Missing Induced Subgraph. 329-339 - Mathieu Jacomy:
Connected-closeness: A Visual Quantification of Distances in Network Layouts. 341-404
Volume 27, Number 6, 2023
- Giordano Da Lozzo, Philipp Kindermann:
Guest Editors' Foreword. 405-408 - Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Order Reconfiguration under Width Constraints. 409-431 - Alan Arroyo, Stefan Felsner:
Approximating the Bundled Crossing Number. 433-457 - Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff:
The Complexity of Drawing Graphs on Few Lines and Few Planes. 459-488 - Markus Chimani, Petr Hlinený:
Inserting Multiple Edges into a Planar Graph. 489-522
Volume 27, Number 7, 2023
- Sabine Cornelsen, Gregor Diatzko:
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs. 523-540 - Katharina T. Huber, Vincent Moulton, Andreas Spillner:
Computing consensus networks for collections of 1-nested phylogenetic networks. 541-563 - Marcus Schaefer:
The Complexity of Angular Resolution. 565-580 - Luca Calderoni, Luciano Margara, Moreno Marzolla:
A Heuristic for Direct Product Graph Decomposition. 581-601 - Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs. 603-619
Volume 27, Number 8, 2023
- Patrizio Angelini, Reinhard von Hanxleden:
Guest Editors' Foreword. 621-623 - Carla Binucci, Walter Didimo, Maurizio Patrignani:
st-Orientations with Few Transitive Edges. 625-650 - Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. 651-677 - Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. 679-719 - Alfredo García, Javier Tejel, Birgit Vogtenhuber, Alexandra Weinberger:
Empty Triangles in Generalized Twisted Drawings of Kn. 721-735 - Vasileios Geladaris, Panagiotis Lionakis, Ioannis G. Tollis:
Effective Computation of a Feedback Arc Set Using PageRank. 737-757
Volume 27, Number 9, 2023
- Philipp Kindermann, Jan Sauer, Alexander Wolff:
The Computational Complexity of the ChordLink Model. 759-767 - R. Sundara Rajan, A. Berin Greeni, P. Leo Joshwa:
Minimum Linear Arrangement of Generalized Sierpinski Graphs. 767-782 - Dominik Dürrschnabel, Tom Hanika, Gerd Stumme:
Drawing Order Diagrams Through Two-Dimension Extension. 783-802 - Marcus Schaefer:
RAC-Drawability is ∃ℝ-complete and Related Results. 803-841 - David R. Wood:
2-Layer Graph Drawings with Bounded Pathwidth. 843-851 - Sparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad:
B0-VPG Representation of AT-free Outerplanar Graphs. 853-869
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-17 23:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
