The Two-Squirrel Problem and Its Relatives - Sergey Bereg; Yuya Higashikawa; Naoki Katoh; László Kozma; Manuel Lafond; Günter Rote; Yuki Tokuni; Max Willert; Binhai Zhu (Discrete and Computational Geometry, Graphs, and Games - 24th Japanese Conference, JCDCGGG 2022, Virtual Event, September 9-11, 2022, Revised Selected Papers, 2022)

Routing and Stabbing - Max Willert (Free University of Berlin, Germany, 2021)

Stabbing pairwise intersecting disks by five points - Sariel Har-Peled; Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth; Micha Sharir; Max Willert (Discret. Math., 2021)

Routing in polygonal domains - Bahareh Banyassady; Man-Kwun Chiu; Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Paul Seiferth; Yannik Stein; Birgit Vogtenhuber; Max Willert (Comput. Geom., 2020)

Compact Routing in Unit Disk Graphs - Wolfgang Mulzer; Max Willert (31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference), 2020)

Routing in Histograms - Man-Kwun Chiu; Jonas Cleve; Katharina Klost; Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Max Willert (WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020, Singapore, March 31 - April 2, 2020, Proceedings, 2020)

Routing in Unit Disk Graphs without Dynamic Headers - Wolfgang Mulzer; Max Willert (CoRR, 2020)

Routing in Histograms - Man-Kwun Chiu; Jonas Cleve; Katharina Klost; Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Max Willert (CoRR, 2019)

Tight bounds for conflict-free chromatic guarding of orthogonal art galleries - Frank Hoffmann; Klaus Kriegel; Subhash Suri; Kevin Verbeek; Max Willert (Comput. Geom., 2018)

Stabbing Pairwise Intersecting Disks by Five Points - Sariel Har-Peled; Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth; Micha Sharir; Max Willert (29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, 2018)

Stabbing pairwise intersecting disks by five points - Sariel Har-Peled; Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth; Micha Sharir; Max Willert (CoRR, 2018)

Routing in Polygonal Domains - Bahareh Banyassady; Man-Kwun Chiu; Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Paul Seiferth; Yannik Stein; Birgit Vogtenhuber; Max Willert (28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand, 2017)

Routing in Polygons with Holes - Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Paul Seiferth; Yannik Stein; Birgit Vogtenhuber; Max Willert (CoRR, 2017)

Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries - Frank Hoffmann; Klaus Kriegel; Subhash Suri; Kevin Verbeek; Max Willert (31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands, 2015)

Almost Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Galleries - Frank Hoffmann; Klaus Kriegel; Max Willert (CoRR, 2014)