papers
Publications (20)
math.CO2011
The determinant bound for discrepancy is almost tight
Jiri Matousek
cs.CG2014
Intersection graphs of segments and $\exists\mathbb{R}$
Jiri Matousek
math.CO2005
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Janos Barat, Jiri Matousek, David R. Wood
cs.CG2013
Polynomial-time homology for simplicial Eilenberg-MacLane spaces
Marek Krcal, Jiri Matousek, Francis Sergeraert
math.CO2011
Unit Distances in Three Dimensions
Haim Kaplan, Jiri Matousek, Zuzana Safernova +1
math.CO2007
Induced trees in triangle-free graphs
Jiri Matousek, Robert Samal
cs.CG2013
On Range Searching with Semialgebraic Sets II
Pankaj K. Agarwal, Jiri Matousek, Micha Sharir
math.CO2013
Erdos-Szekeres-type statements: Ramsey function and decidability in dimension 1
Boris Bukh, Jiri Matousek
math.MG2013
Curves in R^d intersecting every hyperplane at most d+1 times
Imre Barany, Jiri Matousek, Attila Por
math.CO2015
Factorization Norms and Hereditary Discrepancy
Jiri Matousek, Aleksandar Nikolov, Kunal Talwar
cs.DS2015
Multilevel polynomial partitions and simplified range searching
Jiri Matousek, Zuzana Patakova
cs.CG2008
Inapproximability for metric embeddings into R^d
Jiri Matousek, Anastasios Sidiropoulos
math.CO2008
On the gap between representability and collapsibility
Jiri Matousek, Martin Tancer
math.CO2013
Near-optimal separators in string graphs
Jiri Matousek
math.CO2003
Topological lower bounds for the chromatic number: A hierarchy
Jiri Matousek, Günter M. Ziegler
cs.CC2013
Computing higher homotopy groups is W[1]-hard
Jiri Matousek
cs.CG2013
Extendability of continuous maps is undecidable
Martin Cadek, Marek Krcal, Jiri Matousek +2
cs.CG2012
Higher-order Erdos--Szekeres theorems
Marek Elias, Jiri Matousek
math.CO2003
Expected length of the longest common subsequence for large alphabets
Marcos Kiwi, Martin Loebl, Jiri Matousek
cs.CG2014
Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
Martin Cadek, Marek Krcal, Jiri Matousek +2