Program
Program Overview
Preliminary Schedule
Please note that the following schedule is only tentative.
Note for presenters: Please consider the provided information when preparing your presentation.
Jump to Monday, Tuesday, Wednesday, Thursday, or Friday.
Monday, September 16 | |
---|---|
Time | Event |
08:30 - 09:00 | Registration, Room GM3 |
09:00 - 12:00 |
Phd School: Room GM3 |
12:00 - 14:00 | Free time for individual lunch break |
14:00 - 17:00 |
Phd School: Room GM3 |
Tuesday, September 17 | |
---|---|
Time | Event |
09:00 - 12:00 |
Phd School: Room GM3 |
12:00 - 14:00 | Free time for individual lunch break |
14:00 - 17:00 |
Phd School: Room GM3 |
19:00 - 21:00 | Welcome Reception, TUtheSky |
Wednesday, September 18 | |
---|---|
Time | Event |
08:30 - 09:00 | Registration, TUtheSky |
09:00 - 09:15 | Opening |
Session 1 | TUtheSky |
09:15 - 09:35 | On the Uncrossed Number of Graphs [T1] |
09:35 - 09:55 | Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs [T1] |
09:55 - 10:15 | On the edge density of bipartite 3-planar and bipartite gap-planar graphs [T1] |
10:15 - 10:30 | 1-planar unit distance graphs [S] |
10:30 - 11:00 | Coffee Break, TUtheSky |
Session 2 | TUtheSky |
11:00 - 11:20 | Bundling-Aware Graph Drawing [T2] |
11:20 - 11:40 | Connectivity-Faithful Graph Drawing [T2] |
11:40 - 12:00 | The Perception of Stress in Graph Drawings [T2] |
12:00 - 12:20 | Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings [T2] |
12:20 - 14:00 | Lunch, Mensa Freihaus |
Session 3 | TUtheSky |
14:00 - 14:20 | The Parameterized Complexity of Extending Stack Layouts [T1] |
14:20 - 14:40 | Parameterized Algorithms for Beyond Planar Crossing Numbers [T1] |
14:40 - 14:55 | On k-Plane Insertion into Plane Drawings [S] |
14:55 - 15:15 | Poster Teasers, TUtheSky |
15:15 - 16:15 |
Poster & Software Session, TUtheSky & Room BA10A Exhibited Posters:
Exhibited Software:
|
15:15 - 16:15 | Coffee Break, TUtheSky |
Session 4 | Best Papers Session, TUtheSky |
16:15 - 16:20 | Introduction to best papers |
16:20 - 16:40 | The Density Formula: One Lemma to Bound Them All [T1] |
16:40 - 17:00 | GraphTrials: Visual Proofs of Graph Properties [T2] |
17:00 - 18:30 | GD Contest (Room GM3) & Software Exhibition (Room BA10A) |
Thursday, September 19 | |
---|---|
Time | Event |
Session 5 | TUtheSky |
09:00 - 09:20 | Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach [T1] |
09:20 - 09:40 | Storylines with a Protagonist [T2] |
09:40 - 09:55 | Quantum Algorithms for One-Sided Crossing Minimization [S] |
09:55 - 10:15 | Boundary Labeling in a Circular Orbit [T1] |
10:15 - 10:30 | Partitioning complete geometric graphs into plane subgraphs [S] |
10:30 - 11:00 | Coffee Break, TUtheSky |
Session 6 | Sponsored by yWorks, TUtheSky |
11:00 - 11:20 | Geometric Graphs with and without Product Structure [T1] |
11:20 - 11:40 | Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors [T1] |
11:40 - 12:00 | On k-planar Graphs without Short Cycles [T1] |
12:00 - 12:20 | Bounding the Treewidth of Outer k-Planar Graphs via Triangulations [T1] |
12:20 - 14:00 | Lunch, Mensa Freihaus |
14:00 - 15:00 | Invited Talk, TUtheSky How Can Biclique Covers Help in Matching Problems |
15:00 - 15:30 | Coffee Break, TUtheSky |
Session 7 | Sponsored by Tom Sawyer Software, TUtheSky |
15:30 - 15:50 | Enumeration of intersection graphs of $$x$$-monotone curves [T1] |
15:50 - 16:05 | Holes in Convex and Simple Drawings [S] |
16:05 - 16:25 | Flips in colorful triangulations [T1] |
16:25 - 16:45 | The Euclidean MST-ratio of Bi-colored Lattices [T1] |
16:50 - 17:45 | Business Meeting, TUtheSky |
18:15- 18:45 | Tram Ride |
19:00 - 23:00 | Social Dinner, "Das Campus" |
Friday, September 20 | |
---|---|
Time | Event |
Session 8 | TUtheSky |
09:00 - 09:20 | Constrained Outer-String Representations [T1] |
09:20 - 09:35 | Harborth's conjecture for 4-regular planar graphs [S] |
09:35 - 09:50 | Note on Min-k-Planar Drawings of Graphs [S] |
09:50 - 10:10 | Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature [T1] |
10:10 - 10:30 | Noncrossing Longest Paths and Cycles [T1] |
10:30 - 11:00 | Coffee Break, TUtheSky |
Session 9 | TUtheSky |
11:00 - 11:20 | Monotone Arc Diagrams with few Biarcs [T1] |
11:20 - 11:40 | Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles [T1] |
11:40 - 12:00 | Morphing Planar Graph Drawings via Orthogonal Box Drawings [T1] |
12:00 - 12:20 | On the Complexity of Recognizing $$k^+$$-Real Face Graphs [T1] |
12:20 - 14:00 | Lunch, Mensa Freihaus |
14:00 - 15:00 | Invited Talk, TUtheSky How Can Algorithms Help in Protecting our Privacy |
15:00 - 15:30 | Coffee Break, TUtheSky |
Session 10 | TUtheSky |
15:30 - 15:50 | The Price of Upwardness [T1] |
15:50 - 16:10 | Upward Pointset Embeddings of st-Graphs [T1] |
16:10 - 16:30 | Weakly Leveled Planarity with Bounded Span [T1] |
16:30 - 16:45 | Closing Remarks & Award Ceremony, TUtheSky |