The following pages link to Ermo Welzl (Q1262764):
Displaying 18 items.
- Symmetric graphs and interpretations (Q798680) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Recurrent words and simultaneous growth in T0L systems (Q1081308) (← links)
- Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
- A class of point-sets with few \(k\)-sets (Q1577490) (← links)
- Order on order types (Q1650795) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734) (← links)
- On the number of upward planar orientations of maximal planar graphs (Q2250457) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- Ranking intervals under visibility constraints<sup>∗</sup> (Q3477956) (← links)
- On the complexity of the general coloring problem (Q3968465) (← links)
- Algorithms for center and Tverberg points (Q4962763) (← links)
- A simple sampling lemma: Analysis and applications in geometric optimization (Q5939470) (← links)
- Crossing-free segments and triangles in point configurations (Q5954240) (← links)
