Vol. 18 No. 3 (2014)

Published: 2014-05-01

Universal Point Sets for Drawing Planar Graphs with Circular Arcs

Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff

313-324
- article (PDF)
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time

Carola Doerr, G. Ramakrishna, Jens Schmidt

325-346
- article (PDF)
The Star and Biclique Coloring and Choosability Problems

Marina Groshaus, Francisco Soulignac, Pablo Terlisky

347-383
- article (PDF)
The agreement problem for unrooted phylogenetic trees is FPT

Celine Scornavacca, Leo van Iersel, Steven Kelk, David Bryant

385-392
- article (PDF)
Computational search of small point sets with small rectilinear crossing number

Ruy Fabila-Monroy, Jorge López

393-399
- article (PDF)
Crossing Angles of Geometric Graphs

Karin Arikushi, Csaba Tóth

401-420
- article (PDF)
1-Visibility Representations of 1-Planar Graphs

Franz Brandenburg

421-438
- article (PDF)
Advantage in the discrete Voronoi game

Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote

439-457
- article (PDF)
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations

Michael Bekos, Michael Kaufmann, Robert Krug, Thorsten Ludwig, Stefan Näher, Vincenzo Roselli

459-489
- article (PDF)