Regular

All Items

• Intersection Graphs of Pseudosegments: Chordal Graphs

  Cornelia Dangelmayr, Stefan Felsner, William Trotter

  199-220

• Intersection Graphs of Rays and Grounded Segments

  Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber

  273-295

• Intersection-Link Representations of Graphs

  Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter

  731-755

• I/O-Efficient Algorithms on Near-Planar Graphs

  Herman Haverkort, Laura Toma

  503-532

• I/O-Optimal Algorithms for Outerplanar Graphs

  Anil Maheshwari, Norbert Zeh

  47-87

• k-colored Point-set Embeddability of Outerplanar Graphs

  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen Wismath

  29-49

• Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions

  Bart M. P. Jansen, Bart van der Steenhoven

  1-28

• Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights

  Bart Jansen

  811-846

• Large-Graph Layout Algorithms at Work: An Experimental Study

  Stefan Hachul, Michael Jünger

  345-369

• Least resolved trees for two-colored best match graphs

  David Schaller, Manuela Geiß, Marc Hellmuth, Peter Stadler

  397-416

• Level Planar Embedding in Linear Time

  Michael Jünger, Sebastian Leipert

  67-113

• Linear-algebraic implementation of Fibonacci heap

  Danila Demin, Dmitry Sirotkin, Stanislav Moiseev

  27-50

• Listing All Plane Graphs

  Katsuhisa Yamanaka, Shin-ichi Nakano

  5-18

• Lombardi Drawings of Graphs

  Christian Duncan, David Eppstein, Michael Goodrich, Stephen Kobourov, Martin Nöllenburg

  85-108

• Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring

  Magnús Halldórsson, Hoong Chuin Lau

  1-13

• Low-Distortion Embeddings of Trees

  Robert Babilon, Jirí Matoušek, Jana Maxová, Pavel Valtr

  399-409

• Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth

  Bas van Geffen, Bart Jansen, Arnoud de Kroon, Rolf Morel

  461-482

• Lower Bounds for Graph Exploration Using Local Policies

  Aditya Kumar Akash, Sándor Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin

  371-387

• Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs

  Tapas Kumar Mishra, Sudebkumar Prasant Pal

  671-688

• Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings

  David Wood

  33-77

• Many-to-One Boundary Labeling

  Chun-Cheng Lin, Hao-Jen Kao, Hsu-Chun Yen

  319-356

• Many-to-One Boundary Labeling with Backbones

  Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis

  779-816

• MapSets: Visualizing Embedded and Clustered Graphs

  Alon Efrat, Yifan Hu, Stephen Kobourov, Sergey Pupyrev

  571-593

• Matched Drawings of Planar Graphs

  Emilio Di Giacomo, Walter Didimo, Marc van Kreveld, Giuseppe Liotta, Bettina Speckmann

  423-445

• Maximal Neighborhood Search and Rigid Interval Graphs

  Peng Li, Yaokun Wu

  245-264