Journals (with refereeing)

• P. Angelini, M. A. Bekos, F. J. Brandenburg, G. Da Lozzo, G. Di Battista, W. Didimo, M. Hoffmann, G. Liotta, F. Montecchiani, I. Rutter, C. D. Tóth. Simple k-Planar Graphs are Simple (k + 1)-Quasiplanar. J. Combin. Theory Ser. B, 142 (2020), 1-35.
• J. Cardinal, J. Nummenpalo, E. Welzl. Solving and Sampling with Many Solutions. Algorithmica, 82 (2020), 1474-1489.
• M.-K. Chiu, S. Felsner, M. Scheucher, P. Schnider, R. Steiner, P. Valtr. On the Average Complexity of the k-Level. Journal of Computational Geometry, 2020, to appear.
• K. Clarkson, B. Gärtner, J. Lengler, M. Szedlák. Random Sampling with Removal. Discrete & Computational Geometry, 64 (2020), 700-733.
• B. Gärtner, A. N. Zehmakan. Threshold Behavior of Democratic Opinion Dynamics. Journal of Statistical Physics, 178 (2020), 1442-1466.
• B. Geissmann, S. Leucci, C.-H. Liu, P. Penna. Optimal dislocation with persistent errors in subquadratic time. Theory of Computing Systems, 2019, to appear.
• L. Hartung, H. Hoang, T. Mütze, A. Williams. Combinatorial Generation via Permutation Languages: I. Fundamentals (arXiv). Transactions of the American Mathematical Society, 2020, to appear.
• H. Hoang, T. Mütze. Combinatorial Generation via Permutation Languages: II. Lattice congruences (arXiv). Israel Journal of Mathematics, 2020, to appear.
• A. Kupavskii, E. Welzl. Lower Bounds for Searching Robots, some Faulty. Distributed Computing, 2019, to appear.
• C.-H. Liu. A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon. Algorithmica, 2019, to appear.
• T. Mütze, J. Nummenpalo. A Constant-Time Algorithm for Middle Levels Gray Codes. Algorithmica, 82 (2020), 1239-1258.
• A. N. Zehmakan. Opinion Forming in Erdős–Rényi Random Graph and Expanders. Discrete Applied Mathematics, 2019, to appear.
• A. Pilz, E. Welzl, M. Wettstein. From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. Discrete & Computational Geometry, 64(2020), 1067-1097.
• P. Schnider. Ham-Sandwich Cuts and Center Transversals in Subspaces. Discrete & Computational Geometry, 2020, to appear.

Conference Proceedings (with selection process)

• O. Aichholzer, M. Hoffmann, J. Obenaus, R. Paul, D. Perz, N. Seiferth, B. Vogtenhuber, A. Weinberger. Plane Spanning Trees in Edge-Colored Simple Drawings of K_n. 28th International Symposium on Graph Drawing & Network Visualization (GD 2020), to appear.
• D. Bertschinger, J. Lengler, A. Martinsson, R. Meier, A. Steger, M. Trujić, E. Welzl. An Optimal Decentralized (Δ+1)-Coloring Algorithm. 28th Annual European Symposium on Algorithms (ESA 2020), LIPIcs 173, 17:1-17:12.
• E. Bonnet, N. Grelier, T. Miltzow. Maximum Clique in Disk-Like Intersection Graphs. 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), to appear.
• S. Cornelsen, M. Pfister, H. Förster, M. Gronemann, M. Hoffmann, S. Kobourov, T. Schneck. Drawing Shortest Paths in Geodetic Graphs. 28th International Symposium on Graph Drawing & Network Visualization (GD 2020), to appear.
• S. Felsner, M. Hoffmann, K. Knorr, I. Parada. On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens. 28th International Symposium on Graph Drawing & Network Visualization (GD 2020), to appear.
• F. Frati, M. Hoffmann, C. D. Tóth. Universal Geometric Graphs. 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020), to appear.
• N. Grelier. Computing a maximum clique in geometric superclasses of disk graphs. 26th International Computing and Combinatorics Conference (COCOON 2020), LNCS 12273, 299-310.
• X. Goaoc, E. Welzl. Convex hulls of random order types. 36th International Symposium on Computational Geometry (SOCG 2020), LIPIcs 164, 67:1-67:16.
• L. Hartung, H. Hoang, T. Mütze, A. Williams. Combinatorial Generation via Permutation Languages. 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), 1214-1225.
• M. Hoffmann, C.-H. Liu, M. M. Reddy, C. D. Tóth. Simple Topological Drawings of k-Planar Graphs. 28th International Symposium on Graph Drawing & Network Visualization (GD 2020), to appear.
• C.-H. Liu. Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions. 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), 2842-2859.
• E. Taylor, P. K. Agarwal, K. Munagala, E. Welzl, and H.-C. Chang. Clustering under Perturbation Stability in Near-Linear Time. 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), to appear.
• U. Wagner, E. Welzl. Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips). 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), 2823-2841.
• U. Wagner, E. Welzl. Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips). 36th International Symposium on Computational Geometry (SOCG 2020), LIPIcs 164, 67:1-67:16.

