default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 30
Volume 30, Number 1, 2026
- Ernestine Großmann
, Felix Joos, Henrik Reinstädtler, Christian Schulz:
Engineering Hypergraph $b$-Matching Algorithms. 1-24 - Virginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Relaxed Agreement Forests of Phylogenetic Trees. 25-46 - Dieter Rautenbach, Florian Werner:
Largest Common Subgraph of Two Forests. 47-63 - Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Degree Realization by Bipartite Cactus Graphs. 65-87 - Andrés López Martínez, Mark de Berg, Frits C. R. Spieksma:
Stable and Dynamic Minimum Cuts. 89-107 - Massimo A. Achterberg, Robert E. Kooij:
On the Non-Submodularity of the Problem of Adding Links to Minimize the Effective Graph Resistance. 109-132 - Mojtaba Ostovari, Alireza Zarei:
Improved Combinatorial Approximation Algorithms for Feedback Arc Set and Rank Aggregation Problems. 133-150
Volume 30, Number 2, 2026
- Torsten Ueckerdt, Miriam Goetze, Michael Hoffmann, Ignaz Rutter:
Crossing Number of Simple 3-Plane Drawings. 1-21 - Zayed Asiri, Ryan Burdett, Markus Chimani, Michael Haythorpe, Alex Newcombe, Mirko H. Wagner:
A Systematic Approach to Crossing Numbers of Cartesian Products with Paths. 23-57 - Lucas Joos, Gavin J. Mooney, Maximilian T. Fischer, Daniel A. Keim, Falk Schreiber, Helen C. Purchase, Karsten Klein:
Show Me Your Best Side: Characteristics of User-Preferred Perspectives for 3D Graph Drawings. 57-119 - Miriam Münch, Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Heuristics for Exact 1-Planarity Testing. 121-147 - Benedikt Hahn, Torsten Ueckerdt, Birgit Vogtenhuber:
Edge Densities of Drawings of Graphs with One Forbidden Cell. 149-173 - Sergey Pupyrev:
OOPS: Optimized One-Planarity Solver via SAT. 175-197
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 2026-08-25 22:07 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
