default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 26
Volume 26, Number 1, 2022
- Stephen A. Fenner, Daniel Grier
, Rohit Gurjar, Arpita Korwar, Thomas Thierauf:
The Complexity of Poset Games. 1-14 - Hossein Boomari, Alireza Zarei:
Visibility Graphs of Anchor Polygons. 15-34 - Marcus Schäfer, Daniel Stefankovic:
The Degenerate Crossing Number and Higher-Genus Embeddings. 35-58 - Therese Biedl:
Drawing outer-1-planar graphs revisited. 59-73 - Ahmad Biniaz:
A short proof of the non-biplanarity of K9. 75-80 - Mareike Fischer, Michelle Galla, Kristina Wicke:
Non-binary universal tree-based networks. 81-90 - Vahan Mkrtchyan, Garik Petrosyan:
On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs. 91-110 - Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, Tilo Wiedera:
Properties of Large 2-Crossing-Critical Graphs. 111-147 - Nathan van Beusekom, Irene Parada, Bettina Speckmann:
Crossing Numbers of Beyond-Planar Graphs Revisited. 149-170 - Jonathan Klawitter, Tamara Mchedlidze:
Upward planar drawings with two slopes. 171-198 - Darcy Best, Max Ward:
A faster algorithm for maximum independent set on interval filament graphs. 199-205 - Shijun Cai, Seok-Hee Hong, Jialiang Shen, Tongliang Liu:
A Machine Learning Approach for Predicting Human Preference for Graph Layouts. 447-471 - Therese Biedl, Milap Sheth:
Drawing Halin-graphs with small height. 473-502 - Thomas C. Hull, Manuel Morales, Sarah Nash, Natalya Ter-Saakov:
Maximal origami flip graphs of flat-foldable vertices: properties and algorithms. 503-517 - Eranda Çela, Elisabeth Gaar:
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid. 519-552 - J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich:
Finding a Maximum Clique in a Grounded 1-Bend String Graph. 553-575 - David A. Bader, Paul Burkhardt:
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges. 577-588 - Lorenzo Balzotti, Paolo Giulio Franciosa:
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time. 589-606
Volume 26, Number 2, 2022
- Seok-Hee Hong, Subhas C. Nandy, Ryuhei Uehara:
Guest Editors' Foreword. 207-208 - Ahmad Biniaz:
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. 209-224 - Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. 225-240 - Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono:
Computing L(p, 1)-Labeling with Combined Parameters. 241-255 - Mahdi Belbasi, Martin Fürer:
An Improvement of Reed's Treewidth Approximation. 257-282
Volume 26, Number 3, 2022
- Giuseppe Liotta:
Editor in Chief's Foreword. 283-284 - Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. 285-306 - Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
Planar L-Drawings of Bimodal Graphs. 307-334 - Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. 335-352 - Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck:
Drawing Shortest Paths in Geodetic Graphs. 353-361 - Alon Efrat, Radoslav Fulek, Stephen G. Kobourov, Csaba D. Tóth:
Polygons with Prescribed Angles in 2D and 3D. 363-380 - Stefan Felsner, Michael Hoffmann, Kristin Knorr, Jan Kyncl, Irene Parada:
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. 381-399
Volume 26, Number 4, 2022
- Leon Kellerhals, Tomohiro Koana:
Parameterized Complexity of Geodetic Set. 401-419 - Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal:
The Complexity of Drawing a Graph in a Polygonal Region. 421-446
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-05-03 00:08 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:
