The following pages link to Ji{ří} Matoušek (Q818688):
Displayed 50 items.
- Intersection graphs of segments (Q1338319) (← links)
- Derandomizing an output-sensitive convex hull algorithm in three dimensions (Q1346251) (← links)
- On Ramsey sets in spheres (Q1347251) (← links)
- A Helly-type theorem for unions of convex sets (Q1361809) (← links)
- Improved upper bounds for approximation by zonotopes (Q1373005) (← links)
- On embedding expanders into \(\ell_p\) spaces (Q1376045) (← links)
- Guarding galleries where every point sees a large area (Q1380500) (← links)
- Efficient randomized algorithms for the repeated median line estimator (Q1386373) (← links)
- The one-round Voronoi game (Q1424320) (← links)
- On the linear and hereditary discrepancies (Q1568788) (← links)
- On approximate geometric \(k\)-clustering (Q1577548) (← links)
- On the signed domination in graphs (Q1586335) (← links)
- Equipartition of two measures by a 4-fan (Q1597674) (← links)
- A lower bound for weak \(\varepsilon\)-nets in high dimension (Q1611071) (← links)
- New constructions of weak \(\varepsilon\)-nets (Q1762945) (← links)
- Triangles in random graphs (Q1763352) (← links)
- The randomized integer convex hull (Q1764169) (← links)
- Topological lower bounds for the chromatic number: a hierarchy (Q1767268) (← links)
- On vertical ray shooting in arrangements (Q1803272) (← links)
- A highly non-smooth norm on Hilbert space (Q1806714) (← links)
- Almost-tiling the plane by ellipses (Q1807610) (← links)
- Complexity of projected images of convex subdivisions (Q1841991) (← links)
- Transversal numbers for hypergraphs arising in geometry (Q1865252) (← links)
- A fractional Helly theorem for convex lattice sets (Q1869991) (← links)
- Bounded VC-dimension implies a fractional Helly theorem (Q1880214) (← links)
- Crossing number, pair-crossing number, and expansion (Q1880792) (← links)
- A combinatorical proof of Kneser's conjecture (Q1882147) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- An elementary approach to lower bounds in geometric discrepancy (Q1892416) (← links)
- Tight upper bounds for the discrepancy of half-spaces (Q1892434) (← links)
- Piecewise linear paths among convex obstacles (Q1894717) (← links)
- Vertical decomposition of arrangements of hyperplanes in four dimensions (Q1895966) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- Note on the colored Tverberg theorem (Q1907116) (← links)
- On the distortion required for embedding finite metric spaces into normed spaces (Q1912794) (← links)
- A deterministic algorithm for the three-dimensional diameter problem (Q1917056) (← links)
- A subexponential bound for linear programming (Q1923862) (← links)
- On visibility and covering by convex sets (Q1961351) (← links)
- On embedding trees into uniformly convex Banach spaces (Q1969001) (← links)
- Three-monotone interpolation (Q2354672) (← links)
- Multilevel polynomial partitions and simplified range searching (Q2354673) (← links)
- Blocking visibility for points in general position (Q2391198) (← links)
- Berge's theorem, fractional Helly, and art galleries (Q2433698) (← links)
- Higher-order Erdős-Szekeres theorems (Q2437401) (← links)
- Polynomial-time homology for simplicial Eilenberg-MacLane spaces (Q2441425) (← links)
- Extendability of continuous maps is undecidable (Q2441584) (← links)
- Packing cones and their negatives in space (Q2464354) (← links)
- The number of unique-sink orientations of the hypercube (Q2495697) (← links)
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- Discrepancy after adding a single set (Q2568502) (← links)