Jirí Matousek

Publication Activity (10 Years)

Years Active: 1988-2018
Publications (10 Years): 6

Top Venues

CoRR

Discret. Comput. Geom.

SoCG

Comb. Probab. Comput.

Publications

Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
Embeddability in the 3-Sphere Is Decidable. J. ACM 65 (1) (2018)
Jérôme Dohrau, Bernd Gärtner, Manuel Kohler, Jirí Matousek, Emo Welzl
A zero-player graph game in NP $\cap$ coNP. CoRR (2016)
Jirí Matousek, Aleksandar Nikolov
Combinatorial Discrepancy for Boxes via the gamma_2 Norm. SoCG (2015)
Jirí Matousek, Zuzana Patáková
Multilevel Polynomial Partitions and Simplified Range Searching. Discret. Comput. Geom. 54 (1) (2015)
Josef Cibulka, Jirí Matousek, Pavel Paták
Three-Monotone Interpolation. Discret. Comput. Geom. 54 (1) (2015)
Xavier Goaoc, Jirí Matousek, Pavel Paták, Zuzana Safernová, Martin Tancer
Simplifying Inclusion-Exclusion Formulas. Comb. Probab. Comput. 24 (2) (2015)
Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
Embeddability in the 3-sphere is decidable. CoRR (2014)
Marek Eliás, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová
Lower bounds on geometric Ramsey functions. SoCG (2014)
Jirí Matousek
Near-Optimal Separators in String Graphs. Comb. Probab. Comput. 23 (1) (2014)
Josef Cibulka, Jirí Matousek, Pavel Paták
Three-monotone interpolation. CoRR (2014)
Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
Embeddability in the 3-sphere is decidable. SoCG (2014)
Jirí Matousek, Aleksandar Nikolov, Kunal Talwar
Factorization Norms and Hereditary Discrepancy. CoRR (2014)
Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
Extendability of Continuous Maps Is Undecidable. Discret. Comput. Geom. 51 (1) (2014)
Jirí Matousek
Intersection graphs of segments and $\exists\mathbb{R}$. CoRR (2014)
Jirí Matousek, Zuzana Safernová
Multilevel polynomial partitions and simplified range searching. CoRR (2014)
Jirí Matousek, Uli Wagner
On Gromov's Method of Selecting Heavily Covered Points. Discret. Comput. Geom. 52 (1) (2014)
Imre Bárány, Jirí Matousek, Attila Pór
Curves in Rd intersecting every hyperplane at most d + 1 times. SoCG (2014)
Marek Eliás, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová
Lower Bounds on Geometric Ramsey Functions. SIAM J. Discret. Math. 28 (4) (2014)
Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension. SIAM J. Comput. 43 (5) (2014)
Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner
Computing All Maps into a Sphere. J. ACM 61 (3) (2014)
Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
Untangling Two Systems of Noncrossing Curves. Graph Drawing (2013)
Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
Extending continuous maps: polynomiality and undecidability. STOC (2013)
Pankaj K. Agarwal, Jirí Matousek, Micha Sharir
On Range Searching with Semialgebraic Sets. II. SIAM J. Comput. 42 (6) (2013)
Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
Extendability of continuous maps is undecidable CoRR (2013)
Jirí Matousek
Near-optimal separators in string graphs CoRR (2013)
Jirí Matousek
Computing higher homotopy groups is W[1]-hard CoRR (2013)
Marek Krcál, Jirí Matousek, Francis Sergeraert
Polynomial-Time Homology for Simplicial Eilenberg-MacLane Spaces. Found. Comput. Math. 13 (6) (2013)
Jirí Matousek
String graphs and separators. CoRR (2013)
Haim Kaplan, Jirí Matousek, Micha Sharir
Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique. Discret. Comput. Geom. 48 (3) (2012)
Kevin Buchin, Jirí Matousek, Robin A. Moser, Dömötör Pálvölgyi
Vectors in a box. Math. Program. 135 (1-2) (2012)
Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir
Unit Distances in Three Dimensions. Comb. Probab. Comput. 21 (4) (2012)
Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension CoRR (2012)
Pankaj K. Agarwal, Jirí Matousek, Micha Sharir
On Range Searching with Semialgebraic Sets II CoRR (2012)
Marek Eliás, Jirí Matousek
Higher-order Erdos-Szekeres theorems. SCG (2012)
Pankaj K. Agarwal, Jirí Matousek, Micha Sharir
On Range Searching with Semialgebraic Sets II. FOCS (2012)
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
Minimum and maximum against k lies. Chic. J. Theor. Comput. Sci. 2012 (2012)
Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner
Computing all maps into a sphere. SODA (2012)
Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron
Reachability by paths of bounded curvature in a convex polygon. Comput. Geom. 45 (1-2) (2012)
Marek Krcál, Jirí Matousek, Francis Sergeraert
Polynomial-time homology for simplicial Eilenberg-MacLane spaces CoRR (2012)
Jirí Matousek, Martin Tancer, Uli Wagner
A Geometric Proof of the Colored Tverberg Theorem. Discret. Comput. Geom. 47 (2) (2012)
Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner
Computing all maps into a sphere CoRR (2011)
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
. Electron. J. Comb. 18 (1) (2011)
Jirí Matousek, Uli Wagner
On Gromov's Method of Selecting Heavily Covered Points CoRR (2011)
Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno
A Doubly Exponentially Crumbled Cake. Electron. Notes Discret. Math. 38 (2011)
Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno
A Doubly Exponentially Crumbled Cake CoRR (2011)
Marek Eliás, Jirí Matousek
Higher-order Erdos-Szekeres theorems CoRR (2011)
Jirí Matousek, Zuzana Safernová
-reptile Tetrahedra. Discret. Comput. Geom. 46 (3) (2011)
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
Lies. SWAT (2010)
Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama
Distance k-sectors exist. Comput. Geom. 43 (9) (2010)
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
Minimum and maximum against k lies CoRR (2010)
Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama
Zone diagrams in Euclidean spaces and in other normed spaces. SCG (2010)
Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron
Reachability by Paths of Bounded Curvature in a Convex Polygon CoRR (2010)
Boris Bukh, Jirí Matousek, Gabriel Nivasch
Stabbing Simplices by Points and Flats. Discret. Comput. Geom. 43 (2) (2010)
Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama
-sectors exist. SCG (2010)
Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama
Distance k-Sectors Exist CoRR (2009)
Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama
Zone Diagrams in Euclidean Spaces and in Other Normed Spaces CoRR (2009)
Jirí Matousek, Martin Tancer
Dimension Gaps between Representability and Collapsibility. Discret. Comput. Geom. 42 (4) (2009)
Jirí Matousek
Blocking Visibility for Points in General Position. Discret. Comput. Geom. 42 (2) (2009)
Jirí Matousek, Martin Tancer, Uli Wagner
. SODA (2009)
Vojtech Franek, Jirí Matousek
Computing D-convex hulls in the plane. Comput. Geom. 42 (1) (2009)
Jirí Matousek
Removing Degeneracy in LP-Type Problems Revisited. Discret. Comput. Geom. 42 (4) (2009)
Boris Bukh, Jirí Matousek, Gabriel Nivasch
Lower bounds for weak epsilon-nets and stair-convexity. SCG (2009)
Boris Bukh, Jirí Matousek, Gabriel Nivasch
Lower bounds for weak epsilon-nets and stair-convexity. CoRR (2008)
Jirí Matousek, Martin Tancer, Uli Wagner
CoRR (2008)
Jirí Matousek, Anastasios Sidiropoulos
Inapproximability for metric embeddings into R^d CoRR (2008)
Jirí Matousek, Robert Sámal
Induced Trees in Triangle-Free Graphs. Electron. J. Comb. 15 (1) (2008)
Boris Bukh, Jirí Matousek, Gabriel Nivasch
Stabbing simplices by points and flats CoRR (2008)
Jirí Matousek, Ales Prívetivý, Petr Skovron
How Many Points Can Be Reconstructed from k Projections? SIAM J. Discret. Math. 22 (4) (2008)
Jirí Matousek, Ales Prívetivý
Large Monochromatic Components in Two-Colored Grids. SIAM J. Discret. Math. 22 (1) (2008)
Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos
Graph Colouring with No Large Monochromatic Components. Comb. Probab. Comput. 17 (4) (2008)
Jirí Matousek
LC reductions yield isomorphic simplicial complexes. Contributions Discret. Math. 3 (2) (2008)
Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron
Violator spaces: Structure and algorithms. Discret. Appl. Math. 156 (11) (2008)
Jirí Matousek
On variants of the Johnson-Lindenstrauss lemma. Random Struct. Algorithms 33 (2) (2008)
Jirí Matousek, Anastasios Sidiropoulos
Inapproximability for Metric Embeddings into R^d. FOCS (2008)
Jirí Matousek, Petr Skovron
Removing Degeneracy May Require a Large Dimension Increase. Theory Comput. 3 (1) (2007)
Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos
Graph coloring with no large monochromatic components. Electron. Notes Discret. Math. 29 (2007)
Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
Online Conflict-Free Coloring for Intervals. SIAM J. Comput. 36 (5) (2007)
Imre Bárány, Jirí Matousek
Quadratically Many Colorful Simplices. SIAM J. Discret. Math. 21 (1) (2007)
Jirí Matousek, Ales Prívetivý
Large Monochromatic Components in Two-colored Grids. Electron. Notes Discret. Math. 29 (2007)
Jirí Matousek, Robert Sámal
Induced trees in triangle-free graphs. Electron. Notes Discret. Math. 29 (2007)
Jirí Matousek, Ales Prívetivý, Petr Skovron
How many points can be reconstructed from k projections? Electron. Notes Discret. Math. 29 (2007)
Jirí Matousek, Petr Skovron
Removing degeneracy may require unbounded dimension increase. Electron. Notes Discret. Math. 29 (2007)
Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge. SIAM J. Comput. 37 (4) (2007)
Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
Zone diagrams: existence, uniqueness and algorithmic challenge. SODA (2007)
Imre Bárány, Jirí Matousek
Packing Cones and Their Negatives in Space. Discret. Comput. Geom. 38 (2) (2007)
Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner
k-Sets in Four Dimensions. Discret. Comput. Geom. 35 (2) (2006)
Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron
Violator Spaces: Structure and Algorithms CoRR (2006)
Jirí Matousek
The Number Of Unique-Sink Orientations of the Hypercube*. Comb. 26 (1) (2006)
Pankaj K. Agarwal, David J. Brady, Jirí Matousek
Segmenting object space by geometric reference structures. ACM Trans. Sens. Networks 2 (4) (2006)
János Barát, Jirí Matousek, David R. Wood
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. Electron. J. Comb. 13 (1) (2006)
Jirí Matousek, Ales Prívetivý
The Minimum Independence Number of a Hasse Diagram. Comb. Probab. Comput. 15 (3) (2006)
Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron
Violator Spaces: Structure and Algorithms. ESA (2006)
Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
The distance trisector curve. STOC (2006)
Imre Bárány, Jirí Matousek
Berge's theorem, fractional Helly, and art galleries. Discret. Math. 306 (19-20) (2006)
Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
Online conflict-free coloring for intervals. SODA (2005)
Imre Bárány, Jirí Matousek
The Randomized Integer Convex Hull. Discret. Comput. Geom. 33 (1) (2005)
Jeong Han Kim, Jirí Matousek, Van H. Vu
Discrepancy After Adding A Single Set. Comb. 25 (4) (2005)
Micah Adler, Jeff Edmonds, Jirí Matousek
Towards asymptotic optimality in probabilistic packet marking. STOC (2005)
Petr Kolman, Jirí Matousek
Crossing number, pair-crossing number, and expansion. J. Comb. Theory, Ser. B 92 (1) (2004)
Jirí Matousek
A Combinatorial Proof of Kneser's Conjecture. Comb. 24 (1) (2004)

Jirí Matousek.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jirí Matousek