J. Matousek

发表

Improved upper bounds for approximation by zonotopes

J. Matousek, J. Matoušek, 1996 .

Approximation Algorithms and Semidefinite Programming

Bernd Grtner, J. Matousek, J. Matoušek, 2012 .

Invitation to discrete mathematics

Jirí Matousek, Jaroslav Nesetril, J. Matousek, 1998 .

On variants of the Johnson–Lindenstrauss lemma

J. Matousek, J. Matoušek, 2008 .

Geometric Discrepancy: An Illustrated Guide

J. Matousek, J. Matoušek, 2009 .

On the distortion required for embedding finite metric spaces into normed spaces

J. Matousek, J. Matoušek, 1996 .

On embedding trees into uniformly convex Banach spaces

J. Matousek, J. Matoušek, 1999 .

Lectures on discrete geometry

Jiri Matousek, J. Matousek, J. Matoušek, 2002, Graduate texts in mathematics.

On the sum of squares of cell complexities in hyperplane arrangements

M. Sharir, B. Aronov, J. Matousek, 1994 .

Bi-Lipschitz embeddings into low-dimensional Euclidean spaces

J. Matousek, J. Matoušek, 1990 .

Efficient partition trees

Jirí Matousek, J. Matousek, 1992, Discret. Comput. Geom..

Note on bi-Lipschitz embeddings into normed spaces

J. Matousek, 1992 .

Low-Distortion Embeddings of Trees

Jirí Matousek, Pavel Valtr, Jana Maxová, 2001, J. Graph Algorithms Appl..

On polynomial time decidability of induced-minor-closed classes

J. Matousek, J. Nesetril, Robin Thomas, 1988 .

Guarding galleries where every point sees a large area

G. Kalai, J. Matousek, J. Matoušek, 1997 .

The Probabilistic Method Lecture Notes

J. Vondrák, J. Matousek, J. Matoušek, 2009 .

Reporting Points in Halfspaces

Jirí Matousek, J. Matousek, J. Matoussek, 1992, Comput. Geom..

Using The Borsuk-Ulam Theorem

J. Matousek, J. Matoušek, 2007 .

Low-Distortion Embeddings of Finite Metric Spaces

Jirí Matousek, Piotr Indyk, P. Indyk, 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

The determinant bound for discrepancy is almost tight

J. Matousek, J. Matoušek, 2011, 1101.0767.

INAPPROXIMABILITY FOR METRIC EMBEDDINGS INTO R

J. Matousek, 2010 .

Inapproximability for metric embeddings into Rd

J. Matousek, Anastasios Sidiropoulos, 2010 .

On variants of the Johnson–Lindenstrauss lemma

Jirí Matousek, J. Matousek, J. Matoušek, 2008, Random Struct. Algorithms.

Ramsey-like properties for bi-Lipschitz mappings of finite metric spaces

J. Matousek, J. Matoušek, 1992 .

On embedding expanders into ℓp spaces

J. Matousek, J. Matoušek, 1997 .

The distance trisector curve

J. Matousek, T. Tokuyama, T. Asano, 2006, Symposium on the Theory of Computing.

Embedding Finite Metric Spaces into Normed Spaces

J. Matousek, 2002 .

Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry

J. Matousek, J. Matoušek, 2007 .

8 LOW-DISTORTION EMBEDDINGS OF FINITE METRIC SPACES

Piotr Indyk, Anastasios Sidiropoulos, P. Indyk, 2017 .

Open problems on embeddings of finite metric spaces

J. Matousek, Jiř́ı Matoušek, J. Matoušek, 2014 .

Expected length of the longest common subsequence for large alphabets

Marcos A. Kiwi, J. Matousek, M. Loebl, 2005 .

Relative neighborhood graphs in three dimensions

P. Agarwal, J. Matousek, 1992 .

2 Combinatorial Discrepancy for Boxes via the γ 2 Norm

J. Matousek, Aleksandar Nikolov, 2015 .

Combinatorial Discrepancy for Boxes via the Ellipsoid-Infinity Norm

J. Matousek, Aleksandar Nikolov, 2014 .

On discrepancy bounds via dual shatter function

J. Matousek, J. Matoušek, 1997 .

Topological lower bounds for the chromatic number: A hierarchy

Jiri Matousek, G. Ziegler, J. Matousek, 2003 .

NP-hardness results for intersection graphs

Jan Kratochvíl, Jiří Matoušek, J. Matousek, 1989 .

On dominatedl1 metrics

Jiří Matoušek, Yuri Rabinovich, Yuri Rabinovich, 2001 .

Higher-order Erdős–Szekeres theorems

Jiří Matoušek, Marek Eliáš, J. Matousek, 2013 .

On stabbing triangles by lines in 3-space

B. Aronov, J. Matousek, 2010 .

Discrepancy in arithmetic progressions

Jiří Matoušek, Joel Spencer, J. Spencer, 1996 .

Extending continuous maps : polynomiality and undecidability ( a survey ) ∗

J. Matousek, M. Čadek, Uli Wagner, 2013 .

Hardness of embedding simplicial complexes in $\mathbb {R}^d$

Jiří Matoušek, Uli Wagner, Martin Tancer, 2011 .

The Dawn of an Algebraic Era in Discrete Geometry?

J. Matousek, Jǐŕı Matoušek, J. Matoušek, 2011 .

On the gap between representability and collapsibility

J. Matousek, M. Tancer, J. Matoušek, 2008, 0803.3520.

Product Range Spaces, Sensitive Sampling, and Derandomization

B. Chazelle, J. Matousek, Hervé Brönnimann, 1993, FOCS.

Unit Distances in Three Dimensions

M. Sharir, J. Matousek, Haim Kaplan, 2011, Combinatorics, Probability and Computing.

Separating an object from its cast

D. Halperin, J. Matousek, M. D. Berg, 1997, SCG '97.

Reporting Points in Halfspaces

J. Matousek, 1992, Comput. Geom..

Topological lower bounds for the chromatic number: A hierarchy

G. Ziegler, J. Matousek, J. Matoušek, 2002, math/0208072.

Factorization Norms and Hereditary Discrepancy

Kunal Talwar, J. Matousek, Aleksandar Nikolov, 2014, ArXiv.

Low-Distortion Embeddings of Finite Metric Spaces

P. Indyk, J. Matousek, J. Matoušek, 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..