Graph Drawing

Planar Subgraphs.- Planar Induced Subgraphs of Sparse Graphs.- Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph.- Drawing Partially Embedded and Simultaneously Planar Graphs.- Simultaneous Embeddings.- Drawing Simultaneously Embedded Graphs with Few Bends.- Planar and Quasi Planar Simultaneous Geometric Embedding.- Simultaneous Embeddability of Two Partitions.- Applications.- Luatodonotes: Boundary Labeling for Annotations in Texts.- A Coloring Algorithm for Disambiguating Graph and Map Drawings.- Untangling Hairballs: From 3 to 14 Degrees of Separation.- GION: Interactively Untangling Large Graphs on Wall-Sized Displays.- Contact Representations.- Balanced Circle Packings for Planar Graphs.- Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D.- The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings.- Bitonic st-orderings of Biconnected Planar Graphs.- k-Planar Graphs.- Drawing Outer 1-planar Graphs with Few Slopes.- Fan-Planar Graphs: Combinatorial Properties and Complexity Results.- On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs.- Crossing Minimization Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth.- A Crossing Lemma for the Pair-Crossing Number.- Are Crossings Important for Drawing Large Graphs?.- Level Drawings.- The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity).- Column Planarity and Partial Simultaneous Geometric Embedding.- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths.- Theory.- Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture.- Morphing Schnyder Drawings of Planar Triangulations.- Trade-Offs in Planar Polyline Drawings.- Fixed Edge Directions.- Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports.- Planar Octilinear Drawings with One Bend Per Edge.- On the Complexity of