Regular

All Items

• Construction and Local Routing for Angle-Monotone Graphs

  Anna Lubiw, Debajyoti Mondal

  345-369

• Constructive algorithms for the partial directed weighted improper coloring problem

  Alain Hertz, Romain Montagné, François Gagnon

  159-188

• Contraction and Treewidth Lower Bounds

  Hans Bodlaender, Thomas Wolle, Arie Koster

  5-49

• Convex Grid Drawings of Plane Graphs with Rectangular Contours

  Kazuyuki Miura, Akira Kamada, Takao Nishizeki

  197-224

• COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets

  Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi

  434-458

• Covering a Graph with Clubs

  Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis

  271-292

• C-Planarity of C-Connected Clustered Graphs

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

  225-262

• Crossing Angles of Geometric Graphs

  Karin Arikushi, Csaba Tóth

  401-420

• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth

  Michael Bannister, David Eppstein

  577-606

• Crossing Numbers and Cutwidths

  Hristo Djidjev, Imrich Vrťo

  245-251

• Crossing Numbers of Beyond-Planar Graphs Revisited

  Nathan van Beusekom, Irene Parada, Bettina Speckmann

  149-170

• Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs

  Tamara Mchedlidze, Antonios Symvonis

  373-415

• Cubic graphs have bounded slope parameter

  Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth

  5-17

• DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations

  Vassilis Tsiaras, Ioannis Tollis

  359-380

• DAGmaps: Space Filling Visualization of Directed Acyclic Graphs

  Vassilis Tsiaras, Sofia Triantafilou, Ioannis Tollis

  319-347

• Data Structures and their Planar Graph Layouts

  Christopher Auer, Christian Bachmaier, Franz Brandenburg, Wolfgang Brunner, Andreas Gleißner

  207-237

• Deciding Clique-Width for Graphs of Bounded Tree-Width

  Wolfgang Espelage, Frank Gurski, Egon Wanke

  141-180

• Decycling bipartite graphs

  Alain Hertz

  461-480

• Degree-constrained edge partitioning in graphs arising from discrete tomography

  Cedric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra

  99-118

• Density decompositions of networks

  Glencora Borradaile, Theresa Migler, Gordon Wilfong

  625-651

• Dichotomy Theorems for Homomorphism Polynomials of Graph Classes

  Christian Engels

  3-22

• Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms

  Stina Bridgeman, Roberto Tamassia

  47-74

• Distance-Preserving Graph Compression Techniques

  Amirali Madani, Anil Maheshwari

  179-224

• Distributed Graph Layout for Sensor Networks

  Craig Gotsman, Yehuda Koren

  327-346

• Distributing Unit Size Workload Packages in Heterogeneous Networks

  Robert Elsässer, Burkhard Monien, Stefan Schamberger

  51-68