Regular

All Items

• A Framework for the Static and Interactive Visualization of Statecharts

  Rodolfo Castelló, Rym Mili, Ioannis Tollis

  313-351

• A Graph Drawing Application to Web Site Traffic Analysis

  Walter Didimo, Giuseppe Liotta, Salvatore Romeo

  229-251

• A Graph Pebbling Algorithm on Weighted Graphs

  Nandor Sieben

  221-244

• A healthy critical attitude: Revisiting the results of a graph drawing study

  Helen Purchase

  281-311

• A Heuristic for Direct Product Graph Decomposition

  Luca Calderoni, Luciano Margara, Moreno Marzolla

  581-601

• Algebraic Algorithms for Betweenness and Percolation Centrality

  Altansuren Tumurbaatar, Matthew Sottile

  241-261

• Algorithm and Experiments in Testing Planar Graphs for Isomorphism

  Jacek Kukluk, Lawrence Holder, Diane Cook

  313-356

• Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs

  B. Panda, Arti Pandey

  493-513

• Algorithm Engineering for Optimal Graph Bipartization

  Falk Hüffner

  77-98

• Algorithms and Bounds for Overloaded Orthogonal Drawings

  Evgenios Kornaropoulos, Ioannis Tollis

  217-246

• Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus

  Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis Tollis

  81-102

• Algorithms and Experiments for the Webgraph

  Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop Sibeyn

  219-236

• Algorithms for Cluster Busting in Anchored Graph Drawing

  Kelly Lyons, Henk Meijer, David Rappaport

  1-24

• Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions

  Achilleas Papakostas, Ioannis Tollis

  81-115

• Algorithms for Multi-Criteria Boundary Labeling

  Marc Benkert, Herman Haverkort, Moritz Kroll, Martin Nöllenburg

  289-317

• Algorithms for Single Link Failure Recovery and Related Problems

  Amit Bhosle, Teofilo Gonzalez

  275-294

• Algorithms for the Hypergraph and the Minor Crossing Number Problems

  Markus Chimani, Carsten Gutwenger

  191-222

• Aligned Drawings of Planar Graphs

  Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter

  401-429

• A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs

  Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki

  31-62

• A Machine Learning Approach for Predicting Human Preference for Graph Layouts

  Shijun Cai, Seok-Hee Hong, Jialiang Shen, Tongliang Liu

  447-471

• A Multilevel Algorithm for Force-Directed Graph-Drawing

  Chris Walshaw

  253-285

• A Multilevel Algorithm for the Minimum 2-sum Problem

  Ilya Safro, Dorit Ron, Achi Brandt

  237-258

• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality

  Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier

  483-522

• 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

• An Algorithm to Construct Greedy Drawings of Triangulations

  Patrizio Angelini, Fabrizio Frati, Luca Grilli

  19-51