- Crossing Numbers and Stress of Random Graphs
- Arrangements of Pseudocircles: On Circularizability
- Short Plane Supports for Spatial Hypergraphs
- On L-shaped point set embeddings of trees: First non-embeddable examples
- Realization and Connectivity of the Graphs of Origami Flat Foldings
- A Greedy Heuristic for Crossing Angle Maximization
- Clustered Planarity = Flat Clustered Planarity
- Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends
- A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width
- Universal Slope Sets for Upward Planar Drawings
- Bend-minimum Orthogonal Drawings in Quadratic Time
- β-Stars or On Extending a Drawing of a Connected Subgraph
- Visualizing the Template of a Chaotic Attractor
- Monotone Drawings of k-Inner Planar Graphs
- On RAC Drawings of Graphs with one Bend per Edge
- Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs
- Perception of Symmetries in Drawings of Graphs
- Greedy Rectilinear Drawings
- Crossing Minimization in Perturbed Drawings
- Network Alignment by Discrete Ollivier-Ricci Flow
- On Contact Graphs of Paths on a Grid
- A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution
- The number of crossings in multigraphs with no empty lens
- On the Area-Universality of Triangulations
- Queue Layouts of Planar 3-Trees
- The Complexity of Drawing a Graph in a Polygonal Region
- Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity
- Aesthetic Discrimination of Graph Layouts
- Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
- Inserting an Edge into a Geometric Embedding
- Same Stats, Different Graphs (Graph Statistics and Why We Need Graph Drawings)
- The Queue Number of Planar Posets
- How to Fit a Tree in a Box
- Turning Cliques into Paths to Achieve Planarity
- Level Planarity: Transitivity vs. Even Crossings
- Algorithms and Bounds for Drawing Directed Graphs
- The Weighted Barycenter Drawing Recognition Problem
- Upward Planar Morphs
- Recognition and Drawing of Stick Graphs
- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles