The following pages link to Ermo Welzl (Q1262764):
Displaying 15 items.
- (Q194158) (redirect page) (← links)
- (Q223959) (redirect page) (← links)
- On the number of crossing-free partitions (Q359753) (← links)
- On degrees in random triangulations of point sets (Q549246) (← links)
- The bounded degree problem for NLC grammars is decidable (Q579950) (← links)
- In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions (Q1864131) (← links)
- Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions (Q4225864) (← links)
- From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices (Q4580132) (← links)
- Polynomial graph-colorings (Q5096147) (← links)
- Solving and sampling with many solutions: Satisfiability and other hard problems (Q5111870) (← links)
- Number of Crossing-Free Geometric Graphs vs. Triangulations (Q5301006) (← links)
- Order on Order Types (Q5368694) (← links)
- Convex Hulls of Random Order Types (Q6060000) (← links)
- Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips). (Q6060018) (← links)
- An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm (Q6334691) (← links)
