J. Matoušek

发表

Three-Monotone Interpolation

P. Paták, Josef Cibulka, J. Matoušek, 2015, Discrete & Computational Geometry.

Low-Distortion Embeddings of Finite Metric Spaces

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

On Gromov’s Method of Selecting Heavily Covered Points

Uli Wagner, J. Matoušek, 2014, Discrete & Computational Geometry.

Extendability of Continuous Maps Is Undecidable

M. Čadek, Uli Wagner, Marek Krcál, 2013, Discrete & Computational Geometry.

Low-Distortion Embeddings of Finite Metric Spaces

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

Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness

J. Barát, D. Wood, J. Matoušek, 2005, Electron. J. Comb..

Graph Colouring with No Large Monochromatic Components

N. Linial, G. Tardos, Or Sheffet, 2007, Combinatorics, Probability and Computing.

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

Uli Wagner, M. Tancer, J. Matouvsek, 2008, 0807.0336.

Multilevel Polynomial Partitions and Simplified Range Searching

J. Matoušek, Zuzana Patáková, 2015, Discrete & Computational Geometry.

Topics in Discrete Mathematics

P. Valtr, M. Klazar, J. Kratochvíl, 2006 .

Simple Proofs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique

M. Sharir, Haim Kaplan, J. Matoušek, 2012, Discrete & Computational Geometry.

Bi-Lipschitz embeddings into low-dimensional Euclidean spaces

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

Curves in $\mathbb R^d$ intersecting every hyperplane at most $d+1$ times

I. Bárány, A. Pór, J. Matoušek, 2016 .

Counting spanning trees

Jiří Matoušek, J. Matoušek, 2010 .

Cutting cheaply using eigenvectors

Jiří Matoušek, J. Matoušek, 2010 .

NP-hardness results for intersection graphs

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

Integer Programming and LP Relaxation

Jiří Matoušek, Bernd Gärtner, B. Gärtner, 2007 .

Software and Further Reading

Jiří Matoušek, Bernd Gärtner, B. Gärtner, 2007 .

Packing complete bipartite graphs

Jiří Matoušek, J. Matoušek, 2010 .

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

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

C G ] 1 5 Ju l 2 00 8 Inapproximability for metric embeddings into R

Anastasios Sidiropoulos, J. Matoušek, 2008 .

Computing All Maps into a Sphere

Jirí Matousek, Marek Krcál, Martin Cadek, 2011, J. ACM.

Hardness of embedding simplicial complexes in Rd

Jirí Matousek, Martin Tancer, Uli Wagner, 2009, SODA.

On the L2-Discrepancy for Anchored Boxes

Jirí Matousek, J. Matoušek, 1998, J. Complex..

Expected Length of the Longest Common Subsequence for Large Alphabets

Jirí Matousek, Martin Loebl, Marcos A. Kiwi, 2003, LATIN.

Open problems on embeddings of finite metric spaces

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

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

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

Approximations and Optimal Geometric Divide-an-Conquer

Jirí Matousek, J. Matoušek, 1995, J. Comput. Syst. Sci..

Approximations and optimal geometric divide-and-conquer

Jirí Matousek, J. Matoušek, 1991, STOC '91.

Geometric Discrepancy: An Illustrated Guide

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

Geometric Set Systems

Jiří Matoušek, J. Matoušek, 1998 .

Using The Borsuk-Ulam Theorem

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

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

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

Minimum and maximum against k lies

Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, 2010, SWAT.

A Lower Bound for Families of Natarajan Dimension d

Jirí Matousek, Paul Fischer, P. Fischer, 2001, J. Comb. Theory, Ser. A.

Guarding galleries where every point sees a large area

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

Understanding and using linear programming

Bernd Gärtner, Jiri Matousek, B. Gärtner, 2007, Universitext.

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

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

Topological lower bounds for the chromatic number: A hierarchy

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

Efficient partition trees

Jirí Matousek, J. Matoušek, 1991, SCG '91.

Multilevel Polynomial Partitions and Simplified Range Searching

Zuzana Patáková, Jirí Matousek, J. Matoušek, 2014, Discret. Comput. Geom..

Lectures on discrete geometry

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

Intersection graphs of segments and $\exists\mathbb{R}$ pdf

Jirí Matousek, J. Matoušek, 2014, ArXiv.

Segmenting object space by geometric reference structures

Jirí Matousek, Pankaj K. Agarwal, David J. Brady, 2006, TOSN.

Computing many faces in arrangements of lines and segments

Jirí Matousek, Otfried Cheong, Pankaj K. Agarwal, 1994, SCG '94.

Constructing levels in arrangements and higher order Voronoi diagrams

Jirí Matousek, Mark de Berg, Otfried Cheong, 1994, SCG '94.

Fat Triangles Determine Linearly Many Holes

