Journal of Graph Algorithms and Applications, Tome 23 (2019)

Sommaire du Fascicule no. 1

Md. Saidur Rahman ; Hsu-Chun Yen ; Sheung-Hung Poon

p. 1-2

Sequentially Swapping Colored Tokens on Graphs

Katsuhisa Yamanaka ; Erik Demaine ; Takashi Horiyama ; Akitoshi Kawamura ; Shin-ichi Nakano ; Yoshio Okamoto ; Toshiki Saitoh ; Akira Suzuki ; Ryuhei Uehara ; Takeaki Uno

p. 3-27

The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant

Jun Kawahara ; Toshiki Saitoh ; Ryo Yoshinaka

p. 29-70

An Experimental Study on the Ply Number of Straight-line Drawings

Felice De Luca ; Emilio Di Giacomo ; Walter Didimo ; Stephen Kobourov ; Giuseppe Liotta

p. 71-91

Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems

Yuko Kuroki ; Tomomi Matsui

p. 93-110

Sommaire du Fascicule no. 2

How Bad is the Freedom to Flood-It?

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

p. 111-134

An effective crossing minimisation heuristic based on star insertion

Kieran Clancy ; Michael Haythorpe ; Alex Newcombe

p. 135-166

Finding a Maximum-Weight Convex Set in a Chordal Graph

Jean Cardinal ; Jean-Paul Doignon ; Keno Merckx

p. 167-190

Time Windowed Data Structures for Graphs

Farah Chanchary ; Anil Maheshwari

p. 191-226

Short certificates for chromatic equivalence

Zoe Bukovac ; Graham Farr ; Kerri Morgan

p. 227-269

Covering a Graph with Clubs

Riccardo Dondi ; Giancarlo Mauri ; Florian Sikora ; Italo Zoppis

p. 271-292

Constructing Hard Examples for Graph Isomorphism

Anuj Dawar ; Kashif Khan

p. 293-316

Computation in Causal Graphs

Juli Atherton ; Derek Ruths ; Adrian Vetta

p. 317-344

Construction and Local Routing for Angle-Monotone Graphs

Anna Lubiw ; Debajyoti Mondal

p. 345-369

Drawing Graphs on Few Circles and Few Spheres

Myroslav Kryven ; Alexander Ravsky ; Alexander Wolff

p. 371-391

Fast approximation of eccentricities and distances in hyperbolic graphs

Victor Chepoi ; Feodor Dragan ; Michel Habib ; Yann Vaxès ; Hend Alrasheed

p. 393-433

COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets

Kazuya Haraguchi ; Yusuke Momoi ; Aleksandar Shurbevski ; Hiroshi Nagamochi

p. 434-458

Sommaire du Fascicule no. 3

Guest Editors' Foreword

Therese Biedl ; Andreas Kerren

p. 459-461

Short Plane Supports for Spatial Hypergraphs

Thom Castermans ; Mereke van Garderen ; Wouter Meulemans ; Martin Nöllenburg ; Xiaoru Yuan

p. 463-498

A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width

Michael Jünger ; Petra Mutzel ; Christiane Spisla

p. 499-524

Aesthetic Discrimination of Graph Layouts

Tamara Mchedlidze ; Alexey Pak ; Moritz Klammler

p. 525-552

A New Framework for Hierarchical Drawings

Giacomo Ortali ; Ioannis Tollis

p. 553-578

Pole Dancing: 3D Morphs for Tree Drawings

Elena Arseneva ; Prosenjit Bose ; Pilar Cano ; Anthony D'Angelo ; Vida Dujmović ; Fabrizio Frati ; Stefan Langerman ; Alessandra Tappini

p. 579-602

Sommaire du Fascicule no. 4

Geometry and Generation of a New Graph Planarity Game

Rutger Kraaijer ; Marc van Kreveld ; Wouter Meulemans ; André van Renssen

p. 603-624

Density decompositions of networks

Glencora Borradaile ; Theresa Migler ; Gordon Wilfong

p. 625-651

How to Draw a Planarization

Thomas Bläsius ; Marcel Radermacher ; Ignaz Rutter

p. 653-682

Simultaneous Embeddings with Few Bends and Crossings

Fabrizio Frati ; Michael Hoffmann ; Vincent Kusters

p. 683-713

Treewidth of display graphs: bounds, brambles and applications

Remie Janssen ; Mark Jones ; Steven Kelk ; Georgios Stamoulis ; Taoyang Wu

p. 715-743

Homothetic triangle representations of planar graphs

Daniel Gonçalves ; Benjamin Lévêque ; Alexandre Pinlou

p. 745-753

Sommaire du Fascicule no. 5

Guest Editors' Foreword

M. Sohel Rahman ; Wing-Kin Sung ; Ryuhei Uehara

p. 755-757

Approximating Partially Bounded Degree Deletion on Directed Graphs

Toshihiro Fujito ; Kei Kimura ; Yuki Mizuno

p. 759-780

Faster algorithms for shortest path and network flow based on graph decomposition

Manas Jyoti Kashyop ; Tsunehiko Nagayama ; Kunihiko Sadakane

p. 781-813

Random Popular Matchings with Incomplete Preference Lists

Suthee Ruangwises ; Toshiya Itoh

p. 815-835

A Simple Algorithm for

r

-gatherings on the Line

Shin-ichi Nakano

p. 837-845

Parcourir par