


default search action
Journal of Graph Algorithms and Applications, Volume 29
Volume 29, Number 1, 2025
- Bart M. P. Jansen, Bart van der Steenhoven:

Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. 1-28 - Jonathan Klawitter

, Felix Klesen
, Joris Y. Scholl, Thomas C. van Dijk
, Alexander Zaft:
Visualizing Geophylogenies - Internal and External Labeling with Phylogenetic Tree Constraints. 29-61 - Dominique Barth, Dimitri Watel, Marc-Antoine Weisser:

Correcting a Graph Into a Linegraph Minimizing Hamming Distance Edition Is NP-Complete and FPT by Treewidth. 63-90 - Simon Dominik Fink

, Ignaz Rutter
:
Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm. 91-123 
Volume 29, Number 2, 2025
- Ryuhei Uehara, Katsuhisa Yamanaka

, Hsu-Chun Yen:
Special Issue on Selected Papers from the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024): Guest Editors' Foreword. 1-2 - Susanna Caroppo, Giordano Da Lozzo

, Giuseppe Di Battista:
Quantum Graph Drawing. 3-47 - Giordano Da Lozzo

, Giuseppe Di Battista, Fabrizio Frati
, Fabrizio Grosso, Maurizio Patrignani
:
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. 49-102 - Justine Cauvi

, Ruoying Li, Sabine Storandt:
Exact and Approximate Hierarchical Hub Labeling. 103-126 - Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal

:
Searching for a Black Hole in a Dynamic Cactus. 127-166 

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














