default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 25
Volume 25, Number 1, 2021
- Philipp Kindermann
, Fabrizio Montecchiani, Lena Schlipf, André Schulz:
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. 1-28 - Marcus Schaefer:
Complexity of Geometric k-Planarity for Fixed k. 29-41 - Vida Dujmovic, Pat Morin, Céline Yelle:
Two Results on Layered Pathwidth and Linear Layouts. 43-57 - Espen Slettnes:
Minimal Embedding Dimensions of Rectangle k-Visibility Graphs. 59-96 - Ming-Hsuan Kang, Wu-Hsiung Lin:
Equilateral Spherical Drawings of Planar Cayley Graphs. 97-119 - Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
Circumference of essentially 4-connected planar triangulations. 121-132 - Mareike Fischer, Volkmar Liebscher:
On the Balance of Unrooted Trees. 133-150 - Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher:
Multilevel Planarity. 151-170 - William S. Evans, Stefan Felsner, Linda Kleist, Stephen G. Kobourov:
On Area-Universal Quadrangulations. 171-193 - Marcus Schaefer:
On the Complexity of Some Geometric Problems With Fixed Parameters. 195-218 - Paul Brown, Trevor I. Fenner:
Fast Generation of Unlabelled Free Trees using Weight Sequences. 219-240 - Altansuren Tumurbaatar, Matthew J. Sottile:
Algebraic Algorithms for Betweenness and Percolation Centrality. 241-261 - Remie Janssen:
Heading in the right direction? Using head moves to traverse phylogenetic network space. 263-310 - Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Large Biconnected Graphs. 311-352 - Guido Brückner, Ignaz Rutter:
Radial Level Planarity with Fixed Embedding. 353-366 - A. Arul Shantrinal, Sandi Klavzar, T. M. Rajalaxmi, R. Sundara Rajan:
An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength. 367-381 - Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt:
The number of crossings in multigraphs with no empty lens. 383-396 - David Schaller, Manuela Geiß, Marc Hellmuth, Peter F. Stadler:
Least resolved trees for two-colored best match graphs. 397-416 - Matthias Bentert, Mathias Weller:
Tree Containment With Soft Polytomies. 417-436 - Gyula Pap, József Varnyú:
Synchronized Traveling Salesman Problem. 437-459 - Alain Hertz:
Decycling bipartite graphs. 461-480 - Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. 481-512 - John M. Boyer:
Revising the Fellows-Kaschube $K_{3, 3}$ Search. 513-520 - Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. 521-547 - David Eppstein:
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings. 549-562 - Vicente Acuña, Leandro Ishi Soares de Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri:
A family of tree-based generators for bubbles in directed graphs. 563-580 - Patrizio Angelini, Ignaz Rutter, T. P. Sandhya:
Extending Partial Orthogonal Drawings. 581-602
Volume 25, Number 2, 2021
- M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung:
Guest editors' foreword. 603-604 - Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. 605-624 - Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr:
The Stub Resolution of 1-planar Graphs. 625-642 - William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. 643-661
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-11-09 23:10 CET 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:
