Books

• P. Adamaszek, B. Gärtner, I. Meili, J. Müllener, J. Spühler. Schau genau - schau, wie schlau! Sprache und Technik Hand in Hand, 2nd (Online) Edition (2019). (1st Edition)

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, 2019, to appear.
• L. Barba, J. Cardinal, J. Iacono, S. Langerman, A. Ooms, N. Solomon. Subquadratic Algorithms for Algebraic Generalizations of 3-SUM. Discrete & Computational Geometry, 61:4 (2019), 698-734.
• L. Barba, J. Cardinal, M. Korman, S. Langerman, A. van Renssen, M. Roeloffzen. Dynamic Graph Coloring. Algorithmica, 81:4 (2019), 1319-1341.
• L. Barba, M. Milatz, J. Nummenpalo, Sun X., A. Thomas, Zhang J., Zhang Zh. The Complexity of Optimization on Grids. Algorithmica, to appear.
• C. Bohler, R. Klein, C.-H. Liu. An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. Algorithmica, 81:6 (2019), 2317-2345.
• F. Frati, M. Hoffmann, V. Kusters. Simultaneous Embeddings with Few Bends and Crossings. Journal of Graph Algorithms and Applications, 2019, to appear.
• A. Kupavskii, E. Welzl. Lower Bounds for Searching Robots, some Faulty. Distributed Computing (2019), to appear.
• A. N. Zehmakan, C. Jeger. Dynamic Monopolies in Two-way Bootstrap Percolation. Discrete Applied Mathematics, to appear.

Conference Proceedings (with selection process)

• O. Aichholzer, M. Balko, M. Hoffmann, J. Kynčll, W. Mulzer, I. Parada, A. Pilz, M. Scheucher, P. Valtr, B. Vogtenhuber, E. Welzl. Minimal Representations of Order Types by Geometric Graphs. 27th International Symposium on Graph Drawing & Network Visualization (GD 2019), 2019, to appear.
• P. Angelini, H. Förster, M. Hoffmann, M. Kaufmann, S. Kobourov, G. Liotta, M. Patrignani. The QuaSEFE Problem. 27th International Symposium on Graph Drawing & Network Visualization (GD 2019), 2019, to appear.
• L. Barba. Geodesic farthest-point Voronoi diagram in linear time. 35th International Symposium on Computational Geometry (SOCG 2019), LIPIcs 129, 12:1 - 12:14.
• L. Barba, W. Mulzer. Asymmetric Convex Intersection Testing. Symposium on Simplicity in Algorithms (SOSA 2019), OASIcs 69, 9:1--9:14.
• R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner. The Crossing Tverberg Theorem. 35th International Symposium on Computational Geometry (SOCG 2019), LIPIcs 129, 38:1 - 38:13.
• B. Geissmann, S. Leucci, C.-H. Liu, P. Penna. Optimal Sorting with Persistent Comparison Errors. 27th Annual European Symposium on Algorithms (ESA 2019), to appear
• N. Grelier, R. de Joannis de Verclos, R. J. Kang, F. Pirot. Approximate strong edge-colouring of unit disk graphs. 17th Workshop on Approximation and Online Algorithms (WAOA 2019), to appear.
• M. Hoffmann, B. Klemz. Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian. 27th Annual European Symposium on Algorithms (ESA 2019), to appear
• S. Leucci, C.-H. Liu, S. Meierhans. Resilient Dictionaries for Randomly Unreliable Memory. 27th Annual European Symposium on Algorithms (ESA 2019), to appear
• A. N. Zehmakan. Target Set in Threshold Models. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2019), to appear.
• A. N. Zehmakan. Tight Bounds on the Minimum Size of a Dynamic Monopoly. 13th International Conference on Language and Automata Theory and Applications (LATA 2019), to appear.
• A. N. Zehmakan, J. Nummenpalo, A. Pilz, D. Wolleb-Graf. Switches in Eulerian graphs. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2019), to appear.
• P. Schnider. Ham-Sandwich cuts and center transversals in subspaces. 35th International Symposium on Computational Geometry (SOCG 2019), LIPIcs 129, 56:1 - 56:15.

Other

• L. Barba, S. Lochau, A. Pilz, P. Schnider. Simplicial depth for multiple query points. 35th European Workshop on Computational Geometry (EuroCG 2019), 29.
• N. Grelier, R. de Joannis de Verclos, R. J. Kang, F. Pirot. Approximate strong edge-colouring of unit disk graphs.. 35th European Workshop on Computational Geometry (EuroCG 2019), 46.
• M. Hoffmann, M. Milatz, Y. Okamoto, M. Wettstein. An Improved Searching Algorithm on a Line by Four Truthful Robots and Two Byzantine Robots. 22nd Japan Conf. Discrete Comput. Geom. Graphs (JCDCG3 2019), 69–70.
• M. Hoffmann, J. Pach, M. Stojaković. Green-Wins Solitaire Revisited: Simultaneous Flips that Affect Many Edges. 35th European Workshop on Computational Geometry (EuroCG 2019), 9.

Submitted

• C. Annamalai. Lazy Local Search Meets Machine Scheduling. Submitted (2016).
• K. L. Clarkson, B. Gärtner, J. Lengler, M. Szedlak. Random Sampling with Removal (arXiv). Submitted (2019).
• B. Gärtner, A. N. Zehmakan. (Biased) Majority Rule Cellular Automata. Submitted (2017).
• B. Gärtner, A. N. Zehmakan. Phase Transition in Democratic Opinion Dynamics Submitted (2019).
• 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).
• L. Hartung, H. Hoang, T. Mütze, A. Williams. Combinatorial Generation via Permutation Languages. Submitted (2019).
• A. N. Zehmakan. Two Phase Transitions in Two-way Bootstrap Percolation. Submitted (2018).
• A. N. Zehmakan, S. Galam. Fake News and Rumors: a Trigger for Proliferation or Fading Away. Submitted (2019).
• A. Pilz, P. Schnider. Bisecting three classes of lines. Submitted (2019).