| No. |
Title |
Author |
Year |
| 1 |
Bounded VC-Dimension Implies the Schur-Erdős Conjecture |
Fox, Jacob et al. |
2020 |
| 2 |
Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092) |
Hong, Seok-Hee et al. |
2019 |
| 3 |
On the Chromatic Number of Disjointness Graphs of Curves |
Pach, János et al. |
2019 |
| 4 |
Semi-Algebraic Colorings of Complete Graphs |
Fox, Jacob et al. |
2019 |
| 5 |
A Crossing Lemma for Multigraphs |
Pach, János et al. |
2018 |
| 6 |
Almost All String Graphs are Intersection Graphs of Plane Convex Sets |
Pach, János et al. |
2018 |
| 7 |
Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452) |
Hong, Sok-Hee et al. |
2017 |
| 8 |
Disjointness Graphs of Segments |
Pach, János et al. |
2017 |
| 9 |
Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension |
Fox, Jacob et al. |
2017 |
| 10 |
A Lower Bound on Opaque Sets |
Kawamura, Akitoshi et al. |
2016 |
| 11 |
New Lower Bounds for epsilon-Nets |
Kupavskii, Andrey et al. |
2016 |
| 12 |
Front Matter, Table of Contents, Preface, Conference Organization |
Arge, Lars et al. |
2015 |
| 13 |
LIPIcs, Volume 34, SoCG'15, Complete Volume |
Arge, Lars et al. |
2015 |
