papers
Publications (13)
cs.CC2017
ARRIVAL: A zero-player graph game in NP $\cap$ coNP
Jérôme Dohrau, Bernd Gärtner, Manuel Kohler +2
cs.DM2011
Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique
Micha Sharir, Adam Sheffer, Emo Welzl
math.CO2020
Minimal Representations of Order Types by Geometric Graphs
Oswin Aichholzer, Martin Balko, Michael Hoffmann +8
cs.CG2020
Connectivity of Triangulation Flip Graphs in the Plane
Uli Wagner, Emo Welzl
cs.CG2022
Convex Hulls of Random Order Types
Xavier Goaoc, Emo Welzl
cs.DM2017
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
cs.CG2017
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs
Oswin Aichholzer, Thomas Hackl, Matias Korman +5
cs.DM2011
Counting Plane Graphs: Flippability and its Applications
Michael Hoffmann, Micha Sharir, Adam Sheffer +2
cs.RO2018
Lower Bounds for Searching Robots, some Faulty
Andrey Kupavskii, Emo Welzl
cs.DS2020
Clustering under Perturbation Stability in Near-Linear Time
Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala +2
cs.DS2021
An Optimal Decentralized $(Î+ 1)$-Coloring Algorithm
Daniel Bertschinger, Johannes Lengler, Anders Martinsson +4
math.CO2023
On Connectivity in Random Graph Models with Limited Dependencies
Johannes Lengler, Anders Martinsson, Kalina Petrova +4
cs.CG2019
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices
Alexander Pilz, Emo Welzl, Manuel Wettstein