Vol. 23 No. 2 (2019)

Published: 2019-01-01

How Bad is the Freedom to Flood-It?

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

111-134
- article (PDF)
An effective crossing minimisation heuristic based on star insertion

Kieran Clancy, Michael Haythorpe, Alex Newcombe

135-166
- article (PDF)
Finding a Maximum-Weight Convex Set in a Chordal Graph

Jean Cardinal, Jean-Paul Doignon, Keno Merckx

167-190
- article (PDF)
Time Windowed Data Structures for Graphs

Farah Chanchary, Anil Maheshwari

191-226
- article (PDF)
Short certificates for chromatic equivalence

Zoe Bukovac, Graham Farr, Kerri Morgan

227-269
- article (PDF)
Covering a Graph with Clubs

Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis

271-292
- article (PDF)
Constructing Hard Examples for Graph Isomorphism

Anuj Dawar, Kashif Khan

293-316
- article (PDF)
Computation in Causal Graphs

Juli Atherton, Derek Ruths, Adrian Vetta

317-344
- article (PDF)
Construction and Local Routing for Angle-Monotone Graphs

Anna Lubiw, Debajyoti Mondal

345-369
- article (PDF)
Drawing Graphs on Few Circles and Few Spheres

Myroslav Kryven, Alexander Ravsky, Alexander Wolff

371-391
- article (PDF)
Fast approximation of eccentricities and distances in hyperbolic graphs

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

393-433
- article (PDF)
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets

Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi

434-458
- article (PDF)