Regular

All Items

• 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

• Maximal origami flip graphs of flat-foldable vertices: properties and algorithms

  Thomas Hull, Manuel Morales, Sarah Nash, Natalya Ter-Saakov

  503-517

• Maximum Cut Parameterized by Crossing Number

  Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils Kriege, Petra Mutzel, Alexander Nover

  155-170

• Memory Paging for Connectivity and Path Problems in Graphs

  Esteban Feuerstein, Alberto Marchetti-Spaccamela

  1-22

• Metric Dimension Parameterized by Max Leaf Number

  David Eppstein

  313-323

• Min-$k$-planar Drawings of Graphs

  Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmović, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini

  1-35

• Minimal Embedding Dimensions of Rectangle k-Visibility Graphs

  Espen Slettnes

  59-96

• Minimal Representations of Order Types by Geometric Graphs

  Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kynčl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl

  551-572

• Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

  Yuya Higashikawa, Mordecai Golin, Naoki Katoh

  539-555

• Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network

  Wilfried Ehounou, Dominique Barth, Arnaud de Moissac, Dimitri Watel, Marc-Antoine Weisser

  133-153

• Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph

  Bojan Mohar, Petr Škoda

  225-241