Other

• D. Bertschinger, P. Schnider. Weighted Epsilon-Nets. 36th European Workshop on Computational Geometry (EuroCG 2020), 21:1-21:6.
• S. Cabello, A. Choudhary, M. Hoffmann, K. Klost, M. M. Reddy, W. Mulzer, F. Schröder, J. Tkadlec. A better approximation for longest noncrossing spanning trees. 36th European Workshop on Computational Geometry (EuroCG 2020), 77:1-77:8.
• S. Chaplick, H. Förster, M. Hoffmann, M. Kaufmann. Monotone Arc Diagrams with few Biarcs. 36th European Workshop on Computational Geometry (EuroCG 2020), 46:1-46:7.
• M.-K. Chiu, S. Felsner, M. Scheucher, P. Schnider, R. Steiner, P. Valtr. On the Average Complexity of the k-Level. 36th European Workshop on Computational Geometry (EuroCG 2020), 11:1-11:7.
• J. Dallant, P. Schnider. Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-theorem. 36th European Workshop on Computational Geometry (EuroCG 2020), 27:1-27:6.
• K. Fukuda. Introduction to Optimization. Educational Material. ETH Zürich. 2020.
• K. Fukuda. Polyhedral Computation. Educational Material. ETH Zürich. 2020.
• N. Grelier. Minimum Convex Partition of Degenerate Point Sets is NP-Hard. 36th European Workshop on Computational Geometry (EuroCG 2020), 57:1-57:8.
• H. Hiraishi, D. Mao, P. Schnider. Finding an Induced Subtree in an Intersection Graph is often hard. 36th European Workshop on Computational Geometry (EuroCG 2020), 41:1-41:7.
• C.-H. Liu, C. D. Tóth, M. M. Reddy. Simple Topological Drawings of k-Planar Graphs. 36th European Workshop on Computational Geometry (EuroCG 2020), 80:1-80:6.

Submitted

• S. Felsner, A. Pilz, P. Schnider. Arrangements of Approaching Pseudo-lines (arXiv). Submitted (2020).
• Yuan Gao, B. Gärtner, Jourdain Lamperski. A New Combinatorial Property of Geometric Unique Sink Orientations (arXiv). Submitted (2020).
• X. Goaoc, E. Welzl. Convex hulls of random order types (arXiv). Submitted (2020).
• B. Gärtner, A. N. Zehmakan. (Biased) Majority Rule Cellular Automata (arXiv). Submitted (2017).
• N. Grelier. On the similarity of computing a maximum clique on (d-1)-ball and unit d-ball graphs. Submitted (2019).
• N. Grelier, S. Ilchi, T. Miltzow, S. Smorodinsky. On the VC-dimension of convex sets and half-spaces (arXiv). Submitted (2019).
• A. N. Zehmakan, S. Galam. Fake News and Rumors: a Trigger for Proliferation or Fading Away (arXiv). Submitted (2019).
• A. Pilz, P. Schnider. Bisecting three classes of lines (arXiv). Submitted (2019).
• P. Schnider. Equipartitions with Wedges and Cones (arXiv). Submitted (2019).
• U. Wagner, E. Welzl. Connectivity of Triangulation Flip Graphs in the Plane (arXiv). Submitted (2020).