Volume 15, Number 1, 2011

• 
  David Eppstein, Emden R. Gansner: Guest Editor's Foreword. 3-5
• 
  Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planar Drawings of Higher-Genus Graphs. 7-32
• 
  André Schulz: Drawing 3-Polytopes with Good Vertex Resolution. 33-52
• 
  Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati, Giuseppe Di Battista, Michael Kaufmann, Antonios Symvonis: On the Perspectives Opened by Right Angle Crossing Drawings. 53-78
• 
  Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek: Geometric Simultaneous Embeddings of a Graph and a Matching. 79-96
• 
  Melanie Badent, Ulrik Brandes, Sabine Cornelsen: More Canonical Ordering. 97-126
• 
  Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong: Upward Planarization Layout. 127-155
• 
  Ulrik Brandes, Christian Pich: More Flexible Radial Layout. 157-173

Volume 15, Number 2, 2011

• 
  Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Muhammad Jawaherul Alam: Minimum-Area Drawings of Plane 3-Trees. 177-204
• 
  Anna Lubiw, Mark Petrick: Morphing Planar Graph Drawings with Bent Edges. 205-227
• 
  Walter Didimo, Giuseppe Liotta, Salvatore Agostino Romeo: A Graph Drawing Application to Web Site Traffic Analysis. 229-251
• 
  Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng: On the threshold-width of graphs. 253-268
• 
  David Eppstein: Recognizing Partial Cubes in Quadratic Time. 269-293
• 
  Jonathan L. Gross: Genus Distributions of Cubic Outerplanar Graphs. 295-316

Volume 15, Number 3, 2011

• 
  Sandip Das, Ryuhei Uehara: Guest Editor's Foreword. 319-321
• 
  Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi: Recognition of Unigraphs through Superposition of Graphs. 323-343
• 
  Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi: Minmax Tree Cover in the Euclidean Space. 345-371
• 
  Tamara Mchedlidze, Antonios Symvonis: Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. 373-415
• 
  Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves: Recursive generation of simple planar 5-regular graphs and pentangulations. 417-436
• 
  Muhammad Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman: Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area. 437-456
• 
  Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano: Generating All Triangulations of Plane Graphs. 457-482

Volume 15, Number 4, 2011

• 
  Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara: The Voronoi game on graphs and its complexity. 485-501
• 
  Herman J. Haverkort, Laura Toma: I/O-Efficient Algorithms on Near-Planar Graphs. 503-532
• 
  Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek: On Planar Supports for Hypergraphs. 533-549
• 
  David Eppstein, Kevin A. Wortman: Optimal Angular Resolution for Face-Symmetric Drawings. 551-564

Volume 15, Number 5, 2011

• 
  Md. Saidur Rahman, Satoshi Fujita: Guest Editor's Foreword. 567-568
• 
  Tetsuo Asano, Wolfgang Mulzer, Yajun Wang: Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons. 569-586
• 
  Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin: Switch-Regular Upward Planarity Testing of Directed Trees. 587-629
• 
  Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hübner: Global k-Level Crossing Reduction. 631-659
• 
  Takeya Shigezumi, Yushi Uno, Osamu Watanabe: A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques. 661-682
• 
  T. V. Thirumala Reddy, C. Pandu Rangan: Variants of Spreading Messages. 683-699

Volume 15, Number 6, 2011

• 
  Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller: Triangle Sparsifiers. 703-726
• 
  Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. 727-751
• 
  R. Vijayalakshmi, R. Nadarajan, John F. Roddick, M. Thilaga, P. Nirmala: FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs. 753-776

last updated on Thu May 23 04:26:46 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page