Micha Sharir, Jirí Matousek, János Pach, 1994, SIAM J. Comput..

On the complexity of finding iso- and other morphisms for partial k-trees

Robin Thomas, Jirí Matousek, R. Thomas, 1992, Discret. Math..

On Approximate Geometric k -Clustering

Jirí Matousek, J. Matoušek, 2000, Discret. Comput. Geom..

On Ramsey Sets in Spheres

Vojtech Rödl, Jirí Matousek, V. Rödl, 1995, J. Comb. Theory, Ser. A.

Characterization of PEEK, PET and PI implanted with Mn ions and sub-sequently annealed

A. Macková, L. Kováčik, P. Malinský, 2014 .

Distance k-sectors exist

Jirí Matousek, Keiko Imai, Takeshi Tokuyama, 2009, SCG.

Zone diagrams in Euclidean spaces and in other normed spaces pdf

Jirí Matousek, Takeshi Tokuyama, Akitoshi Kawamura, 2009, SCG.

Zone diagrams: existence, uniqueness and algorithmic challenge

Jirí Matousek, Tetsuo Asano, Takeshi Tokuyama, 2007, SODA '07.

The distance trisector curve

Jirí Matousek, Tetsuo Asano, Takeshi Tokuyama, 2006, STOC '06.

Simple Proofs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique

Haim Kaplan, Micha Sharir, Jirí Matousek, 2011, Discret. Comput. Geom..

Lower Bounds on the Transversal Numbers of d-Intervals

Jirí Matousek, J. Matoušek, 2001, Discret. Comput. Geom..

Extension of Lipschitz mappings on metric trees

Jiří Matoušek, J. Matoušek, 1990 .

Dimension Gaps between Representability and Collapsibility

Jirí Matousek, Martin Tancer, M. Tancer, 2009, Discret. Comput. Geom..

On the gap between representability and collapsibility

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

Packing Cones and Their Negatives in Space

Jirí Matousek, Imre Bárány, I. Bárány, 2007, Discret. Comput. Geom..

Towards asymptotic optimality in probabilistic packet marking

Jirí Matousek, Micah Adler, Jeff Edmonds, 2005, STOC '05.

No Helly Theorem for Stabbing Translates by Lines in R3

Jirí Matousek, Andreas Holmsen, Andreas F. Holmsen, 2004, Discret. Comput. Geom..

The Randomized Integer Convex Hull

Jirí Matousek, Imre Bárány, I. Bárány, 2005, Discret. Comput. Geom..

On variants of the Johnson–Lindenstrauss lemma

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

Approximation Algorithms and Semidefinite Programming

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

Factorization Norms and Hereditary Discrepancy

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

The determinant bound for discrepancy is almost tight

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

The Dawn of an Algebraic Era in Discrete Geometry?

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

Dynamic half-space range reporting and its applications

Jirí Matousek, Pankaj K. Agarwal, P. Agarwal, 2005, Algorithmica.

On directional convexity

J. Matoušek, 2001, Discret. Comput. Geom..

Violator spaces: Structure and algorithms pdf

Jirí Matousek, Bernd Gärtner, Petr Skovron, 2006, Discret. Appl. Math..

A subexponential bound for linear programming

Micha Sharir, Jirí Matousek, Emo Welzl, 1992, SCG '92.

Separating an object from its cast

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

Embeddability in the 3-sphere is decidable

Jirí Matousek, Martin Tancer, Eric Sedgwick, 2014, SoCG.

Embeddability in the 3-Sphere Is Decidable

Jirí Matousek, Martin Tancer, Eric Sedgwick, 2014, J. ACM.

Complexity of Projected Images of Convex Subdivisions

Jirí Matousek, Takeshi Tokuyama, Tomio Hirata, 1994, Comput. Geom..

On embedding expanders into ℓp spaces

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

Discrepancy in arithmetic progressions

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

Improved upper bounds for approximation by zonotopes

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

Derandomization in Computational Geometry

Jiřı́ Matoušek, J. Matoušek, 1996, J. Algorithms.

Dynamic half-space reporting, geometric optimization, and minimum spanning trees

David Eppstein, Jirí Matousek, Pankaj K. Agarwal, 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

Linear optimization queries

Jirí Matousek, Otfried Cheong, O. Cheong, 1992, SCG '92.

Mathematics++: Selected Topics Beyond the Basic Courses

Ida Kantor, Jiri Matousek, Robert Šámal, 2015 .

Random edge can be exponential on abstract cubes

Jirí Matousek, Tibor Szabó, Tibor Szabó, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Lower Bounds for a Subexponential Optimization Algorithm

Jiří Matoušek, J. Matoušek, 1994, Random Struct. Algorithms.

Efficient Randomized Algorithms for the Repeated Median Line Estimator

