Skip to main content
Skip to main navigation menu
Skip to site footer
Open Menu
Current
Archives
Announcements
About
About the Journal
Submissions
Editorial Team
Executive Committee
Advisory Board
Privacy Statement
Contact
Search
Register
Login
Home
/
Archives
/
Vol. 25 No. 1 (2021)
Vol. 25 No. 1 (2021)
Published:
2021-01-01
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
1-28
article (PDF)
Complexity of Geometric k-Planarity for Fixed k
Marcus Schaefer
29-41
article (PDF)
Two Results on Layered Pathwidth and Linear Layouts
Vida Dujmović, Pat Morin, Céline Yelle
43-57
article (PDF)
Minimal Embedding Dimensions of Rectangle k-Visibility Graphs
Espen Slettnes
59-96
article (PDF)
Equilateral Spherical Drawings of Planar Cayley Graphs
Ming-Hsuan Kang, Wu-Hsiung Lin
97-119
article (PDF)
Circumference of essentially 4-connected planar triangulations
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens Schmidt
121-132
article (PDF)
On the Balance of Unrooted Trees
Mareike Fischer, Volkmar Liebscher
133-150
article (PDF)
Multilevel Planarity
Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher
151-170
article (PDF)
On Area-Universal Quadrangulations
William Evans, Stefan Felsner, Linda Kleist, Stephen Kobourov
171-193
article (PDF)
On the Complexity of Some Geometric Problems With Fixed Parameters
Marcus Schaefer
195-218
article (PDF)
Fast Generation of Unlabelled Free Trees using Weight Sequences
Paul Brown, Trevor Fenner
219-240
article (PDF)
additional material (provided by authors)
Algebraic Algorithms for Betweenness and Percolation Centrality
Altansuren Tumurbaatar, Matthew Sottile
241-261
article (PDF)
Heading in the right direction? Using head moves to traverse phylogenetic network space
Remie Janssen
263-310
article (PDF)
Schematic Representation of Large Biconnected Graphs
Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais
311-352
article (PDF)
Radial Level Planarity with Fixed Embedding
Guido Brückner, Ignaz Rutter
353-366
article (PDF)
An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
A. Arul Shantrinal, Sandi Klavžar, T.M. Rajalaxmi, R. Sundara Rajan
367-381
article (PDF)
The number of crossings in multigraphs with no empty lens
Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
383-396
article (PDF)
Least resolved trees for two-colored best match graphs
David Schaller, Manuela Geiß, Marc Hellmuth, Peter Stadler
397-416
article (PDF)
Tree Containment With Soft Polytomies
Matthias Bentert, Mathias Weller
417-436
article (PDF)
Synchronized Traveling Salesman Problem
Gyula Pap, József Varnyú
437-459
article (PDF)
Decycling bipartite graphs
Alain Hertz
461-480
article (PDF)
On Strict (Outer-)Confluent Graphs
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
481-512
article (PDF)
Revising the Fellows-Kaschube $K_{3,3}$ Search
John Boyer
513-520
article (PDF)
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
521-547
article (PDF)
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings
David Eppstein
549-562
article (PDF)
A family of tree-based generators for bubbles in directed graphs
Vicente Acuña, Leandro Ishi Soares de Lima, Giuseppe Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri
563-580
article (PDF)
Extending Partial Orthogonal Drawings
Patrizio Angelini, Ignaz Rutter, Sandhya T P
581-602
article (PDF)
Make a Submission
Make a Submission
Information
For Readers
For Authors
For Librarians
Browse
Categories
Regular
Concise
Survey
Current Issue