Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Journal of Graph Algorithms and Applications
Tome 21 (2017)
no. 6
Précédent
Suivant
Volume 21 (2017) no. 6
Sommaire
Column planarity and partially-simultaneous geometric embedding
Luis Barba
;
William Evans
;
Michael Hoffmann
;
Vincent Kusters
;
Maria Saumell
;
Bettina Speckmann
p. 983-1002
Computing phylogenetic trees using topologically related minimum spanning trees
Prabhav Kalaghatgi
;
Thomas Lengauer
p. 1003-1025
Root demotion: efficient post-processing of layered graphs to reduce dummy vertices for hierarchical graph drawing
Daniel Summer Magruder
;
Stefan Bonn
p. 1027-1038
Parameterized and approximation complexity of the detection pair problem in graphs
Florent Foucaud
;
Ralf Klasing
p. 1039-1056
Planarity of Overlapping Clusterings Including Unions of Two Partitions
Jan Christoph Athenstädt
;
Sabine Cornelsen
p. 1057-1089
Equitable colorings of
$K_4$
-minor-free graphs
Rémi de Joannis de Verclos
;
Jean-Sébastien Sereni
p. 1091-1105
Graphs with Obstacle Number Greater than One
Leah Wrenn Berman
;
Glenn Chappell
;
Jill Faudree
;
John Gimbel
;
Chris Hartman
;
Gordon Williams
p. 1107-1119