Abstract is missing.
- On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing AnglesEyal Ackerman, Radoslav Fulek, Csaba D. Tóth. 1-12 [doi]
- Monotone Drawings of GraphsPatrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. 13-24 [doi]
- Upward Geometric Graph Embeddings into Point SetsPatrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis. 25-37 [doi]
- On a Tree and a Path with No Geometric Simultaneous EmbeddingPatrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth. 38-49 [doi]
- Difference Map Readability for Dynamic GraphsDaniel Archambault, Helen C. Purchase, Bruno Pinaud. 50-61 [doi]
- Maximizing the Total Resolution of GraphsEvmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis. 62-67 [doi]
- Plane Drawings of Queue and Deque GraphsChristopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner. 68-79 [doi]
- An Experimental Evaluation of Multilevel Layout MethodsGereon Bartel, Carsten Gutwenger, Karsten Klein, Petra Mutzel. 80-91 [doi]
- Orthogonal Graph Drawing with Flexibility ConstraintsThomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner. 92-104 [doi]
- Drawing Ordered (::::k:::: - 1)-Ary Trees on ::::k::::-GridsWolfgang Brunner, Marco Matzeder. 105-116 [doi]
- Optimizing Regular Edge LabelingsKevin Buchin, Bettina Speckmann, Sander Verdonschot. 117-128 [doi]
- Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial AreaErin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler. 129-140 [doi]
- Crossing Minimization and Layouts of Directed Hypergraphs with Port ConstraintsMarkus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, Hoi-Ming Wong. 141-152 [doi]
- Drawing Graphs on a SmartphoneGiordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia. 153-164 [doi]
- Topology-Driven Force-Directed AlgorithmsWalter Didimo, Giuseppe Liotta, Salvatore Agostino Romeo. 165-176 [doi]
- On Graphs Supported by Line SetsVida Dujmovic, William Evans, Stephen G. Kobourov, Giuseppe Liotta, Christophe Weibel, Stephen K. Wismath. 177-182 [doi]
- Drawing Trees with Perfect Angular Resolution and Polynomial AreaChristian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg. 183-194 [doi]
- Lombardi Drawings of GraphsChristian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg. 195-207 [doi]
- Optimal 3D Angular Resolution for Low-Degree GraphsDavid Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg. 208-219 [doi]
- Improved Lower Bounds on the Area Requirements of Series-Parallel GraphsFabrizio Frati. 220-225 [doi]
- A Computational Approach to Conway s Thrackle ConjectureRadoslav Fulek, János Pach. 226-237 [doi]
- Optimal ::::k::::-Level Planarization and Crossing MinimizationGraeme Gange, Peter J. Stuckey, Kim Marriott. 238-249 [doi]
- On Touching Triangle GraphsEmden R. Gansner, Yifan Hu, Stephen G. Kobourov. 250-261 [doi]
- Triangle Contact Representations and DualityDaniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou. 262-273 [doi]
- On Maximum Differential Graph ColoringYifan Hu, Stephen G. Kobourov, Sankar Veeramoni. 274-286 [doi]
- Dot Product Representations of Planar GraphsRoss J. Kang, Tobias Müller. 287-292 [doi]
- Drawing Planar Graphs of Bounded Degree with Few SlopesBalázs Keszegh, János Pach, Dömötör Pálvölgyi. 293-304 [doi]
- Complexity of Finding Non-Planar Rectilinear Drawings of GraphsJán Manuch, Murray Patterson, Sheung-Hung Poon, Chris Thachuk. 305-316 [doi]
- Point-Set Embeddings of Plane 3-Trees - (Extended Abstract)Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur Rahman. 317-328 [doi]
- Improving Layered Graph Layouts with Edge BundlingSergey Pupyrev, Lev Nachmanson, Michael Kaufmann. 329-340 [doi]
- Confluent Drawing Algorithms Using Rectangular DualizationGianluca Quercini, Massimo Ancona. 341-352 [doi]
- Universal Pointsets for 2-Coloured TreesMereke van Garderen, Giuseppe Liotta, Henk Meijer. 365-370 [doi]
- The Quality Ratio of RAC Drawings and Planar Drawings of Planar GraphsMarc J. van Kreveld. 371-376 [doi]
- Convex Polygon Intersection GraphsErik Jan van Leeuwen, Jan van Leeuwen. 377-388 [doi]
- GraphML-Based Exploration and Evaluation of Efficient Parallelization Alternatives for Automation FirmwareJürgen Bregenzer. 389-390 [doi]
- Automatic Generation of Route SketchesAndreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter. 391-392 [doi]
- Visualizing Differences between Two Large GraphsMarkus Geyer, Michael Kaufmann, Robert Krug. 393-394 [doi]
- Placing Edge Labels by Modifying an Orthogonal Graph DrawingKonstantinos G. Kakoulis, Ioannis G. Tollis. 395-396 [doi]
- Large Crossing Angles in Circular LayoutsQuan Hoang Nguyen, Peter Eades, Seok-Hee Hong, Weidong Huang. 397-399 [doi]
- GVSR: An On-Line Guide for Choosing a Graph Visualization SoftwareBruno Pinaud, Pascale Kuntz. 400-401 [doi]
- IBM ILOG Multi-platform Graph Layout TechnologyGeorg Sander. 402-403 [doi]
- Comparative Visualization of User Flows in Voice PortalsBjörn Zimmer, Dennie Ackermann, Manfred Schröder, Andreas Kerren, Volker Ahlers. 404-405 [doi]
- Graph Drawing Contest ReportChristian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander. 406-411 [doi]