Journal of Graph Algorithms and Applications, Tome 18 (2014) no. 3

Geodesic

Parcourir par

Volume 18 (2014) no. 3

Sommaire

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

p. 313-324

Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time

Carola Doerr ; G. Ramakrishna ; Jens Schmidt

p. 325-346

The Star and Biclique Coloring and Choosability Problems

Marina Groshaus ; Francisco Soulignac ; Pablo Terlisky

p. 347-383

The agreement problem for unrooted phylogenetic trees is FPT

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

p. 385-392

Computational search of small point sets with small rectilinear crossing number

Ruy Fabila-Monroy ; Jorge López

p. 393-399

Crossing Angles of Geometric Graphs

Karin Arikushi ; Csaba Tóth

p. 401-420

1-Visibility Representations of 1-Planar Graphs

Franz Brandenburg

p. 421-438

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

p. 439-457

Slanted Orthogonal Drawings: Model, Algorithms and Evaluations

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

p. 459-489