Regular

All Items

• 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

• 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 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