Graph Drawing Book

	Reconfiguring triangulations with edge flips and point moves	1
	Drawing power law graphs	12
	Hexagonal grid drawings : algorithms and lower bounds	18
	Improved bounds for the number of ([actual symbol not reproducible] k)-sets, convex quadrilaterals, and the rectilinear crossing number of K[subscript n]	25
	On the realizable weaving patterns of polynomial curves in R[superscript 3]	36
	Drawing the AS graph in 2.5 dimensions	43
	Boundary labeling : models and efficient algorithms for rectangular maps	49
	Convex drawings of 3-connected plane graphs	60
	Partitions of complete geometric graphs into plane trees	71
	Additional PC-tree planarity conditions	82
	GraphML transformation	89
	Clustering cycles into cycles of clusters	100
	Unit bar-visibility layouts of triangulated polygons	111
	Really straight graph drawings	122
	Layouts of graph subdivisions	133
	Label number maximization in the slider model	144
	An efficient implementation of Sugiyama's algorithm for layered graph drawing	155
	Random geometric graph diameter in the unit disk with l[subscript p] metric	167
	Algorithms for drawing media	173
	Confluent layered drawings	184
	Simultaneous embedding of planar graphs with few bends	195
	A fast and simple heuristic for constrained two-level crossing reduction	206
	Contact and intersection representations	217
	Dynamic graph drawing of sequences of orthogonal and hierarchical graphs	228
	Graph drawing by stress majorization	239
	Computing radial drawings on the minimum number of circles	251
	Hamiltonian-with-handles graphs and the k-spine drawability problem	262
	Distributed graph layout for sensor networks	273
	Drawing large graphs with a potential-field-based multilevel algorithm	285
	Building blocks of upward planar digraphs	296
	A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs	307
	Train tracks and confluent drawings	318
	The three dimensional logic engine	329
	Long alternating paths in bicolored point sets	340
	Intersection reverse sequences and geometric applications	349
	New exact results and bounds for bipartite crossing numbers of meshes	360
	Drawing Pfaffian graphs	371
	3D visualization of semantic metadata models and ontologies	377
	A note on the self-similarity of some orthogonal drawings	389
	No-three-in-line-in-3D	395
	Visual navigation of compound graphs	403
	Layout volumes of the hypercube	414
	New theoretical bounds of visibility representation of plane graphs	425
	Visualizing large graphs with compound-fisheye views and treemaps	431
	A compound graph layout algorithm for biological pathways	442
	Curvilinear graph drawing using the force-directed method	448
	Graphael : a system for generalized force-directed layouts	454
	QUOGGLES : query on graphs - a graphical largely extensible system	465
	Visualisation of large and complex networks using PolyPlane	471
	The metro map layout problem	482
	An interactive multi-user system for simultaneous graph drawing	492
	Gravisto : graph visualization toolkit	502
	DNA secondary structures for probe design	504
	Open problems Wiki	508
	Visualization and ILOG CPLEX	510
	Graph-drawing contest report	512
	Fast algorithms for hard graph problems : bidimensionality, minors, and local treewidth	517