default search action
Patrick Schnider
Person information
- affiliation: University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Oswin Aichholzer
, Ruy Fabila Monroy
Perfect Matchings with Crossings. Algorithmica 86(3): 697-716 (2024) - [j9]Patrick Schnider, Simon Weber:
On the Complexity of Recognizing Nerves of Convex Sets. Comput. Geom. Topol. 3(2): 2:1-2:8 (2024) - [j8]Daniel Bertschinger, Nicolas El Maalouly
Topological Art in Simple Galleries. Discret. Comput. Geom. 71(3): 1092-1130 (2024) - [c18]Patrick Schnider, Simon Weber
A Topological Version of Schaefer's Dichotomy Theorem. SoCG 2024: 77:1-77:16 - [c17]Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani
Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. ICALP 2024: 32:1-32:18 - [i30]Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani
Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents. CoRR abs/2402.07683 (2024) - [i29]Bernd Gärtner, Fatime Rasiti, Patrick Schnider:
Computing Enclosing Depth. CoRR abs/2402.12371 (2024) - [i28]Ivor van der Hoog, Fabian Klute, Irene Parada, Patrick Schnider:
Barking dogs: A Fréchet distance variant for detour detection. CoRR abs/2402.13159 (2024) - [i27]Oswin Aichholzer, Sergio Cabello, Viola Mészáros, Patrick Schnider, Jan Soukup:
Connected Matchings. CoRR abs/2407.06131 (2024) - [i26]Marius Huber, Sara Kalisnik, Patrick Schnider:
AuToMATo: A Parameter-Free Persistence-Based Clustering Algorithm. CoRR abs/2408.06958 (2024) - [i25]Patrick Schnider, Linus Stalder, Simon Weber:
Unfairly Splitting Separable Necklaces. CoRR abs/2408.17126 (2024) - [i24]Oswin Aichholzer, Anna Brötzner, Daniel Perz, Patrick Schnider:
Flips in Odd Matchings. CoRR abs/2410.06139 (2024) - 2023
- [j7]Patrick Schnider
Enclosing Depth and Other Depth Measures. Comb. 43(5): 1007-1029 (2023) - [c16]Johannes Lengler
On Connectivity in Random Graph Models with Limited Dependencies. APPROX/RANDOM 2023: 30:1-30:22 - [c15]Patrick Schnider
Combinatorial Depth Measures for Hyperplane Arrangements. SoCG 2023: 55:1-55:14 - [c14]János Pach
Decomposition of Geometric Graphs into Star-Forests. GD (1) 2023: 339-346 - [c13]Michaela Borzechowski, Patrick Schnider
An FPT Algorithm for Splitting a Necklace Among Two Thieves. ISAAC 2023: 15:1-15:14 - [i23]Patrick Schnider, Pablo Soberón:
Combinatorial Depth Measures for Hyperplane Arrangements. CoRR abs/2302.07768 (2023) - [i22]Patrick Schnider, Simon Weber
On the Complexity of Recognizing Nerves of Convex Sets. CoRR abs/2302.13276 (2023) - [i21]János Pach, Morteza Saghafian
Decomposition of Geometric Graphs into Star Forests. CoRR abs/2306.13201 (2023) - [i20]Michaela Borzechowski, Patrick Schnider, Simon Weber
An FPT Algorithm for Splitting a Necklace Among Two Thieves. CoRR abs/2306.14508 (2023) - [i19]Patrick Schnider, Simon Weber
A Topological Version of Schaefer's Dichotomy Theorem. CoRR abs/2307.03446 (2023) - 2022
- [j6]Patrick Schnider:
The Complexity of Sharing a Pizza. Comput. Geom. Topol. 1(1): 4:1-4:19 (2022) - [j5]Justin Dallant, Patrick Schnider:
Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem. Comput. Geom. Topol. 1(1): 5:1-5:27 (2022) - [j4]Stefan Felsner, Alexander Pilz, Patrick Schnider
Arrangements of Approaching Pseudo-Lines. Discret. Comput. Geom. 67(2): 380-402 (2022) - [c12]Oswin Aichholzer
Edge Partitions of Complete Geometric Graphs. SoCG 2022: 6:1-6:16 - [c11]Oswin Aichholzer
Perfect Matchings with Crossings. IWOCA 2022: 46-59 - [c10]Daniel Bertschinger, Jonas Passweg, Patrick Schnider
Tukey Depth Histograms. IWOCA 2022: 186-198 - [c9]Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider
Topological Art in Simple Galleries. SOSA 2022: 87-116 - [c8]Helena Bergold
Well-Separation and Hyperplane Transversals in High Dimensions. SWAT 2022: 16:1-16:14 - [i18]Helena Bergold, Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer, Patrick Schnider:
Well-Separation and Hyperplane Transversals in High Dimensions. CoRR abs/2209.02319 (2022) - 2021
- [j3]Alexander Pilz, Patrick Schnider
Bisecting three classes of lines. Comput. Geom. 98: 101775 (2021) - [c7]Justin Dallant, Patrick Schnider:
Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem. CCCG 2021: 157-166 - [c6]Patrick Schnider
Enclosing Depth and Other Depth Measures. ISAAC 2021: 10:1-10:15 - [c5]Patrick Schnider
The Complexity of Sharing a Pizza. ISAAC 2021: 13:1-13:15 - [i17]Patrick Schnider:
Enclosing Depth and other Depth Measures. CoRR abs/2103.08421 (2021) - [i16]Daniel Bertschinger, Jonas Passweg, Patrick Schnider:
Tukey Depth Histograms. CoRR abs/2103.08665 (2021) - [i15]Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber
Topological Art in Simple Galleries. CoRR abs/2108.04007 (2021) - [i14]Patrick Schnider:
The complexity of sharing a pizza. CoRR abs/2109.06752 (2021) - [i13]Oswin Aichholzer
Edge Partitions of Complete Geometric Graphs (Part 2). CoRR abs/2112.08456 (2021) - 2020
- [j2]Patrick Schnider:
Ham-Sandwich Cuts and Center Transversals in Subspaces. Discret. Comput. Geom. 64(4): 1192-1209 (2020) - [j1]Raphael Steiner
On the Average Complexity of the k-Level. J. Comput. Geom. 11(1): 493-506 (2020) - [i12]Stefan Felsner, Alexander Pilz, Patrick Schnider:
Arrangements of Approaching Pseudo-Lines. CoRR abs/2001.08419 (2020) - [i11]Justin Dallant, Patrick Schnider:
Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner (p, q)-theorem. CoRR abs/2002.06947 (2020) - [i10]Daniel Bertschinger, Patrick Schnider:
Weighted Epsilon-Nets. CoRR abs/2002.08693 (2020)
2010 – 2019
- 2019
- [c4]Patrick Schnider
Ham-Sandwich Cuts and Center Transversals in Subspaces. SoCG 2019: 56:1-56:15 - [i9]Patrick Schnider:
Ham-Sandwich cuts and center transversals in subspaces. CoRR abs/1903.12516 (2019) - [i8]Luis Barba, Alexander Pilz, Patrick Schnider
Sharing a pizza: bisecting masses with two cuts. CoRR abs/1904.02502 (2019) - [i7]Alexander Pilz, Patrick Schnider:
Bisecting three classes of lines. CoRR abs/1909.04419 (2019) - [i6]Patrick Schnider:
Equipartitions with Wedges and Cones. CoRR abs/1910.13352 (2019) - [i5]Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Patrick Schnider, Raphael Steiner, Pavel Valtr:
On the Average Complexity of the k-Level. CoRR abs/1911.02408 (2019) - 2018
- [c3]Alexander Pilz, Patrick Schnider
Extending the Centerpoint Theorem to Multiple Points. ISAAC 2018: 53:1-53:13 - [c2]Anders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger:
Even Flying Cops Should Think Ahead. ISCO 2018: 326-337 - [i4]Anders Martinsson, Florian Meier, Patrick Schnider
Even flying cops should think ahead. CoRR abs/1801.07193 (2018) - [i3]Philipp Kindermann, Boris Klemz, Ignaz Rutter, Patrick Schnider
The Partition Spanning Forest Problem. CoRR abs/1809.02710 (2018) - [i2]Alexander Pilz, Patrick Schnider:
Extending the centerpoint theorem to multiple points. CoRR abs/1810.10231 (2018) - 2017
- [c1]Luis Barba, Patrick Schnider:
Sharing a Pizza: Bisecting Masses with Two Cuts. CCCG 2017: 174-178 - [i1]Patrick Schnider
A generalization of crossing families. CoRR abs/1702.07555 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-19 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: