default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJirí Matousek 0001
Jiří Matoušek
Person information
- affiliation: Charles University, Prague, Czech Republic
- unicode name: Jiří Matoušek
Other persons with the same name
- Jirí Matousek 0002
![[0000-0002-9447-0366]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-9447-0366")
— Brno University of Technology, Czech Republic - Jirí Matousek 0003 — CESNET, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2018
[j133]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Embeddability in the 3-Sphere Is Decidable. J. ACM 65(1): 5:1-5:49 (2018)- 2016
- [i26]Jérôme Dohrau, Bernd Gärtner, Manuel Kohler, Jirí Matousek, Emo Welzl:
A zero-player graph game in NP $\cap$ coNP. CoRR abs/1605.03546 (2016) - 2015
- [j132]Xavier Goaoc, Jirí Matousek, Pavel Paták, Zuzana Safernová, Martin Tancer:
Simplifying Inclusion-Exclusion Formulas. Comb. Probab. Comput. 24(2): 438-456 (2015) - [j131]Josef Cibulka, Jirí Matousek, Pavel Paták:
Three-Monotone Interpolation. Discret. Comput. Geom. 54(1): 3-21 (2015) - [j130]Jirí Matousek, Zuzana Patáková:
Multilevel Polynomial Partitions and Simplified Range Searching. Discret. Comput. Geom. 54(1): 22-41 (2015) - [c62]Jirí Matousek, Aleksandar Nikolov:
Combinatorial Discrepancy for Boxes via the gamma_2 Norm. SoCG 2015: 1-15 - 2014
- [j129]Jirí Matousek:
Near-Optimal Separators in String Graphs. Comb. Probab. Comput. 23(1): 135-139 (2014) - [j128]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Extendability of Continuous Maps Is Undecidable. Discret. Comput. Geom. 51(1): 24-66 (2014) - [j127]Jirí Matousek, Uli Wagner:
On Gromov's Method of Selecting Heavily Covered Points. Discret. Comput. Geom. 52(1): 1-33 (2014) - [j126]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): 17:1-17:44 (2014) - [j125]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): 1728-1780 (2014) - [j124]Marek Eliás, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová:
Lower Bounds on Geometric Ramsey Functions. SIAM J. Discret. Math. 28(4): 1960-1970 (2014) - [c61]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Embeddability in the 3-sphere is decidable. SoCG 2014: 78 - [c60]Marek Eliás, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová:
Lower bounds on geometric Ramsey functions. SoCG 2014: 558 - [c59]Imre Bárány, Jirí Matousek, Attila Pór:
Curves in Rd intersecting every hyperplane at most d + 1 times. SoCG 2014: 565 - [p3]Jirí Matousek:
String graphs and separators. Geometry, Structure and Randomness in Combinatorics 2014: 61-97 - [e1]Jirí Matousek, Jaroslav Nesetril, Marco Pellegrini:
Geometry, Structure and Randomness in Combinatorics. Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series 18, Springer 2014, ISBN 978-88-7642-524-0 [contents] - [i25]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Embeddability in the 3-sphere is decidable. CoRR abs/1402.0815 (2014) - [i24]Josef Cibulka, Jirí Matousek, Pavel Paták:
Three-monotone interpolation. CoRR abs/1404.4731 (2014) - [i23]Jirí Matousek:
Intersection graphs of segments and ∃ℝ. CoRR abs/1406.2636 (2014) - [i22]Jirí Matousek, Zuzana Safernová:
Multilevel polynomial partitions and simplified range searching. CoRR abs/1406.3058 (2014) - [i21]Jirí Matousek, Aleksandar Nikolov, Kunal Talwar:
Factorization Norms and Hereditary Discrepancy. CoRR abs/1408.1376 (2014) - 2013
- [j123]Marek Krcál, Jirí Matousek, Francis Sergeraert:
Polynomial-Time Homology for Simplicial Eilenberg-MacLane Spaces. Found. Comput. Math. 13(6): 935-963 (2013) - [j122]Pankaj K. Agarwal, Jirí Matousek, Micha Sharir:
On Range Searching with Semialgebraic Sets. II. SIAM J. Comput. 42(6): 2039-2062 (2013) - [c58]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Untangling Two Systems of Noncrossing Curves. GD 2013: 472-483 - [c57]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Extending continuous maps: polynomiality and undecidability. STOC 2013: 595-604 - [p2]Jirí Matousek:
On Lipschitz Mappings Onto a Square. The Mathematics of Paul Erdős I 2013: 533-540 - [i20]Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner:
Extendability of continuous maps is undecidable. CoRR abs/1302.2370 (2013) - [i19]Jirí Matousek:
Near-optimal separators in string graphs. CoRR abs/1302.6482 (2013) - [i18]Jirí Matousek:
Computing higher homotopy groups is W[1]-hard. CoRR abs/1304.7705 (2013) - [i17]Jirí Matousek:
String graphs and separators. CoRR abs/1311.5048 (2013) - 2012
- [j121]Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein:
Minimum and maximum against k lies. Chic. J. Theor. Comput. Sci. 2012 (2012) - [j120]Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron:
Reachability by paths of bounded curvature in a convex polygon. Comput. Geom. 45(1-2): 21-32 (2012) - [j119]Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir:
Unit Distances in Three Dimensions. Comb. Probab. Comput. 21(4): 597-610 (2012) - [j118]Jirí Matousek, Martin Tancer, Uli Wagner:
A Geometric Proof of the Colored Tverberg Theorem. Discret. Comput. Geom. 47(2): 245-265 (2012) - [j117]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): 499-517 (2012) - [j116]Kevin Buchin, Jirí Matousek, Robin A. Moser, Dömötör Pálvölgyi:
Vectors in a box. Math. Program. 135(1-2): 323-335 (2012) - [c56]Marek Eliás, Jirí Matousek:
Higher-order Erdos-Szekeres theorems. SCG 2012: 81-90 - [c55]Pankaj K. Agarwal, Jirí Matousek, Micha Sharir:
On Range Searching with Semialgebraic Sets II. FOCS 2012: 420-429 - [c54]Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner:
Computing all maps into a sphere. SODA 2012: 1-10 - [i16]Marek Krcál, Jirí Matousek, Francis Sergeraert:
Polynomial-time homology for simplicial Eilenberg-MacLane spaces. CoRR abs/1201.6222 (2012) - [i15]Pankaj K. Agarwal, Jirí Matousek, Micha Sharir:
On Range Searching with Semialgebraic Sets II. CoRR abs/1208.3384 (2012) - [i14]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 abs/1211.3093 (2012) - 2011
- [j115]Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein:
The t-Pebbling Number is Eventually Linear in t. Electron. J. Comb. 18(1) (2011) - [j114]Jirí Matousek, Zuzana Safernová:
On the Nonexistence of k-reptile Tetrahedra. Discret. Comput. Geom. 46(3): 599-609 (2011) - [j113]Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno:
A Doubly Exponentially Crumbled Cake. Electron. Notes Discret. Math. 38: 265-271 (2011) - [i13]Jirí Matousek, Uli Wagner:
On Gromov's Method of Selecting Heavily Covered Points. CoRR abs/1102.3515 (2011) - [i12]Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno:
A Doubly Exponentially Crumbled Cake. CoRR abs/1104.0122 (2011) - [i11]Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner:
Computing all maps into a sphere. CoRR abs/1105.6257 (2011) - [i10]Marek Eliás, Jirí Matousek:
Higher-order Erdos-Szekeres theorems. CoRR abs/1111.3824 (2011) - 2010
- [j112]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-sectors exist. Comput. Geom. 43(9): 713-720 (2010) - [j111]Boris Bukh, Jirí Matousek, Gabriel Nivasch:
Stabbing Simplices by Points and Flats. Discret. Comput. Geom. 43(2): 321-338 (2010) - [c53]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-sectors exist. SCG 2010: 210-215 - [c52]Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama:
Zone diagrams in Euclidean spaces and in other normed spaces. SCG 2010: 216-221 - [c51]Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein:
Minimum and Maximum against k Lies. SWAT 2010: 139-149 - [i9]Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein:
Minimum and maximum against k lies. CoRR abs/1002.0562 (2010) - [i8]Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron:
Reachability by Paths of Bounded Curvature in a Convex Polygon. CoRR abs/1008.4244 (2010)
2000 – 2009
- 2009
- [b5]Jirí Matousek, Jaroslav Nesetril:
Invitation to Discrete Mathematics (2. ed.). Oxford University Press 2009, ISBN 978-0-19-857042-4, pp. I-XVII, 1-443 - [j110]Vojtech Franek, Jirí Matousek:
Computing D-convex hulls in the plane. Comput. Geom. 42(1): 81-89 (2009) - [j109]Jirí Matousek:
Blocking Visibility for Points in General Position. Discret. Comput. Geom. 42(2): 219-223 (2009) - [j108]Jirí Matousek:
Removing Degeneracy in LP-Type Problems Revisited. Discret. Comput. Geom. 42(4): 517-526 (2009) - [j107]Jirí Matousek, Martin Tancer:
Dimension Gaps between Representability and Collapsibility. Discret. Comput. Geom. 42(4): 631-639 (2009) - [c50]Boris Bukh, Jirí Matousek, Gabriel Nivasch:
Lower bounds for weak epsilon-nets and stair-convexity. SCG 2009: 1-10 - [c49]Jirí Matousek, Martin Tancer, Uli Wagner:
Hardness of embedding simplicial complexes in Rd. SODA 2009: 855-864 - [i7]Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama:
Zone Diagrams in Euclidean Spaces and in Other Normed Spaces. CoRR abs/0912.3016 (2009) - [i6]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-Sectors Exist. CoRR abs/0912.4164 (2009) - 2008
- [j106]Jirí Matousek:
LC reductions yield isomorphic simplicial complexes. Contributions Discret. Math. 3(2) (2008) - [j105]Jirí Matousek, Robert Sámal:
Induced Trees in Triangle-Free Graphs. Electron. J. Comb. 15(1) (2008) - [j104]Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos:
Graph Colouring with No Large Monochromatic Components. Comb. Probab. Comput. 17(4): 577-589 (2008) - [j103]Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron:
Violator spaces: Structure and algorithms. Discret. Appl. Math. 156(11): 2124-2141 (2008) - [j102]Jirí Matousek:
On variants of the Johnson-Lindenstrauss lemma. Random Struct. Algorithms 33(2): 142-156 (2008) - [j101]Jirí Matousek, Ales Prívetivý:
Large Monochromatic Components in Two-Colored Grids. SIAM J. Discret. Math. 22(1): 295-311 (2008) - [j100]Jirí Matousek, Ales Prívetivý, Petr Skovron:
How Many Points Can Be Reconstructed from k Projections? SIAM J. Discret. Math. 22(4): 1605-1623 (2008) - [c48]Jirí Matousek, Anastasios Sidiropoulos:
Inapproximability for Metric Embeddings into R^d. FOCS 2008: 405-413 - [i5]Boris Bukh, Jirí Matousek, Gabriel Nivasch:
Stabbing simplices by points and flats. CoRR abs/0804.4464 (2008) - [i4]Jirí Matousek, Martin Tancer, Uli Wagner:
Hardness of embedding simplicial complexes in Rd. CoRR abs/0807.0336 (2008) - [i3]Jirí Matousek, Anastasios Sidiropoulos:
Inapproximability for metric embeddings into R^d. CoRR abs/0807.2472 (2008) - [i2]Boris Bukh, Jirí Matousek, Gabriel Nivasch:
Lower bounds for weak epsilon-nets and stair-convexity. CoRR abs/0812.5039 (2008) - 2007
- [b4]Bernd Gärtner, Jirí Matousek:
Understanding and using linear programming. Universitext, Springer 2007, ISBN 978-3-540-30697-9, pp. I-VIII, 1-222 - [j99]Imre Bárány, Jirí Matousek:
Packing Cones and Their Negatives in Space. Discret. Comput. Geom. 38(2): 177-187 (2007) - [j98]Jirí Matousek, Ales Prívetivý:
Large Monochromatic Components in Two-colored Grids. Electron. Notes Discret. Math. 29: 3-9 (2007) - [j97]Jirí Matousek, Petr Skovron:
Removing degeneracy may require unbounded dimension increase. Electron. Notes Discret. Math. 29: 107-113 (2007) - [j96]Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos:
Graph coloring with no large monochromatic components. Electron. Notes Discret. Math. 29: 115-122 (2007) - [j95]Jirí Matousek, Robert Sámal:
Induced trees in triangle-free graphs. Electron. Notes Discret. Math. 29: 307-313 (2007) - [j94]Jirí Matousek, Ales Prívetivý, Petr Skovron:
How many points can be reconstructed from k projections? Electron. Notes Discret. Math. 29: 427-434 (2007) - [j93]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): 1342-1359 (2007) - [j92]Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama:
Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge. SIAM J. Comput. 37(4): 1182-1198 (2007) - [j91]Imre Bárány, Jirí Matousek:
Quadratically Many Colorful Simplices. SIAM J. Discret. Math. 21(1): 191-198 (2007) - [j90]Jirí Matousek, Petr Skovron:
Removing Degeneracy May Require a Large Dimension Increase. Theory Comput. 3(1): 159-177 (2007) - [c47]Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama:
Zone diagrams: existence, uniqueness and algorithmic challenge. SODA 2007: 756-765 - 2006
- [j89]Jirí Matousek:
The Number Of Unique-Sink Orientations of the Hypercube*. Comb. 26(1): 91-99 (2006) - [j88]János Barát, Jirí Matousek, David R. Wood:
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. Electron. J. Comb. 13(1) (2006) - [j87]Jirí Matousek, Ales Prívetivý:
The Minimum Independence Number of a Hasse Diagram. Comb. Probab. Comput. 15(3): 473-475 (2006) - [j86]Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner:
k-Sets in Four Dimensions. Discret. Comput. Geom. 35(2): 177-191 (2006) - [j85]Imre Bárány, Jirí Matousek:
Berge's theorem, fractional Helly, and art galleries. Discret. Math. 306(19-20): 2303-2313 (2006) - [j84]Pankaj K. Agarwal, David J. Brady, Jirí Matousek:
Segmenting object space by geometric reference structures. ACM Trans. Sens. Networks 2(4): 455-465 (2006) - [c46]Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron:
Violator Spaces: Structure and Algorithms. ESA 2006: 387-398 - [c45]Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama:
The distance trisector curve. STOC 2006: 336-343 - [i1]Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron:
Violator Spaces: Structure and Algorithms. CoRR abs/cs/0606087 (2006) - 2005
- [j83]Jeong Han Kim, Jirí Matousek, Van H. Vu:
Discrepancy After Adding A Single Set. Comb. 25(4): 499-501 (2005) - [j82]Imre Bárány, Jirí Matousek:
The Randomized Integer Convex Hull. Discret. Comput. Geom. 33(1): 3-25 (2005) - [c44]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: 545-554 - [c43]Micah Adler, Jeff Edmonds, Jirí Matousek:
Towards asymptotic optimality in probabilistic packet marking. STOC 2005: 450-459 - 2004
- [j81]Jirí Matousek:
A Combinatorial Proof of Kneser's Conjecture. Comb. 24(1): 163-170 (2004) - [j80]Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek:
The One-Round Voronoi Game. Discret. Comput. Geom. 31(1): 125-138 (2004) - [j79]Jirí Matousek:
Bounded VC-Dimension Implies a Fractional Helly Theorem. Discret. Comput. Geom. 31(2): 251-255 (2004) - [j78]Andreas F. Holmsen, Jirí Matousek:
No Helly Theorem for Stabbing Translates by Lines in R 3. Discret. Comput. Geom. 31(3): 405-410 (2004) - [j77]Jirí Matousek, Uli Wagner:
New Constructions of Weak epsilon-Nets. Discret. Comput. Geom. 32(2): 195-206 (2004) - [j76]Martin Loebl, Jirí Matousek, Ondrej Pangrác:
Triangles in random graphs. Discret. Math. 289(1-3): 181-185 (2004) - [j75]Petr Kolman, Jirí Matousek:
Crossing number, pair-crossing number, and expansion. J. Comb. Theory B 92(1): 99-113 (2004) - [c42]Jirí Matousek, Tibor Szabó:
Random Edge Can Be Exponential on Abstract Cubes. FOCS 2004: 92-100 - [c41]Jirí Matousek:
Nonexistence of 2-Reptile Simplices. JCDCG 2004: 151-160 - [c40]Marcos A. Kiwi, Martin Loebl, Jirí Matousek:
Expected Length of the Longest Common Subsequence for Large Alphabets. LATIN 2004: 302-311 - [r1]Piotr Indyk, Jirí Matousek:
Low-Distortion Embeddings of Finite Metric Spaces. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 177-196 - 2003
- [j74]Jirí Matousek:
A Lower Bound on the Size of Lipschitz Subsets in Dimension 3. Comb. Probab. Comput. 12(4): 427-430 (2003) - [j73]Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr:
Low-Distortion Embeddings of Trees. J. Graph Algorithms Appl. 7(4): 399-409 (2003) - [j72]Jirí Matousek, Milos Stojakovic:
On restricted min-wise independence of permutations. Random Struct. Algorithms 23(4): 397-408 (2003) - [c39]Jirí Matousek:
New constructions of weak epsilon-nets. SCG 2003: 129-135 - 2002
- [b3]Jirí Matousek:
Lectures on discrete geometry. Graduate texts in mathematics 212, Springer 2002, ISBN 978-0-387-95373-1, pp. I-XVI, 1-481 - [b2]Jirí Matousek, Jaroslav Nesetril:
Diskrete Mathematik - eine Entdeckungsreise (korrigierter Nachdruck). Springer-Lehrbuch, Springer 2002, ISBN 978-3-540-42386-7, pp. I-XVII, 1-459 - [j71]Noga Alon, Gil Kalai, Jirí Matousek, Roy Meshulam:
Transversal numbers for hypergraphs arising in geometry. Adv. Appl. Math. 29(1): 79-101 (2002) - [j70]Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an object from its cast. Comput. Aided Des. 34(8): 547-559 (2002) - [j69]Imre Bárány, Jirí Matousek:
Equipartition of Two Measures by a 4-Fan. Discret. Comput. Geom. 27(3): 293-301 (2002) - [j68]