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

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 002; Klaus Kriegel; Subhash Suri; Kevin Verbeek; Max Willert (Comput. Geom., 2018)

Compact Routing in Unit Disk Graphs. - Wolfgang Mulzer; Max Willert (ISAAC, 2020)

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

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)

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

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 and Stabbing. - Max Willert (2021)

The Two-Squirrel Problem and Its Relatives. - Sergey Bereg; Yuya Higashikawa; Naoki Katoh; László Kozma 002; Manuel Lafond; Günter Rote; Yuki Tokuni; Max Willert; Binhai Zhu (JCDCGGG, 2022)