The following pages link to Ermo Welzl (Q1262764):
Displaying 50 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)
- Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection (Q686143) (← links)
- Shortest paths for line segments (Q686741) (← links)
- Symmetric graphs and interpretations (Q798680) (← links)
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Complexity and decidability for chain code picture languages (Q1058857) (← links)
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time (Q1062764) (← links)
- On the maximal number of edges of many faces in an arrangement (Q1071264) (← links)
- More on k-sets of finite sets in the plane (Q1079816) (← 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)
- \(\epsilon\)-nets and simplex range queries (Q1089803) (← links)
- Combinatorial properties of boundary NLC graph languages (Q1089808) (← links)
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (Q1089809) (← links)
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time (Q1097038) (← links)
- Halving point sets (Q1126842) (← links)
- Color-families are dense (Q1162817) (← links)
- Stabbing line segments (Q1163869) (← links)
- Euclidean minimum spanning trees and bichromatic closest pairs (Q1176318) (← links)
- Polynomial graph-colorings (Q1183345) (← links)
- Simultaneous inner and outer approximation of shapes (Q1201744) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← 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)
- The discrete 2-center problem (Q1272957) (← links)
- Discrepancy and approximations for bounded VC-dimension (Q1316651) (← links)
- Surface reconstruction between simple polygons via angle criteria (Q1332334) (← links)
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
- Improved bounds on weak \(\varepsilon\)-nets for convex sets (Q1346122) (← links)
- Cutting dense point sets in half (Q1355189) (← links)
- Approximation of convex figures by pairs of rectangles (Q1388135) (← links)
- Space-filling curves and their use in the design of geometric data structures (Q1391294) (← links)
- Algorithmic complexity of protein identification: Combinatorics of weighted strings (Q1422404) (← links)
- A class of point-sets with few \(k\)-sets (Q1577490) (← links)
- Order on order types (Q1650795) (← links)
- On the number of line separations of a finite set in the plane (Q1821352) (← links)
- Congruence, similarity, and symmetries of geometric objects (Q1822962) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions (Q1864131) (← links)
- A subexponential bound for linear programming (Q1923862) (← links)
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734) (← links)
- Lower bounds for searching robots, some faulty (Q1981629) (← links)
- Connectivity of triangulation flip graphs in the plane (Q2105329) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- On the number of upward planar orientations of maximal planar graphs (Q2250457) (← links)
