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://dblp1.uni-trier.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]Jirí Matousek:
A Lower Bound for Weak epsilon-Nets in High Dimension. Discret. Comput. Geom. 28(1): 45-48 (2002) - [j67]Alon Amit, Nathan Linial, Jirí Matousek:
Random lifts of graphs: Independence and chromatic number. Random Struct. Algorithms 20(1): 1-22 (2002) - [c38]Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek:
The one-round Voronoi game. SCG 2002: 97-101 - 2001
- [j66]Imre Bárány, Jirí Matousek:
Simultaneous Partitions of Measures by k-Fans. Discret. Comput. Geom. 25(3): 317-334 (2001) - [j65]Jirí Matousek:
On Directional Convexity. Discret. Comput. Geom. 25(3): 389-403 (2001) - [j64]Jirí Matousek:
Lower Bounds on the Transversal Numbers of d-Intervals. Discret. Comput. Geom. 26(3): 283-287 (2001) - [j63]Jirí Matousek:
Lower bound on the minus-domination number. Discret. Math. 233(1-3): 361-370 (2001) - [j62]Jirí Matousek:
Transversals of hypergraphs with geometric flavor. Electron. Notes Discret. Math. 10: 194-197 (2001) - [j61]Paul Fischer, Jirí Matousek:
A Lower Bound for Families of Natarajan Dimension d. J. Comb. Theory A 95(1): 189-195 (2001) - [c37]Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr:
Low-Distortion Embeddings of Trees. GD 2001: 343-351 - [c36]Alon Amit, Nathan Linial, Jirí Matousek, Eyal Rozenman:
Random lifts of graphs. SODA 2001: 883-894 - 2000
- [j60]Jirí Matousek:
On the Signed Domination in Graphs. Comb. 20(1): 103-108 (2000) - [j59]Jirí Matousek:
On Approximate Geometric k-Clustering. Discret. Comput. Geom. 24(1): 61-84 (2000) - [j58]Jirí Matousek:
On the Linear and Hereditary Discrepancies. Eur. J. Comb. 21(4): 519-521 (2000) - [c35]Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron:
Reachability by paths of bounded curvature in convex polygons. SCG 2000: 251-259 - [p1]Jirí Matousek:
Derandomization in Computational Geometry. Handbook of Computational Geometry 2000: 559-595
1990 – 1999
- 1999
- [j57]Krystyna Trybulec Kuperberg, Wlodzimierz Kuperberg, Jirí Matousek, Pavel Valtr:
Almost-Tiling the Plane by Ellipses. Discret. Comput. Geom. 22(3): 367-375 (1999) - [j56]Hervé Brönnimann, Bernard Chazelle, Jirí Matousek:
Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM J. Comput. 28(5): 1552-1575 (1999) - [c34]Jirí Matousek:
The Anatomy of a Geometric Algorithm. GD 1999: 1-7 - 1998
- [b1]Jirí Matousek, Jaroslav Nesetril:
Invitation to discrete mathematics. Oxford University Press 1998, ISBN 978-0-19-850207-4, pp. I-XV, 1-410 - [j55]Jirí Matousek, David M. Mount, Nathan S. Netanyahu:
Efficient Randomized Algorithms for the Repeated Median Line Estimator. Algorithmica 20(2): 136-150 (1998) - [j54]Jirí Matousek, Petr Plechác:
On Functional Separately Convex Hulls. Discret. Comput. Geom. 19(1): 105-130 (1998) - [j53]Jirí Matousek:
On Constants for Cuttings in the Plane. Discret. Comput. Geom. 20(4): 427-448 (1998) - [j52]Jirí Matousek:
An Lp Version of the Beck-Fiala Conjecture. Eur. J. Comb. 19(2): 175-182 (1998) - [j51]Jirí Matousek:
The Exponent of Discrepancy Is at Least 1.0669. J. Complex. 14(4): 448-453 (1998) - [j50]Jirí Matousek:
On the L2-Discrepancy for Anchored Boxes. J. Complex. 14(4): 527-556 (1998) - [j49]Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf:
Computing Many Faces in Arrangements of Lines and Segments. SIAM J. Comput. 27(2): 491-505 (1998) - [j48]Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. SIAM J. Comput. 27(3): 654-667 (1998) - [c33]Jirí Matousek:
Geometric Computation and the Art of Sampling. FOCS 1998: 2 - 1997
- [j47]Jirí Matousek:
A Helly-Type Theorem for Unions of Convex Sets. Discret. Comput. Geom. 18(1): 1-12 (1997) - [c32]Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an Object from its Cast. SCG 1997: 221-230 - 1996
- [j46]Jirí Matousek, Micha Sharir, Emo Welzl:
A Subexponential Bound for Linear Programming. Algorithmica 16(4/5): 498-516 (1996) - [j45]Jirí Matousek, Otfried Schwarzkopf:
A Deterministic Algorithm for the Three-dimensional Diameter Problem. Comput. Geom. 6: 253-262 (1996) - [j44]Jirí Matousek:
Derandomization in Computational Geometry. J. Algorithms 20(3): 545-580 (1996) - [j43]Bernard Chazelle, Jirí Matousek:
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension. J. Algorithms 21(3): 579-597 (1996) - [j42]Jirí Matousek:
Note on the Colored Tverberg Theorem. J. Comb. Theory B 66(1): 146-151 (1996) - 1995
- [j41]Pankaj K. Agarwal, Jirí Matousek:
Dynamic Half-Space Range Reporting and Its Applications. Algorithmica 13(4): 325-345 (1995) - [j40]Bernard Chazelle, Jirí Matousek:
Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions. Comput. Geom. 5: 27-32 (1995) - [j39]Bernard Chazelle, Jirí Matousek, Micha Sharir:
An Elementary Approach to Lower Bounds in Geometric Discrepancy. Discret. Comput. Geom. 13: 363-381 (1995) - [j38]Jirí Matousek:
Tight Upper Bounds for the Discrepancy of Half-Spaces. Discret. Comput. Geom. 13: 593-601 (1995) - [j37]Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Piecewise Linear Paths Among Convex Obstacles. Discret. Comput. Geom. 14(1): 9-29 (1995) - [j36]Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir:
Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. Discret. Comput. Geom. 14(2): 113-122 (1995) - [j35]Jirí Matousek:
On Geometric Optimization with Few Violated Constraints. Discret. Comput. Geom. 14(4): 365-384 (1995) - [j34]Jirí Matousek:
On Enclosing k Points by a Circle. Inf. Process. Lett. 53(4): 217-221 (1995) - [j33]Jirí Matousek:
Approximations and Optimal Geometric Divide-an-Conquer. J. Comput. Syst. Sci. 50(2): 203-208 (1995) - [j32]Jirí Matousek, Vojtech Rödl:
On Ramsey Sets in Spheres. J. Comb. Theory A 70(1): 30-44 (1995) - [c31]Jirí Matousek:
A Helly-Type Theorem for Unions of Convex Sets. SCG 1995: 138-146 - 1994
- [j31]Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama:
Complexity of Projected Images of Convex Subdivisions. Comput. Geom. 4: 293-308 (1994) - [j30]Jirí Matousek:
Geometric Range Searching. ACM Comput. Surv. 26(4): 421-461 (1994) - [j29]Pankaj K. Agarwal, Jirí Matousek:
On Range Searching with Semialgebraic Sets. Discret. Comput. Geom. 11: 393-418 (1994) - [j28]Chi-Yuan Lo, Jirí Matousek, William L. Steiger:
Algorithms for Ham-Sandwich Cuts. Discret. Comput. Geom. 11: 433-452 (1994) - [j27]Jan Kratochvíl, Jirí Matousek:
Intersection Graphs of Segments. J. Comb. Theory B 62(2): 289-315 (1994) - [j26]Boris Aronov, Jirí Matousek, Micha Sharir:
On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. J. Comb. Theory A 65(2): 311-321 (1994) - [j25]Jirí Matousek:
Lower Bounds for a Subexponential Optimization Algorithm. Random Struct. Algorithms 5(4): 591-608 (1994) - [j24]Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl:
Fat Triangles Determine Linearly Many Holes. SIAM J. Comput. 23(1): 154-169 (1994) - [c30]Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. SCG 1994: 67-75 - [c29]Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf:
Computing Many Faces in Arrangements of Lines and Segments. SCG 1994: 76-84 - [c28]Jirí Matousek:
On Geometric Optimization with Few Violated Constraints. SCG 1994: 312-321 - 1993
- [j23]Jirí Matousek, Emo Welzl, Lorenz Wernisch:
Discrepancy and approximations for bounded VC-dimension. Comb. 13(4): 455-466 (1993) - [j22]Jirí Matousek:
Range Searching with Efficient Hiearchical Cutting. Discret. Comput. Geom. 10: 157-182 (1993) - [j21]Jirí Matousek, Otfried Schwarzkopf:
On Ray Shooting in Convex Polytopes. Discret. Comput. Geom. 10: 215-232 (1993) - [j20]Jirí Matousek:
Linear Optimization Queries. J. Algorithms 14(3): 432-448 (1993) - [j19]Pankaj K. Agarwal, Jirí Matousek:
Ray Shooting and Parametric Search. SIAM J. Comput. 22(4): 794-806 (1993) - [c27]Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir:
On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. CCCG 1993: 127-132 - [c26]Hervé Brönnimann, Bernard Chazelle, Jirí Matousek:
Product Range Spaces, Sensitive Sampling, and Derandomization. FOCS 1993: 400-409 - [c25]Jirí Matousek, David M. Mount, Nathan S. Netanyahu:
Efficient Randomized Algorithms for the Repeated Median Line Estimator. SODA 1993: 74-82 - [c24]Bernard Chazelle, Jirí Matousek:
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions. SODA 1993: 281-290 - [c23]Jirí Matousek, Otfried Schwarzkopf:
A deterministic algorithm for the three-dimensional diameter problem. STOC 1993: 478-484 - [c22]Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Piecewise linear paths among convex obstacles. STOC 1993: 505-514 - 1992
- [j18]Pankaj K. Agarwal, Jirí Matousek:
Relative Neighborhood Graphs in Three Dimensions. Comput. Geom. 2: 1-14 (1992) - [j17]Jirí Matousek:
Reporting Points in Halfspaces. Comput. Geom. 2: 169-186 (1992) - [j16]Jirí Matousek:
On Vertical Ray Shooting in Arrangements. Comput. Geom. 2: 279-285 (1992) - [j15]Jirí Matousek:
Efficient Partition Trees. Discret. Comput. Geom. 8: 315-334 (1992) - [j14]Jirí Matousek, Robin Thomas:
On the complexity of finding iso- and other morphisms for partial k-trees. Discret. Math. 108(1-3): 343-364 (1992) - [j13]Jirí Matousek, Emo Welzl:
Good Splitters for Counting Points in Triangles. J. Algorithms 13(2): 307-319 (1992) - [c21]Jirí Matousek, Micha Sharir, Emo Welzl:
A Subexponential Bound for Linear Programming. SCG 1992: 1-8 - [c20]Jirí Matousek, Otfried Schwarzkopf:
Linear Optimization Queries. SCG 1992: 16-25 - [c19]Jirí Matousek:
Range Searching with Efficient Hierarchical Cuttings. SCG 1992: 276-285 - [c18]Pankaj K. Agarwal, David Eppstein, Jirí Matousek:
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees. FOCS 1992: 80-89 - [c17]Jirí Matousek, Raimund Seidel:
A Tail Estimate for Mulmuley's Segment Intersection Algorithm. ICALP 1992: 427-438 - [c16]Pankaj K. Agarwal, Jirí Matousek:
On Range Searching with Semialgebraic Sets. MFCS 1992: 1-13 - [c15]Pankaj K. Agarwal, Jirí Matousek:
Relative Neighborhood Graphs in Three Dimensions. SODA 1992: 58-65 - [c14]Pankaj K. Agarwal, Jirí Matousek:
Ray Shooting and Parametric Search. STOC 1992: 517-526 - [c13]Chi-Yuan Lo, Jirí Matousek, William L. Steiger:
Ham-Sandwich Cuts in R^d. STOC 1992: 539-545 - 1991
- [j12]Pankaj K. Agarwal, Jirí Matousek, Subhash Suri:
Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. Comput. Geom. 1: 189-201 (1991) - [j11]Jirí Matousek:
Lower Bounds on the Length of Monotone Paths in Arrangement. Discret. Comput. Geom. 6: 129-134 (1991) - [j10]Jirí Matousek:
Cutting Hyperplane Arrangements. Discret. Comput. Geom. 6: 385-406 (1991) - [j9]Jirí Matousek:
Computing Dominances in E^n. Inf. Process. Lett. 38(5): 277-278 (1991) - [j8]Jirí Matousek:
Randomized Optimal Algorithm for Slope Selection. Inf. Process. Lett. 39(4): 183-187 (1991) - [j7]Jirí Matousek:
Spanning trees with low crossing number. RAIRO Theor. Informatics Appl. 25: 103-123 (1991) - [j6]Jirí Matousek, Robin Thomas:
Algorithms Finding Tree-Decompositions of Graphs. J. Algorithms 12(1): 1-22 (1991) - [j5]Jan Kratochvíl, Jirí Matousek:
String graphs requiring exponential representations. J. Comb. Theory B 53(1): 1-4 (1991) - [j4]Jirí Matousek:
Approximate Levels in Line Arrangements. SIAM J. Comput. 20(2): 222-227 (1991) - [c12]Jirí Matousek:
Efficient Partition Trees. SCG 1991: 1-9 - [c11]Boris Aronov, Jirí Matousek, Micha Sharir:
On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. SCG 1991: 307-313 - [c10]Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl:
Fat Triangles Determine Linearly Many Holes. FOCS 1991: 49-58 - [c9]Jirí Matousek:
Reporting Points in Halfspaces. FOCS 1991: 207-215 - [c8]Jirí Matousek, Emo Welzl, Lorenz Wernisch:
Discrepancy and epsilon-approximations for bounded VC-dimension. FOCS 1991: 424-430 - [c7]Jirí Matousek:
Approximations and Optimal Geometric Divide-And-Conquer. STOC 1991: 505-511 - [c6]Pankaj K. Agarwal, Jirí Matousek, Subhash Suri:
Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. WADS 1991: 105-116 - 1990
- [j3]Jirí Matousek:
Construction of epsilon-Nets. Discret. Comput. Geom. 5: 427-448 (1990) - [c5]Jirí Matousek:
Cutting Hyperplane Arrangements. SCG 1990: 1-9 - [c4]Jirí Matousek, Raimund Seidel, Emo Welzl:
How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces. SCG 1990: 16-22 - [c3]Jirí Matousek:
Computing the Center of Planar Point Sets. Discrete and Computational Geometry 1990: 221-230
1980 – 1989
- 1989
- [j2]Jirí Matousek:
On-Line Computation of Convolutions. Inf. Process. Lett. 32(1): 15-16 (1989) - [c2]Jirí Matousek:
Construction of epsilon Nets. SCG 1989: 1-10 - [c1]Jirí Matousek, Emo Welzl:
Good Splitters for Counting Points in Triangles. SCG 1989: 124-130 - 1988
- [j1]Jirí Matousek:
Line Arrangements and Range Search. Inf. Process. Lett. 27(6): 275-280 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
