Sharing a Pizza: Bisecting Masses with Two Cuts. - Luis Barba; Patrick Schnider (CCCG, 2017)

A generalization of crossing families. - Patrick Schnider (CoRR, 2017)

Extending the Centerpoint Theorem to Multiple Points. - Alexander Pilz; Patrick Schnider (ISAAC, 2018)

Even Flying Cops Should Think Ahead. - Anders Martinsson; Florian Meier 002; Patrick Schnider; Angelika Steger (ISCO, 2018)

The Partition Spanning Forest Problem. - Philipp Kindermann; Boris Klemz; Ignaz Rutter; Patrick Schnider; André Schulz 001 (CoRR, 2018)

Sharing a pizza: bisecting masses with two cuts. - Luis Barba; Alexander Pilz; Patrick Schnider (CoRR, 2019)

Equipartitions with Wedges and Cones. - Patrick Schnider (CoRR, 2019)

Weighted Epsilon-Nets. - Daniel Bertschinger; Patrick Schnider (CoRR, 2020)

Ham-Sandwich Cuts and Center Transversals in Subspaces. - Patrick Schnider (Discret. Comput. Geom., 2020)

On the Average Complexity of the k-Level. - Raphael Steiner; Manfred Scheucher; Stefan Felsner; Pavel Valtr 001; Man-Kwun Chiu; Patrick Schnider (J. Comput. Geom., 2020)

Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem. - Justin Dallant; Patrick Schnider (CCCG, 2021)

Bisecting three classes of lines. - Alexander Pilz; Patrick Schnider (Comput. Geom., 2021)

Edge Partitions of Complete Geometric Graphs (Part 2). - Oswin Aichholzer; Johannes Obenaus; Joachim Orthaber; Rosna Paul; Patrick Schnider; Raphael Steiner; Tim Taubner; Birgit Vogtenhuber (CoRR, 2021)

Edge Partitions of Complete Geometric Graphs. - Oswin Aichholzer; Johannes Obenaus; Joachim Orthaber; Rosna Paul; Patrick Schnider; Raphael Steiner; Tim Taubner; Birgit Vogtenhuber (SoCG, 2022)

Tukey Depth Histograms. - Daniel Bertschinger; Jonas Passweg; Patrick Schnider (IWOCA, 2022)

Well-Separation and Hyperplane Transversals in High Dimensions. - Helena Bergold; Daniel Bertschinger; Nicolas Grelier; Wolfgang Mulzer; Patrick Schnider (SWAT, 2022)

Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem. - Justin Dallant; Patrick Schnider (Comput. Geom. Topol., 2022)

The Complexity of Sharing a Pizza. - Patrick Schnider (Comput. Geom. Topol., 2022)

Arrangements of Approaching Pseudo-Lines. - Stefan Felsner; Alexander Pilz; Patrick Schnider (Discret. Comput. Geom., 2022)

Combinatorial Depth Measures for Hyperplane Arrangements. - Patrick Schnider; Pablo Soberón (SoCG, 2023)

An FPT Algorithm for Splitting a Necklace Among Two Thieves. - Michaela Borzechowski; Patrick Schnider; Simon Weber 001 (ISAAC, 2023)

Enclosing Depth and Other Depth Measures. - Patrick Schnider (Comb., 2023)

A Topological Version of Schaefer's Dichotomy Theorem. - Patrick Schnider; Simon Weber 001 (SoCG, 2024)

Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. - Michaela Borzechowski; John Fearnley; Spencer Gordon; Rahul Savani; Patrick Schnider; Simon Weber 001 (ICALP, 2024)

On the Complexity of Recognizing Nerves of Convex Sets. - Patrick Schnider; Simon Weber 001 (Comput. Geom. Topol., 2024)

Computing Enclosing Depth. - Bernd Gärtner; Fatime Rasiti; Patrick Schnider (CoRR, 2024)

Barking dogs: A Fréchet distance variant for detour detection. - Ivor van der Hoog; Fabian Klute; Irene Parada; Patrick Schnider (CoRR, 2024)

AuToMATo: A Parameter-Free Persistence-Based Clustering Algorithm. - Marius Huber; Sara Kalisnik; Patrick Schnider (CoRR, 2024)

On connectivity in random graph models with limited dependencies. - Johannes Lengler; Anders Martinsson; Kalina Petrova; Patrick Schnider; Raphael Steiner; Simon Weber 001; Emo Welzl (Random Struct. Algorithms, 2024)

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

Topological Art in Simple Galleries. - Daniel Bertschinger; Nicolas El Maalouly; Tillmann Miltzow; Patrick Schnider; Simon Weber 001 (Discret. Comput. Geom., 2024)

Unfairly Splitting Separable Necklaces. - Patrick Schnider; Linus Stalder; Simon Weber 001 (STACS, 2025)

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

Connected matchings. - Oswin Aichholzer; Sergio Cabello; Viola Mészáros; Patrick Schnider; Jan Soukup (Comput. Geom., 2025)

Decomposition of geometric graphs into star-forests. - János Pach; Morteza Saghafian; Patrick Schnider (Comput. Geom., 2025)

Bounds for k-centers of point sets under L∞-bottleneck distance. - Mats Bierwirth; Julia Hütte; Patrick Schnider; Bettina Speckmann (CoRR, 2025)

Chasing puppies on orthogonal straight-line plane graphs. - Johanna Ockenfels; Yoshio Okamoto; Patrick Schnider (CoRR, 2025)

Query-Efficient Fixpoints of ℓp-Contractions. - Sebastian Haslebacher; Jonas Lill; Patrick Schnider; Simon Weber 001 (CoRR, 2025)