Regular

All Items

• D-resolvability of vertices in planar graphs

  James Tilley

  649-661

• Dynamic Graph Clustering Using Minimum-Cut Trees

  Robert Görke, Tanja Hartmann, Dorothea Wagner

  411-446

• Dynamic Spectral Layout with an Application to Small Worlds

  Ulrik Brandes, Daniel Fleischer, Thomas Puppe

  325-343

• Dynamic WWW Structures in 3D

  Ulrik Brandes, Vanessa Kääb, Andres Löh, Dorothea Wagner, Thomas Willhalm

  183-191

• Edge $k$-$q$-Colorability of Graphs

  Selma Djelloul, Odile Favaron, Mekkia Kouider

  193-206

• Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs

  David Eppstein

  483-499

• Edge-Coloring and f-Coloring for Various Classes of Graphs

  Xiao Zhou, Takao Nishizeki

  1-18

• Edge-weighted contact representations of planar graphs

  Martin Nöllenburg, Prutkin Roman, Ignaz Rutter

  441-473

• Editing Simple Graphs

  Peter Damaschke, Olof Mogren

  557-576

• Editor in Chief's Foreword

  Giuseppe Liotta

  283-284

• Effective Computation of a Feedback Arc Set Using PageRank

  Vasileios Geladaris, Panagiotis Lionakis, Ioannis Tollis

  737-757

• Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization

  Weidong Huang, Seok-Hee Hong, Peter Eades

  397-429

• Efficient Algorithm for Box Folding

  Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara

  89-103

• Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces

  Giuseppe Di Battista, Fabrizio Frati

  349-378

• Efficient drawing of RNA secondary structure

  David Auber, Maylis Delest, Jean-Philippe Domenger, Serge Dulucq

  329-351

• Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity

  Patrizio Angelini, Michael Bekos, Michael Kaufmann, Thomas Schneck

  573-601

• Efficient Labeling of Collinear Sites

  Michael Bekos, Michael Kaufmann, Antonios Symvonis

  357-380

• Efficient Point-to-Point Resistance Distance Queries in Large Graphs

  Craig Gotsman, Kai Hormann

  35-44

• Efficient, Proximity-Preserving Node Overlap Removal

  Emden Gansner, Yifan Hu

  53-74

• 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