Jirí Matousek, David M. Mount, Nathan S. Netanyahu, 1998, SODA '93.

Discrepancy, Bansal's Algorithm and the Determinant Bound

Jiri Matousek, J. Matoušek, 2012 .

Reporting Points in Halfspaces

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

Ray shooting and parametric search

Jirí Matousek, Pankaj K. Agarwal, P. Agarwal, 1992, STOC '92.

On discrepancy bounds via dual shatter function

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

Unit Distances in Three Dimensions

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

Extendability of Continuous Maps Is Undecidable

Jirí Matousek, Marek Krcál, Martin Cadek, 2013, Discret. Comput. Geom..

k-Sets in Four Dimensions

Micha Sharir, Shakhar Smorodinsky, Uli Wagner, 2006, Discret. Comput. Geom..

Geometric range searching

Jirí Matousek, J. Matoušek, 1994, CSUR.

On linear-time deterministic algorithms for optimization problems in fixed dimension

Bernard Chazelle, Jirí Matousek, B. Chazelle, 1996, SODA '93.

On restricted min‐wise independence of permutations

Jirí Matousek, Milos Stojakovic, Miloš Stojaković, 2003, Random Struct. Algorithms.

Bounded VC-Dimension Implies a Fractional Helly Theorem

Jirí Matousek, J. Matoušek, 2004, Discret. Comput. Geom..

Product range spaces, sensitive sampling, and derandomization

Bernard Chazelle, Jirí Matousek, Hervé Brönnimann, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

Spanning trees with low crossing number

Jirí Matousek, J. Matoušek, 1991, RAIRO Theor. Informatics Appl..

Low-Distortion Embeddings of Trees

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

Lower bounds on geometric Ramsey functions

Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová, 2013, SoCG.

Erdős–Szekeres-type statements: Ramsey function and decidability in dimension $1$

Boris Bukh, Jiri Matousek, B. Bukh, 2012, 1207.0705.

A Ramsey-type result for convex sets

János Pach, Jiří Matoušek, D. G. Larman, 1994 .

Three-Monotone Interpolation

Jirí Matousek, Josef Cibulka, Pavel Paták, 2014, Discret. Comput. Geom..

On the chromatic number of Kneser hypergraphs

Jiří Matoušek, J. Matoušek, 2002 .

Higher-order Erdös: Szekeres theorems pdf

Marek Eliáš, Jiř́ı Matoušek, J. Matoušek, 2011, SoCG '12.

ClassBench-ng: Recasting ClassBench after a Decade of Network Evolution

Jirí Matousek, Andrew W. Moore, Jan Korenek, 2017, 2017 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

ClassBench-ng: Benchmarking Packet Classification Algorithms in the OpenFlow Era

G. Antichi, David Janecek, J. Korenek, 2022, IEEE/ACM Transactions on Networking.

Large Monochromatic Components in Two-colored Grids

Jirí Matousek, Ales Prívetivý, Ales Prívetivý, 2007, Electron. Notes Discret. Math..

Computing Dominances in E^n

Jirí Matousek, J. Matoušek, 1991, Inf. Process. Lett..

Invitation to discrete mathematics

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

Near-Optimal Separators in String Graphs pdf

Jirí Matousek, J. Matoušek, 2013, Combinatorics, Probability and Computing.

String graphs requiring exponential representations

Jan Kratochvíl, Jirí Matousek, J. Matoušek, 1991, J. Comb. Theory, Ser. B.

On polynomial time decidability of induced-minor-closed classes

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

Intersection Graphs of Segments

J. Kratochvil, J. Matousek, J. Matoušek, 1994, J. Comb. Theory, Ser. B.

Discrepancy and approximations for bounded VC-dimension

Jirí Matousek, Emo Welzl, Lorenz Wernisch, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

On Range Searching with Semialgebraic Sets II

Micha Sharir, Jirí Matousek, Pankaj K. Agarwal, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

On range searching with semialgebraic sets

Jirí Matousek, Pankaj K. Agarwal, P. Agarwal, 1992, Discret. Comput. Geom..

Range searching with efficient hierarchical cuttings

Jirí Matousek, J. Matoušek, 1992, SCG '92.

Induced Trees in Triangle-Free Graphs

Robert Sámal, Jirí Matousek, Robert Šámal, 2007, Electron. J. Comb..

Around Brouwer's fixed point theorem (Lecture notes)

G. Ziegler, A. Björner, A. Bjorner, 2014 .

The Probabilistic Method Lecture Notes

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

On embedding trees into uniformly convex Banach spaces

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

Inapproximability for Metric Embeddings into R^d

Jirí Matousek, Anastasios Sidiropoulos, Anastasios Sidiropoulos, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

8 LOW-DISTORTION EMBEDDINGS OF FINITE METRIC SPACES

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

