Patrick Schnider

Linus Stalder

CoRR, 2024

AuToMATo: A Parameter-Free Persistence-Based Clustering Algorithm.

[BibT_eX]

[DOI]

Marius Huber

Sara Kalisnik

CoRR, 2024

Connected Matchings.

[BibT_eX]

[DOI]

CoRR, 2024

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

[BibT_eX]

[DOI]

CoRR, 2024

Computing Enclosing Depth.

[BibT_eX]

[DOI]

Bernd Gärtner

Fatime Rasiti

CoRR, 2024

On the Complexity of Recognizing Nerves of Convex Sets.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2024

Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents.

[BibT_eX]

[DOI]

Michaela Borzechowski

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

A Topological Version of Schaefer's Dichotomy Theorem.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Enclosing Depth and Other Depth Measures.

[BibT_eX]

[DOI]

Comb., October, 2023

An FPT Algorithm for Splitting a Necklace Among Two Thieves.

[BibT_eX]

[DOI]

Michaela Borzechowski

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Decomposition of Geometric Graphs into Star-Forests.

[BibT_eX]

[DOI]

János Pach

Morteza Saghafian

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Combinatorial Depth Measures for Hyperplane Arrangements.

[BibT_eX]

[DOI]

Pablo Soberón

Proceedings of the 39th International Symposium on Computational Geometry, 2023

On Connectivity in Random Graph Models with Limited Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2023

2022

Arrangements of Approaching Pseudo-Lines.

[BibT_eX]

[DOI]

Stefan Felsner

Discret. Comput. Geom., 2022

The Complexity of Sharing a Pizza.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2022

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

[BibT_eX]

[DOI]

Justin Dallant

Comput. Geom. Topol., 2022

Well-Separation and Hyperplane Transversals in High Dimensions.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Tukey Depth Histograms.

[BibT_eX]

[DOI]

Daniel Bertschinger

Jonas Passweg

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Edge Partitions of Complete Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Edge Partitions of Complete Geometric Graphs (Part 2).

[BibT_eX]

[DOI]

CoRR, 2021

Bisecting three classes of lines.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem.

[BibT_eX]

Justin Dallant

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

On the Average Complexity of the k-Level.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Ham-Sandwich Cuts and Center Transversals in Subspaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Weighted Epsilon-Nets.

[BibT_eX]

[DOI]

Daniel Bertschinger

CoRR, 2020

2019

Equipartitions with Wedges and Cones.

[BibT_eX]

[DOI]

CoRR, 2019

Sharing a pizza: bisecting masses with two cuts.

[BibT_eX]

[DOI]

Luis Barba

CoRR, 2019

2018

The Partition Spanning Forest Problem.

[BibT_eX]

[DOI]

CoRR, 2018

Even Flying Cops Should Think Ahead.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Extending the Centerpoint Theorem to Multiple Points.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

A generalization of crossing families.

[BibT_eX]

[DOI]

CoRR, 2017

Sharing a Pizza: Bisecting Masses with Two Cuts.

[BibT_eX]

Luis Barba