Plane Spanning Trees in Edge-Colored Simple Drawings of Kn. - Oswin Aichholzer; Michael Hoffmann 001; Johannes Obenaus; Rosna Paul; Daniel Perz; Nadja Seiferth; Birgit Vogtenhuber; Alexandra Weinberger (GD, 2020)

Empty Rainbow Triangles in k-colored Point Sets. - Ruy Fabila Monroy; Daniel Perz; Ana Laura Trujillo-Negrete (CoRR, 2020)

Empty rainbow triangles in k-colored point sets. - Ruy Fabila Monroy; Daniel Perz; Ana Laura Trujillo-Negrete (Comput. Geom., 2021)

Nearest-Neighbor Decompositions of Drawings. - Jonas Cleve; Nicolas Grelier; Kristin Knorr; Maarten Löffler; Wolfgang Mulzer; Daniel Perz (SWAT, 2022)

Disjoint Compatibility via Graph Classes. - Oswin Aichholzer; Julia Obmann; Pavel Paták; Daniel Perz; Josef Tkadlec; Birgit Vogtenhuber (WG, 2022)

Finding a Battleship of Uncertain Shape. - Eva-Maria Hainzl; Maarten Löffler; Daniel Perz; Josef Tkadlec; Markus Wallinger (CoRR, 2022)

No Selection Lemma for Empty Triangles. - Ruy Fabila Monroy; Carlos Hidalgo-Toscano; Daniel Perz; Birgit Vogtenhuber (CoRR, 2022)

On Compatible Matchings. - Oswin Aichholzer; Alan Arroyo; Zuzana Masárová; Irene Parada; Daniel Perz; Alexander Pilz; Josef Tkadlec; Birgit Vogtenhuber (J. Graph Algorithms Appl., 2022)

Graphs with large total angular resolution. - Oswin Aichholzer; Matias Korman; Yoshio Okamoto; Irene Parada; Daniel Perz; André van Renssen; Birgit Vogtenhuber (Theor. Comput. Sci., 2023)

Perfect Matchings with Crossings. - Oswin Aichholzer; Ruy Fabila Monroy; Philipp Kindermann; Irene Parada; Rosna Paul; Daniel Perz; Patrick Schnider; Birgit Vogtenhuber (Algorithmica, 2024)

Flips in odd matchings. - Oswin Aichholzer; Anna Brötzner; Daniel Perz; Patrick Schnider (Comput. Geom., 2025)

Minimum spanning blob-trees. - Katharina Klost; Marc J. van Kreveld; Daniel Perz; Günter Rote; Josef Tkadlec (CoRR, 2025)

Flipping Matchings is Hard. - Carla Binucci; Fabrizio Montecchiani; Daniel Perz; Alessandra Tappini (CoRR, 2025)