-
1
-
Unavoidable Patterns in Complete Simple Topological Graphs
-
2
-
Compatible Spanning Trees in Simple Drawings of <inline-formula><alternatives><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>K</mi><mi>n</mi></msub></math><tex-math>\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_n$$\end{document}</tex-math><inline-graphic></inline-graphic></alternatives></inline-formula>
-
3
-
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs
-
4
-
Empty Triangles in Generalized Twisted Drawings of <inline-formula><alternatives><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>K</mi><mi>n</mi></msub></math><tex-math>\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_n$$\end{document}</tex-math><inline-graphic></inline-graphic></alternatives></inline-formula>
-
5
-
Shooting Stars in Simple Drawings of <inline-formula><alternatives><math xmlns="http://www.w3.org/1998/Math/MathML"><msub><mi>K</mi><mrow><mi>m</mi><mo>,</mo><mi>n</mi></mrow></msub></math><tex-math>\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_{m,n}$$\end{document}</tex-math><inline-graphic></inline-graphic></alternatives></inline-formula>
-
6
-
FORBID: Fast Overlap Removal by Stochastic GradIent Descent for Graph Drawing
-
7
-
Spherical Graph Drawing by Multi-dimensional Scaling
-
8
-
Shape-Faithful Graph Drawings
-
9
-
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
-
10
-
Unit-length Rectangular Drawings of Graphs
-
11
-
Strictly-Convex Drawings of 3-Connected Planar Graphs
-
12
-
Rectilinear Planarity of Partial 2-Trees
-
13
-
Testing Upward Planarity of Partial 2-Trees
-
14
-
Computing a Feedback Arc Set Using PageRank
-
15
-
<italic>st</italic>-Orientations with Few Transitive Edges
-
16
-
Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem
-
17
-
Planarizing Graphs and Their Drawings by Vertex Splitting
-
18
-
The Thickness of Fan-Planar Graphs is At Most Three
-
19
-
An FPT Algorithm for Bipartite Vertex Splitting
-
20
-
On Time and Space: An Experimental Study on Graph Structural and Temporal Encodings
-
21
-
Small Point-Sets Supporting Graph Stories
-
22
-
On the Complexity of the Storyplan Problem
-
23
-
Visualizing Evolving Trees
-
24
-
Improved Scheduling of Morphing Edge Drawing
-
25
-
Queue Layouts of Two-Dimensional Posets
-
26
-
Recognizing DAGs with Page-Number 2 Is NP-complete
-
27
-
The Rique-Number of Graphs
-
28
-
Morphing Rectangular Duals
-
29
-
Visibility Representations of Toroidal and Klein-bottle Graphs
-
30
-
Coloring Mixed and Directional Interval Graphs
-
31
-
Outside-Obstacle Representations with All Vertices on the Outer Face
-
32
-
Arrangements of Pseudocircles: On Digons and Triangles
-
33
-
Graph Drawing Contest Report
