Regular

All Items

• Block Crossings in Storyline Visualizations

  Thomas van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff

  873-913

• Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms

  Francisco Soulignac

  491-525

• Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory

  Francisco Soulignac

  455-489

• Bounds and algorithms for graph trusses

  Paul Burkhardt, Vance Faber, David Harris

  191-214

• Bounds For Orthogonal 3-D Graph Drawing

  T. Biedl, T. Shermer, S. Whitesides, S. Wismath

  63-79

• Box-Rectangular Drawings of Planar Graphs

  Md. Manzurul Hasan, Md. Saidur Rahman, Md. Rezaul Karim

  629-646

• Building Blocks of Upward Planar Digraphs

  Patrick Healy, Karol Lynch

  3-44

• Bundled Crossings Revisited

  Steven Chaplick, Thomas van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff

  621-655

• Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation

  Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse

  185-204

• Carrying Umbrellas: an Online Relocation Game on a Graph

  Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa

  3-16

• Centdian Computation in Cactus Graphs

  Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir

  199-224

• Certifying Induced Subgraphs in Large Graphs

  Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis

  49-68

• Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs

  Donatello Conte, Pasquale Foggia, Mario Vento

  99-143

• Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles

  Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner

  99-115

• Circumference of essentially 4-connected planar triangulations

  Igor Fabrici, Jochen Harant, Samuel Mohr, Jens Schmidt

  121-132

• Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs

  Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondřej Suchý, Tomáš Vyskocil

  379-422

• Clustering Cycles into Cycles of Clusters

  Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia

  391-413

• Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees

  Susanne Hambrusch, Chuan-Ming Liu, Hyeong-Seok Lim

  1-26

• Collective Tree Spanners and Routing in AT-free Related Graphs

  Feodor Dragan, Chenyu Yan, Derek Corneil

  97-122

• Column-Based Graph Layouts

  Gregor Betz, Andreas Gemsa, Christof Mathies, Ignaz Rutter, Dorothea Wagner

  677-708

• Column planarity and partially-simultaneous geometric embedding

  Luis Barba, William Evans, Michael Hoffmann, Vincent Kusters, Maria Saumell, Bettina Speckmann

  983-1002

• Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid

  Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara

  101-114

• Compact Routing Schemes for Generalised Chordal Graphs

  Yon Dourisboure

  277-297

• Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs

  Jiong Guo, Yash Raj Shrestha

  603-631

• Complexity of Geometric k-Planarity for Fixed k

  Marcus Schaefer

  29-41