Random lifts of graphs

Jirí Matousek, Nathan Linial, Eyal Rozenman, 2001, SODA '01.

On Functional Separately Convex Hulls

Jirí Matousek, Petr Plechác, P. Plecháč, 1998, Discret. Comput. Geom..

Random lifts of graphs: Independence and chromatic number

Jirí Matousek, Nathan Linial, Alon Amit, 2002, Random Struct. Algorithms.

Discrepancy After Adding A Single Set

Jirí Matousek, Van H. Vu, Jeong Han Kim, 2005, Comb..

Vectors in a box

Kevin Buchin, Dömötör Pálvölgyi, Jiří Matoušek, 2009, Math. Program..

Transversal numbers for hypergraphs arising in geometry

Noga Alon, Jirí Matousek, Gil Kalai, 2002, Adv. Appl. Math..

On variants of the Johnson–Lindenstrauss lemma

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

Online conflict-free coloring for intervals

Amos Fiat, Micha Sharir, Elchanan Mossel, 2005, SODA '05.

On Enclosing k Points by a Circle

Jirí Matousek, J. Matoušek, 1995, Inf. Process. Lett..

On geometric optimization with few violated constraints

J. Matoušek, J. Matoušek, 1994, SCG '94.

Discrepancy of point sequences on fractal sets

R. Tichy, H. Albrecher, R. F. T. Graz, 2000, Publicationes Mathematicae Debrecen.

Berge's theorem, fractional Helly, and art galleries

Jirí Matousek, Imre Bárány, I. Bárány, 2006, Discret. Math..

Simplifying Inclusion–Exclusion Formulas

Xavier Goaoc, Jirí Matousek, Martin Tancer, 2012, Combinatorics, Probability and Computing.

A Combinatorial Proof of Kneser’s Conjecture*

Jirí Matousek, J. Matoušek, 2004, Comb..

Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions

Pankaj K. Agarwal, Subhash Suri, Jirí Matousek, 1991, Comput. Geom..

LC reductions yield isomorphic simplicial complexes

Jirí Matousek, J. Matoušek, 2008, Contributions Discret. Math..

Extending continuous maps: polynomiality and undecidability

Jirí Matousek, Marek Krcál, Martin Cadek, 2013, STOC '13.

Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension pdf

Jirí Matousek, Marek Krcál, Martin Cadek, 2012, SIAM J. Comput..

Crossing number, pair-crossing number, and expansion

Jirí Matousek, Petr Kolman, P. Kolman, 2004, J. Comb. Theory, Ser. B.

A Helly-Type Theorem for Unions of Convex Sets

Jirí Matousek, J. Matoušek, 1995, SCG '95.

On Gromov’s Method of Selecting Heavily Covered Points

Jirí Matousek, Uli Wagner, Uli Wagner, 2011, Discret. Comput. Geom..

The Exponent of Discrepancy Is at Least 1.0669

Jiří Matoušek, J. Matoušek, 1998, J. Complex..

An elementary approach to lower bounds in geometric discrepancy

M. Sharir, B. Chazelle, J. Matoušek, 1995, Discret. Comput. Geom..

Tight upper bounds for the discrepancy of half-spaces

Jirí Matousek, J. Matoušek, 1995, Discret. Comput. Geom..

A Geometric Proof of the Colored Tverberg Theorem

Uli Wagner, M. Tancer, J. Matoušek, 2010, Discrete & Computational Geometry.

Note on the Colored Tverberg Theorem

Jirí Matousek, J. Matoušek, 1996, J. Comb. Theory, Ser. B.

Stabbing Simplices by Points and Flats

Jirí Matousek, Gabriel Nivasch, Boris Bukh, 2008, Discret. Comput. Geom..

Piecewise linear paths among convex obstacles

Jirí Matousek, Mark de Berg, Otfried Cheong, 1993, STOC.

The distance trisector curve

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

Zone diagrams: existence, uniqueness and algorithmic challenge

T. Tokuyama, T. Asano, J. Matoušek, 2006, SODA.

A highly non-smooth norm on Hilbert space

E. Matoušková, J. Matoušek, 1999 .

On the Discrepancy for Cartesian Products

J. Matoušek, 2000 .

On Constants for Cuttings in the Plane

Jirí Matousek, J. Matoušek, 1998, Discret. Comput. Geom..

On range searching with semialgebraic sets

P. Agarwal, J. Matoušek, 1994, Discret. Comput. Geom..

Polynomial-Time Homology for Simplicial Eilenberg–MacLane Spaces

Jirí Matousek, Marek Krcál, Francis Sergeraert, 2012, Found. Comput. Math..

Equipartition of Two Measures by a 4-Fan

Jirí Matousek, Imre Bárány, I. Bárány, 2002, Discret. Comput. Geom..