- A Quick Summary Topological space. Subspace. Continuous map (preimage of an open set
- On enclosing k points by a circle Ji r Matou sek
- Integer points in rotating convex bodies Imre B ar any
- What Was It About? An Informal Summary
- Mathematical snapshots from the computational geometry Ji r' i Matou sek \Lambda
- Open problems on embeddings of finite metric spaces edited by Ji r Matou sek
- On kSets in Four Dimensions # Jir Matousek + Micha Sharir # Shakhar Smorodinsky
- B. News Scan 19992009 Geometric discrepancy is a lively field and many things have happened since
- Sestnct miniatur Matematick aplikace linern algebry
- Computing the center of planar point sets Ji r' i Matou sek
- Transversal Numbers for Hypergraphs Arising in Noga Alon \Lambda
- Nonexistence of 2-reptile simplices Ji r Matou sek
- Towards Asymptotic Optimality in Probabilistic Packet Micah Adler y
- Discrepancy of Point Sequences on Fractal Sets Hansj org Albrecher 1 Ji r' i Matou sek 2 Robert F. Tichy 1
- The Probabilistic Method Lecture Notes
- Derandomization in computational geometry Ji r' i Matou sek \Lambda
- The complexity of the lower envelope of segments with h endpoints
- Hercules versus Hidden Hydra Helper Ji r' i Matou sek Martin Loebl
- A lower bound on the size of Lipschitz subsets in dimension 3 Ji r' i Matou sek \Lambda
- Violator Spaces: Structure and Algorithms # B. Gartner a , J. Matousek b , L. Rust a , P. Skovron b
- How to Net a Lot with Little: Small ''Nets for Disks and Halfspaces \Lambda
- Embedding Finite Metric Spaces into Normed Spaces
- Berge's theorem, fractional Helly, and art galleries Imre B' ar' any \Lambda
- Stabbing simplices by points and flats Department of Mathematics
- Bounded VCdimension implies a fractional Helly theorem Ji r' i Matou sek \Lambda
- Bibliography The references are sorted alphabetically by the abbreviations (rather than by
- Open problems on embeddings of finite metric spaces edited by Ji r Matou sek
- The randomized integer convex hull Imre B ar any
- Topological lower bounds for the chromatic number: A hierarchy
- Incidence Problems In this chapter we study a very natural problem of combinatorial geometry: the
- How many points can be reconstructed from k projections? Ji r Matou sek
- Crossing number, pair-crossing number, and Petr Kolman, Ji r Matou sek
- Geometric range searching \Lambda Ji r' i Matou sek
- Probabilistic Mathematics
- Discrepancy after adding a single set Jeong Han Kim
- Expected length of the longest common subsequence for large Marcos Kiwi
- Ramseylike properties for biLipschitz mappings of finite metric spaces \Lambda
- On variants of the Johnson--Lindenstrauss lemma Ji r Matou sek
- 58 3. Direct Applications of Borsuk{Ulam 3.3 Kneser's Conjecture
- 2. The Borsuk{Ulam Theorem The Borsuk{Ulam theorem is one of the most useful tools o ered by elemen-
- Reporting points in halfspaces # Ji r Matou sek
- Incremental algorithms An incremental algorithm inserts the input objects one by one, and after each in
- No Helly theorem for stabbing translates by lines in R 3 Andreas Holmsen
- On Lipschitz mappings onto a square Ji r' i Matou sek \Lambda
- Large Monochromatic Components in Twocolored Grids
- BiLipschitz embeddings into lowdimensional Euclidean spaces
- Basis pursuit and the Johnson--Lindenstrauss lemma (Lecture Notes)
- Computing Dconvex hulls in the plane Vojt ech Fran ek
- Removing degeneracy in LPtype problems revisited Ji r Matou sek
- Note on biLipschitz embeddings into normed spaces \Lambda Ji r' i Matou sek
- Geometric set systems Ji r Matou sek #
- The number of unit distances is almost linear for most norms Jiri Matousek
- Blocking visibility for points in general position Jiri Matousek
- Erratum to "Nonexistence of 2-reptile simplices" Jiri Matousek
- LIST OF PUBLICATIONS Jiri Matousek
- & '()012) 3 4 567( 48 9@)AB AC1)A4D E 04'76B (
- O matematick anglictin Ji Matousek
- 136 5. Z2Maps and Nonembeddability equivalence of two Z 2 spaces is a homotopy equivalence as in Defini
- RANDOM EDGE can be exponential on abstract cubes Ji r Matou sek
- New Constructions of Weak Epsilon-Nets Ji r Matou sek Uli Wagner y
- Graph coloring with no large monochromatic components Nathan Linial #
- Expected length of the longest common subsequence for large alphabets
- Lowdistortion embeddings of trees ? Robert Babilon, Jir'i Matousek, Jana Maxov'a, and Pavel Valtr
- Number of Faces in Arrangements Arrangements of lines in the plane and their higher-dimensional generalization,
- On the gap between representability and collapsibility Ji r Matou sek Martin Tancer
- EuroCG 2011, Morschach, Switzerland, March 2830, 2011 The Dawn of an Algebraic Era in Discrete Geometry?
- The number of unique-sink orientations of the hypercube Ji r Matou sek
