Regular

All Items

• Egalitarian Graph Orientations

  Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon Wilfong, Lisa Zhang

  687-708

• Embedding, Clustering and Coloring for Dynamic Maps

  Yifan Hu, Stephen Kobourov, Sankar Veeramoni

  77-109

• Embedding Four-directional Paths on Convex Point Sets

  Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Birgit Vogtenhuber

  743-759

• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs

  Michael Kaufmann, Roland Wiese

  115-129

• Empty Triangles in Generalized Twisted Drawings of $K_n$

  Alfredo García, Javier Tejel, Birgit Vogtenhuber, Alexandra Weinberger

  721-735

• Energy Models for Graph Clustering

  Andreas Noack

  453-480

• Enumerating Grid Layouts of Graphs

  Peter Damaschke

  433-460

• Equilateral Spherical Drawings of Planar Cayley Graphs

  Ming-Hsuan Kang, Wu-Hsiung Lin

  97-119

• Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs

  Athula Gunawardena, Robert Meyer

  83-98

• Equitable colorings of $K_4$-minor-free graphs

  Rémi de Joannis de Verclos, Jean-Sébastien Sereni

  1091-1105

• Essential Constraints of Edge-Constrained Proximity Graphs

  Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel Smid

  389-415

• Estimating the Number of s-t Paths in a Graph

  Ben Roberts, Dirk Kroese

  195-214

• Every graph admits an unambiguous bold drawing

  János Pach

  299-312

• Exact and Approximate Hierarchical Hub Labeling

  Justine Cauvi, Ruoying Li, Sabine Storandt

  103-126

• Experimental Analysis of Algorithms for the Dynamic Graph Coloring Problem

  Menno Theunis, Marcel Roeloffzen

  313-349

• Experimental Analysis of the Accessibility of Drawings with Few Segments

  Philipp Kindermann, Wouter Meulemans, André Schulz

  501-518

• Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs

  Tiziana Calamoneri, Simone Jannelli, Rossella Petreschi

  1-23

• Experiments with the Fixed-Parameter Approach for Two-Layer Planarization

  Matthew Suderman, Sue Whitesides

  149-163

• Exploiting Air-Pressure to Map Floorplans on Point Sets

  Stefan Felsner

  233-252

• Exponential vs. Subexponential Tower of Hanoi Variants

  Daniel Berend, Amir Sapir

  461-479

• Extending Partial Orthogonal Drawings

  Patrizio Angelini, Ignaz Rutter, Sandhya T P

  581-602

• Extreme Distances in Multicolored Point Sets

  Adrian Dumitrescu, Sumanta Guha

  27-38

• Fast approximation of eccentricities and distances in hyperbolic graphs

  Victor Chepoi, Feodor Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed

  393-433

• Fast edge colorings with fixed number of colors to minimize imbalance

  Gruia Calinescu, Michael Pelsmajer

  401-417

• Faster algorithms for shortest path and network flow based on graph decomposition

  Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane

  781-813