Regular

All Items

• Approximating Partially Bounded Degree Deletion on Directed Graphs

  Toshihiro Fujito, Kei Kimura, Yuki Mizuno

  759-780

• Approximating the Bundled Crossing Number

  Alan Arroyo, Stefan Felsner

  433-457

• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems

  Yuko Kuroki, Tomomi Matsui

  93-110

• Approximation Algorithms for Not Necessarily Disjoint Clustered TSP

  Nili Guttmann-Beck, Eyal Knaan, Michal Stern

  555-575

• Approximation Algorithms for Some Graph Partitioning Problems

  G. He, J. Liu, C. Zhao

  1-11

• Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems

  Kerri Morgan, Graham Farr

  165-193

• Approximations of Weighted Independent Set and Hereditary Subset Problems

  Magnús Halldórsson

  1-16

• A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs

  Alane de Lima, Murilo da Silva, André Vignatti

  603-619

• Arrangements of orthogonal circles with many intersections

  Sarah Carmesin, André Schulz

  49-70

• Art of Graph Drawing and Art

  Jaroslav Nešetril

  131-147

• A short proof of the non-biplanarity of $K_9$

  Ahmad Biniaz

  75-80

• A Simple Algorithm for $r$-gatherings on the Line

  Shin-ichi Nakano

  837-845

• A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges

  David Bader, Paul Burkhardt

  577-588

• A Sparse Stress Model

  Mark Ortmann, Mirza Klimenta, Ulrik Brandes

  791-821

• A Split&Push Approach to 3D Orthogonal Drawing

  Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu

  105-133

• A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs

  Grant Cheston, Tjoen Seng Jap

  159-190

• Augmenting the Connectivity of Planar and Geometric Graphs

  Ignaz Rutter, Alexander Wolff

  599-628

• A User Study in Similarity Measures for Graph Drawing

  Stina Bridgeman, Roberto Tamassia

  225-254

• A Visibility Representation for Graphs in Three Dimensions

  Prosenjit Bose, Hazel Everett, Sándor Fekete, Michael Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas Shermer, Sue Whitesides, Christian Zelle

  1-16

• B0-VPG Representation of AT-free Outerplanar Graphs

  Sparsh Jain, Sreejith Pallathumadam, Deepak Rajendraprasad

  853-869

• Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs

  Christian Duncan, Michael Goodrich, Stephen Kobourov

  19-46

• Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs

  William Evans, Michael Kaufmann, William Lenhart, Tamara Mchedlidze, Stephen Wismath

  721-739

• Bar k-Visibility Graphs

  Alice Dean, William Evans, Ellen Gethner, Joshua Laison, Mohammad Ali Safari, William Trotter

  45-59

• Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs

  Ahmad Biniaz

  209-224

• Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings

  David Eppstein

  549-562