Patrick Schnider

Orcid: 0000-0002-2172-9285

Affiliations:
  • University of Copenhagen, Denmark


According to our database1, Patrick Schnider authored at least 31 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Topological Art in Simple Galleries.
Discret. Comput. Geom., April, 2024

Perfect Matchings with Crossings.
Algorithmica, March, 2024

Barking dogs: A Fréchet distance variant for detour detection.
CoRR, 2024

Computing Enclosing Depth.
CoRR, 2024

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents.
CoRR, 2024

On the Complexity of Recognizing Nerves of Convex Sets.
Comput. Geom. Topol., 2024

2023
Enclosing Depth and Other Depth Measures.
Comb., October, 2023

A Topological Version of Schaefer's Dichotomy Theorem.
CoRR, 2023

An FPT Algorithm for Splitting a Necklace Among Two Thieves.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Decomposition of Geometric Graphs into Star-Forests.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Combinatorial Depth Measures for Hyperplane Arrangements.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

On Connectivity in Random Graph Models with Limited Dependencies.
Proceedings of the Approximation, 2023

2022
Arrangements of Approaching Pseudo-Lines.
Discret. Comput. Geom., 2022

The Complexity of Sharing a Pizza.
Comput. Geom. Topol., 2022

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

Well-Separation and Hyperplane Transversals in High Dimensions.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Tukey Depth Histograms.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Edge Partitions of Complete Geometric Graphs.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Edge Partitions of Complete Geometric Graphs (Part 2).
CoRR, 2021

Bisecting three classes of lines.
Comput. Geom., 2021

Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020
On the Average Complexity of the k-Level.
J. Comput. Geom., 2020

Ham-Sandwich Cuts and Center Transversals in Subspaces.
Discret. Comput. Geom., 2020

Weighted Epsilon-Nets.
CoRR, 2020

2019
Equipartitions with Wedges and Cones.
CoRR, 2019

Sharing a pizza: bisecting masses with two cuts.
CoRR, 2019

2018
The Partition Spanning Forest Problem.
CoRR, 2018

Even Flying Cops Should Think Ahead.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Extending the Centerpoint Theorem to Multiple Points.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
A generalization of crossing families.
CoRR, 2017

Sharing a Pizza: Bisecting Masses with Two Cuts.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017


  Loading...