The following pages link to Ji{ří} Matoušek (Q818688):
Displayed 50 items.
- Item:Q818688 (redirect page) (← links)
- Item:Q186159 (redirect page) (← links)
- Item:Q818688 (redirect page) (← links)
- Lower bounds on the length of monotone paths in arrangements (Q276089) (← links)
- Curves in \(\mathbb R^d\) intersecting every hyperplane at most \(d+1\) times (Q343098) (← links)
- Reachability by paths of bounded curvature in a convex polygon (Q425619) (← links)
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1 (Q461340) (← links)
- Lower bounds for weak epsilon-nets and stair-convexity (Q532609) (← links)
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- The number of unit distances is almost linear for most norms (Q624331) (← links)
- On the nonexistence of \(k\)-reptile tetrahedra (Q644820) (← links)
- A geometric proof of the colored Tverberg theorem (Q664361) (← links)
- On enclosing k points by a circle (Q674185) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- Zone diagrams in Euclidean spaces and in other normed spaces (Q695282) (← links)
- No Helly theorem for stabbing translates by lines in \(\mathbb{R}^3\) (Q701792) (← links)
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
- Vectors in a box (Q715080) (← links)
- On Gromov's method of selecting heavily covered points (Q742816) (← links)
- \(k\)-sets in four dimensions (Q818689) (← links)
- Stabbing simplices by points and flats (Q848667) (← links)
- Understanding and using linear programming (Q852298) (← links)
- Construction of \(\epsilon\)-nets (Q914376) (← links)
- von Staudt`s theory of ``Würfe`` (jets) -- an irruption of algebra in pure geometry (Q932068) (← links)
- Violator spaces: Structure and algorithms (Q943850) (← links)
- Computing \(D\)-convex hulls in the plane (Q950402) (← links)
- Distance \(k\)-sectors exist (Q991184) (← links)
- Removing degeneracy in LP-type problems revisited (Q1042446) (← links)
- Dimension gaps between representability and collapsibility (Q1042449) (← links)
- Line arrangements and range search (Q1107313) (← links)
- String graphs requiring exponential representations (Q1121918) (← links)
- Mathematical snapshots from the computational geometry landscape (Q1126830) (← links)
- Cutting hyperplane arrangements (Q1176317) (← links)
- Computing dominances in \(E^ n\) (Q1178238) (← links)
- Randomized optimal algorithm for slope selection (Q1182097) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- Reporting points in halfspaces (Q1196295) (← links)
- Efficient partition trees (Q1199132) (← links)
- Relative neighborhood graphs in three dimensions (Q1200909) (← links)
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267) (← links)
- On-line computation of convolutions (Q1262123) (← links)
- An \(L_p\) version of the Beck-Fiala conjecture (Q1268377) (← links)
- On constants for cuttings in the plane (Q1275667) (← links)
- The exponent of discrepancy is at least 1. 0669 (Q1279909) (← links)
- On the \(L_2\)-discrepancy for anchored boxes (Q1279913) (← links)
- On the discrepancy for boxes and polytopes (Q1295740) (← links)
- Discrepancy and approximations for bounded VC-dimension (Q1316651) (← links)
- On the sum of squares of cell complexities in hyperplane arrangements (Q1320395) (← links)
- On range searching with semialgebraic sets (Q1329188) (← links)
- Algorithms for ham-sandwich cuts (Q1329191) (← links)
