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 18 (2014)
Précédent
Suivant
Sommaire du
Fascicule no. 1
The Complexity of the Simultaneous Cluster Problem
Zhentao Li
;
Manikandan Narayanan
;
Adrian Vetta
p. 1-34
Generalizing Geometric Graphs
Edith Brunel
;
Andreas Gemsa
;
Marcus Krug
;
Ignaz Rutter
;
Dorothea Wagner
p. 35-76
Embedding, Clustering and Coloring for Dynamic Maps
Yifan Hu
;
Stephen Kobourov
;
Sankar Veeramoni
p. 77-109
1-Bend Orthogonal Partial Edge Drawing
Till Bruckdorfer
;
Michael Kaufmann
;
Fabrizio Montecchiani
p. 111-131
More on Generalized Jewels and the Point Placement Problem
Md. Shafiul Alam
;
Asish Mukhopadhyay
p. 133-173
Sommaire du
Fascicule no. 2
Guest Editors' Foreword
Stephen Wismath
;
Alexander Wolff
p. 174-175
Superpatterns and Universal Point Sets
Michael Bannister
;
Zhanpeng Cheng
;
William Devanny
;
David Eppstein
p. 177-209
Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity
David Eppstein
p. 211-231
Exploiting Air-Pressure to Map Floorplans on Point Sets
Stefan Felsner
p. 233-252
On the Upward Planarity of Mixed Plane Graphs
Fabrizio Frati
;
Michael Kaufmann
;
János Pach
;
Csaba Tóth
;
David Wood
p. 253-279
A healthy critical attitude: Revisiting the results of a graph drawing study
Helen Purchase
p. 281-311
Sommaire du
Fascicule no. 3
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
Sommaire du
Fascicule no. 4
Guest Editors' Foreword
Sudebkumar Prasant Pal
;
Kunihiko Sadakane
p. 491-492
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
B. Panda
;
Arti Pandey
p. 493-513
Parameterized Algorithms for the H-Packing with t-Overlap Problem
Alejandro López-Ortiz
;
Jazmín Romero
p. 515-538
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
Yuya Higashikawa
;
Mordecai Golin
;
Naoki Katoh
p. 539-555
Editing Simple Graphs
Peter Damaschke
;
Olof Mogren
p. 557-576
Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics
Nils Kriege
;
Petra Mutzel
;
Till Schäfer
p. 577-602
Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs
Jiong Guo
;
Yash Raj Shrestha
p. 603-631
Sommaire du
Fascicule no. 5
Multilayer Drawings of Clustered Graphs
Fabrizio Frati
p. 633-675
Column-Based Graph Layouts
Gregor Betz
;
Andreas Gemsa
;
Christof Mathies
;
Ignaz Rutter
;
Dorothea Wagner
p. 677-708
Computing the Characteristic Polynomial of Threshold Graphs
David Jacobs
;
Vilmar Trevisan
;
Fernando Tura
p. 709-719
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
William Evans
;
Michael Kaufmann
;
William Lenhart
;
Tamara Mchedlidze
;
Stephen Wismath
p. 721-739