PS
Patrick Schnider
cs.CGmath.COmath.ATcs.CCcs.DScs.LGOrder typesCombinatorial geometryCrossingscs.CL
On Valency
published · living versionsW_983zzjxq·v1 · currentpublished
Preprints & journals
42 papers in the corpus · 2017–2026Bowties and Hourglasses: Intersections of Double-Wedges (or Stabbing and Avoiding Line Segments)2604.23330v1 · Daniel Bertschinger, Henry Forster, Fabian Klute et al.2026 · 0 citationsarXiv
Garment numbers of bi-colored point sets in the plane2603.05339v1 · Oswin Aichholzer, Helena Bergold, Simon D. Fink et al.2026 · 0 citationsarXiv
Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements2602.10795v1 · Michaela Borzechowski, Sebastian Haslebacher, Hung P. Hoang et al.2026 · 0 citationsarXiv
LEAP: Local ECT-Based Learnable Positional Encodings for Graphs2510.00757v3 · Juan Amboage, Ernst Roell, Patrick Schnider et al.2025 · 0 citationsarXiv
IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generation2509.26076v2 · Johannes Schmitt, Gergely B'erczi, Jasper Dekoninck et al.2025 · 0 citationsarXiv
Flagifying the Dowker Complex2508.08025v2 · Marius Huber, Patrick Schnider2025 · 0 citationsarXiv
Query-Efficient Fixpoints of -Contractions2503.16089v3 · Sebastian Haslebacher, Jonas Lill, Patrick Schnider et al.2025 · 0 citationsTheoretiCS, Volume 5 (2026), Article 17, 1-36
Chasing puppies on orthogonal straight-line plane graphs2503.05216v1 · Johanna Ockenfels, Yoshio Okamoto, Patrick Schnider2025 · 0 citationsarXiv
Bounds for k-centers of point sets under -bottleneck distance2503.02715v1 · Mats Bierwirth, Julia Hutte, Patrick Schnider et al.2025 · 0 citationsarXiv
Cookie cutters: Bisections with fixed shapes2502.17176v1 · Patrick Schnider, Pablo Sober'on2025 · 0 citationsarXiv
Flips in Odd Matchings2410.06139v1 · Oswin Aichholzer, Anna Brotzner, Daniel Perz et al.2024 · 0 citationsarXiv
Unfairly Splitting Separable Necklaces2408.17126v1 · Patrick Schnider, Linus Stalder, Simon Weber2024 · 0 citationsarXiv
AuToMATo: An Out-Of-The-Box Persistence-Based Clustering Algorithm2408.06958v3 · Marius Huber, Sara Kalisnik, Patrick Schnider2024 · 0 citationsTMLR (October 2025)
Connected Matchings2407.06131v2 · Oswin Aichholzer, Sergio Cabello, Viola M'esz'aros et al.2024 · 0 citationsarXiv
Barking dogs: A Fréchet distance variant for detour detection2402.13159v1 · Ivor van der Hoog, Fabian Klute, Irene Parada et al.2024 · 0 citationsarXiv
Computing Enclosing Depth2402.12371v1 · Bernd Gartner, Fatime Rasiti, Patrick Schnider2024 · 0 citationsarXiv
Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents2402.07683v2 · Michaela Borzechowski, John Fearnley, Spencer Gordon et al.2024 · 1 citationarXiv
Perfect Matchings with Crossings.38481794 · Aichholzer, Oswin, Fabila-Monroy, Ruy, Kindermann, Philipp et al.2024 · 1 citationAlgorithmica. 2024;86(3):697-716
A Topological Version of Schaefer's Dichotomy Theorem2307.03446v1 · Patrick Schnider, Simon Weber2023 · 2 citationsarXiv
An FPT Algorithm for Splitting a Necklace Among Two Thieves2306.14508v1 · Michaela Borzechowski, Patrick Schnider, Simon Weber2023 · 0 citationsarXiv
Decomposition of Geometric Graphs into Star Forests2306.13201v2 · J'anos Pach, Morteza Saghafian, Patrick Schnider2023 · 2 citationsarXiv
On Connectivity in Random Graph Models with Limited Dependencies2305.02974v2 · Johannes Lengler, Anders Martinsson, Kalina Petrova et al.2023 · 0 citationsarXiv
On the Complexity of Recognizing Nerves of Convex Sets2302.13276v1 · Patrick Schnider, Simon Weber2023 · 0 citationsarXiv
Combinatorial Depth Measures for Hyperplane Arrangements2302.07768v1 · Patrick Schnider, Pablo Sober'on2023 · 0 citationsarXiv
Well-Separation and Hyperplane Transversals in High Dimensions2209.02319v1 · Helena Bergold, Daniel Bertschinger, Nicolas Grelier et al.2022 · 1 citationarXiv
Arrangements of Approaching Pseudo-Lines.35221404 · Felsner, Stefan, Pilz, Alexander, Schnider, Patrick2022 · 0 citationsDiscrete & computational geometry. 2022;67(2):380-402
Edge Partitions of Complete Geometric Graphs (Part 2)2112.08456v1 · Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber et al.2021 · 0 citationsarXiv
The complexity of sharing a pizza2109.06752v1 · Patrick Schnider2021 · 4 citationsarXiv
Topological Art in Simple Galleries2108.04007v2 · Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow et al.2021 · 2 citationsSymposium on Simplicity in Algorithms (2022) 87-116
Enclosing Depth and other Depth Measures2103.08421v2 · Patrick Schnider2021 · 0 citationsarXiv
Tukey Depth Histograms2103.08665v1 · Daniel Bertschinger, Jonas Passweg, Patrick Schnider2021 · 0 citationsarXiv
Weighted Epsilon-Nets2002.08693v1 · Daniel Bertschinger, Patrick Schnider2020 · 0 citationsarXiv
Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner -theorem2002.06947v2 · Justin Dallant, Patrick Schnider2020 · 0 citationsarXiv
On the Average Complexity of the -Level1911.02408v2 · Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher et al.2019 · 3 citationsarXiv
Equipartitions with Wedges and Cones1910.13352v2 · Patrick Schnider2019 · 3 citationsarXiv
Bisecting three classes of lines1909.04419v1 · Alexander Pilz, Patrick Schnider2019 · 3 citationsarXiv
Sharing a pizza: bisecting masses with two cuts1904.02502v1 · Luis Barba, Alexander Pilz, Patrick Schnider2019 · 10 citationsarXiv
Ham-Sandwich cuts and center transversals in subspaces1903.12516v1 · Patrick Schnider2019 · 11 citationsarXiv
Extending the centerpoint theorem to multiple points1810.10231v1 · Alexander Pilz, Patrick Schnider2018 · 1 citationarXiv
The Partition Spanning Forest Problem1809.02710v1 · Philipp Kindermann, Boris Klemz, Ignaz Rutter et al.2018 · 12 citationsarXiv
Even flying cops should think ahead1801.07193v1 · Anders Martinsson, Florian Meier, Patrick Schnider et al.2018 · 0 citationsarXiv
A generalization of crossing families1702.07555v1 · Patrick Schnider2017 · 2 citationsarXiv
Career total: 75 works. 42 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.