Regular

All Items

• Guest Editors' Foreword

  Michael A. Bekos, Markus Chimani

  i-iii

• Guest Editors’ Foreword

  Ignaz Rutter, Helen Purchase

  45-47

• Guest Editors’ Foreword

  Seok-Hee Hong, Subhas Nandy, Ryuhei Uehara

  207-208

• Guest Editors' Foreword and Overview

  Michael Bekos, Michael Kaufmann, Fabrizio Montecchiani

  1-10

• Guest Editors' forewords

  Md. Saidur Rahman, Petra Mutzel, - Slamin

  239-240

• Guest Editors' Introduction

  Giuseppe Di Battista, Petra Mutzel

  1-2

• Hamilton Cycles in Restricted and Incomplete Rotator Graphs

  Brett Stevens, Aaron Williams

  785-810

• Hamilton Decompositions and (n/2)-Factorizations of Hypercubes

  Douglas Bass, I. Hal Sudborough

  79-98

• Hamiltonian chromatic number of block graphs

  Devsi Bantva

  353-369

• Hanani-Tutte for Radial Planarity

  Radoslav Fulek, Michael Pelsmajer, Marcus Schaefer

  135-154

• Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem

  Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno

  727-751

• Heading in the right direction? Using head moves to traverse phylogenetic network space

  Remie Janssen

  263-310

• How Bad is the Freedom to Flood-It?

  Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi

  111-134

• How to Draw a Planarization

  Thomas Bläsius, Marcel Radermacher, Ignaz Rutter

  653-682

• How to Visualize the K-root Name Server

  Giuseppe Di Battista, Claudio Squarcella, Wolfgang Nagele

  675-699

• Ideal Drawings of Rooted Trees With Approximately Optimal Width

  Therese Biedl

  631-648

• Improved Bounds for Track Numbers of Planar Graphs

  Sergey Pupyrev

  323-341

• Improved (In-)Approximability Bounds for d-Scattered Set

  Ioannis Katsikarelis, Michael Lampis, Vangelis Paschos

  219-238

• Inapproximability of Orthogonal Compaction

  Michael Bannister, David Eppstein, Joseph Simons

  651-673

• Increasing-Chord Graphs On Point Sets

  Hooman Dehkordi, Fabrizio Frati, Joachim Gudmundsson

  761-778

• Incremental Network Design with Minimum Spanning Trees

  Konrad Engel, Thomas Kalinowski, Martin Savelsbergh

  417-432

• Inserting Multiple Edges into a Planar Graph

  Markus Chimani, Petr Hliněný

  489-522

• Interactive Visualization of Streaming Text Data with Dynamic Maps

  Emden Gansner, Yifan Hu, Stephen North

  515-540

• Intersection Graphs in Simultaneous Embedding with Fixed Edges

  Michael Jünger, Michael Schulz

  205-218

• Intersection Graphs of Pseudosegments: Chordal Graphs

  Cornelia Dangelmayr, Stefan Felsner, William Trotter

  199-220