Jirí Matousek

231 papers A* 30A 4B 3Journal 159Unranked 25

Year	Rank	Type	Title / Venue / Authors
2018	J	`jnl`	Embeddability in the 3-Sphere Is Decidable. J. ACM Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
2016	J	`jnl`	A zero-player graph game in NP $\cap$ coNP. CoRR Jérôme Dohrau, Bernd Gärtner, Manuel Kohler, Jirí Matousek, Emo Welzl
2015	A*	`conf`	Combinatorial Discrepancy for Boxes via the gamma_2 Norm. SoCG Jirí Matousek, Aleksandar Nikolov
2015	J	`jnl`	Multilevel Polynomial Partitions and Simplified Range Searching. Discret. Comput. Geom. Jirí Matousek, Zuzana Patáková
2015	J	`jnl`	Simplifying Inclusion-Exclusion Formulas. Comb. Probab. Comput. Xavier Goaoc, Jirí Matousek, Pavel Paták, Zuzana Safernová, Martin Tancer
2015	J	`jnl`	Three-Monotone Interpolation. Discret. Comput. Geom. Josef Cibulka, Jirí Matousek, Pavel Paták
2014	J	`jnl`	Computing All Maps into a Sphere. J. ACM Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner
2014	A*	`conf`	Curves in Rd intersecting every hyperplane at most d + 1 times. SoCG Imre Bárány, Jirí Matousek, Attila Pór
2014	A*	`conf`	Embeddability in the 3-sphere is decidable. SoCG Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
2014	J	`jnl`	Embeddability in the 3-sphere is decidable. CoRR Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
2014	J	`jnl`	Extendability of Continuous Maps Is Undecidable. Discret. Comput. Geom. Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
2014	J	`jnl`	Factorization Norms and Hereditary Discrepancy. CoRR Jirí Matousek, Aleksandar Nikolov, Kunal Talwar
2014	—	`book`	Geometry, Structure and Randomness in Combinatorics Jirí Matousek, Jaroslav Nesetril, Marco Pellegrini
2014	J	`jnl`	Intersection graphs of segments and ∃ℝ. CoRR Jirí Matousek
2014	J	`jnl`	Lower Bounds on Geometric Ramsey Functions. SIAM J. Discret. Math. Marek Eliás, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová
2014	A*	`conf`	Lower bounds on geometric Ramsey functions. SoCG Marek Eliás, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová
2014	J	`jnl`	Multilevel polynomial partitions and simplified range searching. CoRR Jirí Matousek, Zuzana Safernová
2014	J	`jnl`	Near-Optimal Separators in String Graphs. Comb. Probab. Comput. Jirí Matousek
2014	J	`jnl`	On Gromov's Method of Selecting Heavily Covered Points. Discret. Comput. Geom. Jirí Matousek, Uli Wagner
2014	J	`jnl`	Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension. SIAM J. Comput. Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
2014	—	`ch.`	String graphs and separators. Geometry, Structure and Randomness in Combinatorics Jirí Matousek
2014	J	`jnl`	Three-monotone interpolation. CoRR Josef Cibulka, Jirí Matousek, Pavel Paták
2013	J	`jnl`	Computing higher homotopy groups is W[1]-hard CoRR Jirí Matousek
2013	J	`jnl`	Extendability of continuous maps is undecidable CoRR Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
2013	A*	`conf`	Extending continuous maps: polynomiality and undecidability. STOC Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
2013	J	`jnl`	Near-optimal separators in string graphs CoRR Jirí Matousek
2013	—	`ch.`	On Lipschitz Mappings Onto a Square. The Mathematics of Paul Erdős I Jirí Matousek
2013	J	`jnl`	On Range Searching with Semialgebraic Sets. II. SIAM J. Comput. Pankaj K. Agarwal, Jirí Matousek, Micha Sharir
2013	J	`jnl`	Polynomial-Time Homology for Simplicial Eilenberg-MacLane Spaces. Found. Comput. Math. Marek Krcál, Jirí Matousek, Francis Sergeraert
2013	J	`jnl`	String graphs and separators. CoRR Jirí Matousek
2013	A	`conf`	Untangling Two Systems of Noncrossing Curves. GD Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
2012	J	`jnl`	A Geometric Proof of the Colored Tverberg Theorem. Discret. Comput. Geom. Jirí Matousek, Martin Tancer, Uli Wagner
2012	A*	`conf`	Computing all maps into a sphere. SODA Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner
2012	—	`conf`	Higher-order Erdos-Szekeres theorems. SCG Marek Eliás, Jirí Matousek
2012	J	`jnl`	Minimum and maximum against k lies. Chic. J. Theor. Comput. Sci. Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2012	J	`jnl`	On Range Searching with Semialgebraic Sets II CoRR Pankaj K. Agarwal, Jirí Matousek, Micha Sharir
2012	A*	`conf`	On Range Searching with Semialgebraic Sets II. FOCS Pankaj K. Agarwal, Jirí Matousek, Micha Sharir
2012	J	`jnl`	Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension CoRR Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner
2012	J	`jnl`	Polynomial-time homology for simplicial Eilenberg-MacLane spaces CoRR Marek Krcál, Jirí Matousek, Francis Sergeraert
2012	J	`jnl`	Reachability by paths of bounded curvature in a convex polygon. Comput. Geom. Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron
2012	J	`jnl`	Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique. Discret. Comput. Geom. Haim Kaplan, Jirí Matousek, Micha Sharir
2012	J	`jnl`	Unit Distances in Three Dimensions. Comb. Probab. Comput. Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir
2012	J	`jnl`	Vectors in a box. Math. Program. Kevin Buchin, Jirí Matousek, Robin A. Moser, Dömötör Pálvölgyi
2011	J	`jnl`	A Doubly Exponentially Crumbled Cake CoRR Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno
2011	J	`jnl`	A Doubly Exponentially Crumbled Cake. Electron. Notes Discret. Math. Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno
2011	J	`jnl`	Computing all maps into a sphere CoRR Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner
2011	J	`jnl`	Higher-order Erdos-Szekeres theorems CoRR Marek Eliás, Jirí Matousek
2011	J	`jnl`	On Gromov's Method of Selecting Heavily Covered Points CoRR Jirí Matousek, Uli Wagner
2011	J	`jnl`	On the Nonexistence of Discret. Comput. Geom. Jirí Matousek, Zuzana Safernová
2011	J	`jnl`	The Electron. J. Comb. Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2010	—	`conf`	Distance SCG Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama
2010	J	`jnl`	Distance k-sectors exist. Comput. Geom. Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama
2010	—	`conf`	Minimum and Maximum against SWAT Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2010	J	`jnl`	Minimum and maximum against k lies CoRR Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2010	J	`jnl`	Reachability by Paths of Bounded Curvature in a Convex Polygon CoRR Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron
2010	J	`jnl`	Stabbing Simplices by Points and Flats. Discret. Comput. Geom. Boris Bukh, Jirí Matousek, Gabriel Nivasch
2010	—	`conf`	Zone diagrams in Euclidean spaces and in other normed spaces. SCG Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama
2009	J	`jnl`	Blocking Visibility for Points in General Position. Discret. Comput. Geom. Jirí Matousek
2009	J	`jnl`	Computing D-convex hulls in the plane. Comput. Geom. Vojtech Franek, Jirí Matousek
2009	J	`jnl`	Dimension Gaps between Representability and Collapsibility. Discret. Comput. Geom. Jirí Matousek, Martin Tancer
2009	J	`jnl`	Distance k-Sectors Exist CoRR Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama
2009	A*	`conf`	Hardness of embedding simplicial complexes in SODA Jirí Matousek, Martin Tancer, Uli Wagner
2009	—	`book`	Invitation to Discrete Mathematics (2. ed.). Jirí Matousek, Jaroslav Nesetril
2009	—	`conf`	Lower bounds for weak epsilon-nets and stair-convexity. SCG Boris Bukh, Jirí Matousek, Gabriel Nivasch
2009	J	`jnl`	Removing Degeneracy in LP-Type Problems Revisited. Discret. Comput. Geom. Jirí Matousek
2009	J	`jnl`	Zone Diagrams in Euclidean Spaces and in Other Normed Spaces CoRR Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama
2008	J	`jnl`	Graph Colouring with No Large Monochromatic Components. Comb. Probab. Comput. Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos
2008	J	`jnl`	Hardness of embedding simplicial complexes in R CoRR Jirí Matousek, Martin Tancer, Uli Wagner
2008	J	`jnl`	How Many Points Can Be Reconstructed from k Projections? SIAM J. Discret. Math. Jirí Matousek, Ales Prívetivý, Petr Skovron
2008	A*	`conf`	Inapproximability for Metric Embeddings into R^d. FOCS Jirí Matousek, Anastasios Sidiropoulos
2008	J	`jnl`	Inapproximability for metric embeddings into R^d CoRR Jirí Matousek, Anastasios Sidiropoulos
2008	J	`jnl`	Induced Trees in Triangle-Free Graphs. Electron. J. Comb. Jirí Matousek, Robert Sámal
2008	J	`jnl`	LC reductions yield isomorphic simplicial complexes. Contributions Discret. Math. Jirí Matousek
2008	J	`jnl`	Large Monochromatic Components in Two-Colored Grids. SIAM J. Discret. Math. Jirí Matousek, Ales Prívetivý
2008	J	`jnl`	Lower bounds for weak epsilon-nets and stair-convexity. CoRR Boris Bukh, Jirí Matousek, Gabriel Nivasch
2008	J	`jnl`	On variants of the Johnson-Lindenstrauss lemma. Random Struct. Algorithms Jirí Matousek
2008	J	`jnl`	Stabbing simplices by points and flats CoRR Boris Bukh, Jirí Matousek, Gabriel Nivasch
2008	J	`jnl`	Violator spaces: Structure and algorithms. Discret. Appl. Math. Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron
2007	J	`jnl`	Graph coloring with no large monochromatic components. Electron. Notes Discret. Math. Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos
2007	J	`jnl`	How many points can be reconstructed from k projections? Electron. Notes Discret. Math. Jirí Matousek, Ales Prívetivý, Petr Skovron
2007	J	`jnl`	Induced trees in triangle-free graphs. Electron. Notes Discret. Math. Jirí Matousek, Robert Sámal
2007	J	`jnl`	Large Monochromatic Components in Two-colored Grids. Electron. Notes Discret. Math. Jirí Matousek, Ales Prívetivý
2007	J	`jnl`	Online Conflict-Free Coloring for Intervals. SIAM J. Comput. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
2007	J	`jnl`	Packing Cones and Their Negatives in Space. Discret. Comput. Geom. Imre Bárány, Jirí Matousek
2007	J	`jnl`	Quadratically Many Colorful Simplices. SIAM J. Discret. Math. Imre Bárány, Jirí Matousek
2007	J	`jnl`	Removing Degeneracy May Require a Large Dimension Increase. Theory Comput. Jirí Matousek, Petr Skovron
2007	J	`jnl`	Removing degeneracy may require unbounded dimension increase. Electron. Notes Discret. Math. Jirí Matousek, Petr Skovron
2007	—	`book`	Understanding and using linear programming. Bernd Gärtner, Jirí Matousek
2007	J	`jnl`	Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge. SIAM J. Comput. Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
2007	A*	`conf`	Zone diagrams: existence, uniqueness and algorithmic challenge. SODA Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
2006	J	`jnl`	Berge's theorem, fractional Helly, and art galleries. Discret. Math. Imre Bárány, Jirí Matousek
2006	J	`jnl`	Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. Electron. J. Comb. János Barát, Jirí Matousek, David R. Wood
2006	J	`jnl`	Segmenting object space by geometric reference structures. ACM Trans. Sens. Networks Pankaj K. Agarwal, David J. Brady, Jirí Matousek
2006	J	`jnl`	The Minimum Independence Number of a Hasse Diagram. Comb. Probab. Comput. Jirí Matousek, Ales Prívetivý
2006	J	`jnl`	The Number Of Unique-Sink Orientations of the Hypercube*. Comb. Jirí Matousek
2006	A*	`conf`	The distance trisector curve. STOC Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
2006	J	`jnl`	Violator Spaces: Structure and Algorithms CoRR Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron
2006	A	`conf`	Violator Spaces: Structure and Algorithms. ESA Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron
2006	J	`jnl`	k-Sets in Four Dimensions. Discret. Comput. Geom. Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner
2005	J	`jnl`	Discrepancy After Adding A Single Set. Comb. Jeong Han Kim, Jirí Matousek, Van H. Vu
2005	A*	`conf`	Online conflict-free coloring for intervals. SODA Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
2005	J	`jnl`	The Randomized Integer Convex Hull. Discret. Comput. Geom. Imre Bárány, Jirí Matousek
2005	A*	`conf`	Towards asymptotic optimality in probabilistic packet marking. STOC Micah Adler, Jeff Edmonds, Jirí Matousek
2004	J	`jnl`	A Combinatorial Proof of Kneser's Conjecture. Comb. Jirí Matousek
2004	J	`jnl`	Bounded VC-Dimension Implies a Fractional Helly Theorem. Discret. Comput. Geom. Jirí Matousek
2004	J	`jnl`	Crossing number, pair-crossing number, and expansion. J. Comb. Theory B Petr Kolman, Jirí Matousek
2004	B	`conf`	Expected Length of the Longest Common Subsequence for Large Alphabets. LATIN Marcos A. Kiwi, Martin Loebl, Jirí Matousek
2004	—	`ch.`	Low-Distortion Embeddings of Finite Metric Spaces. Handbook of Discrete and Computational Geometry, 2nd Ed. Piotr Indyk, Jirí Matousek
2004	J	`jnl`	New Constructions of Weak epsilon-Nets. Discret. Comput. Geom. Jirí Matousek, Uli Wagner
2004	J	`jnl`	No Helly Theorem for Stabbing Translates by Lines in R Discret. Comput. Geom. Andreas F. Holmsen, Jirí Matousek
2004	—	`conf`	Nonexistence of 2-Reptile Simplices. JCDCG Jirí Matousek
2004	A*	`conf`	Random Edge Can Be Exponential on Abstract Cubes. FOCS Jirí Matousek, Tibor Szabó
2004	J	`jnl`	The One-Round Voronoi Game. Discret. Comput. Geom. Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
2004	J	`jnl`	Triangles in random graphs. Discret. Math. Martin Loebl, Jirí Matousek, Ondrej Pangrác
2003	J	`jnl`	A Lower Bound on the Size of Lipschitz Subsets in Dimension 3. Comb. Probab. Comput. Jirí Matousek
2003	J	`jnl`	Low-Distortion Embeddings of Trees. J. Graph Algorithms Appl. Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr
2003	—	`conf`	New constructions of weak epsilon-nets. SCG Jirí Matousek
2003	J	`jnl`	On restricted min-wise independence of permutations. Random Struct. Algorithms Jirí Matousek, Milos Stojakovic
2002	J	`jnl`	A Lower Bound for Weak epsilon-Nets in High Dimension. Discret. Comput. Geom. Jirí Matousek
2002	—	`book`	Diskrete Mathematik - eine Entdeckungsreise (korrigierter Nachdruck). Jirí Matousek, Jaroslav Nesetril
2002	J	`jnl`	Equipartition of Two Measures by a 4-Fan. Discret. Comput. Geom. Imre Bárány, Jirí Matousek
2002	—	`book`	Lectures on discrete geometry. Jirí Matousek
2002	J	`jnl`	Random lifts of graphs: Independence and chromatic number. Random Struct. Algorithms Alon Amit, Nathan Linial, Jirí Matousek
2002	J	`jnl`	Separating an object from its cast. Comput. Aided Des. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
2002	—	`conf`	The one-round Voronoi game. SCG Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
2002	J	`jnl`	Transversal numbers for hypergraphs arising in geometry. Adv. Appl. Math. Noga Alon, Gil Kalai, Jirí Matousek, Roy Meshulam
2001	J	`jnl`	A Lower Bound for Families of Natarajan Dimension d. J. Comb. Theory A Paul Fischer, Jirí Matousek
2001	A	`conf`	Low-Distortion Embeddings of Trees. GD Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr
2001	J	`jnl`	Lower Bounds on the Transversal Numbers of Discret. Comput. Geom. Jirí Matousek
2001	J	`jnl`	Lower bound on the minus-domination number. Discret. Math. Jirí Matousek
2001	J	`jnl`	On Directional Convexity. Discret. Comput. Geom. Jirí Matousek
2001	A*	`conf`	Random lifts of graphs. SODA Alon Amit, Nathan Linial, Jirí Matousek, Eyal Rozenman
2001	J	`jnl`	Simultaneous Partitions of Measures by Discret. Comput. Geom. Imre Bárány, Jirí Matousek
2001	J	`jnl`	Transversals of hypergraphs with geometric flavor. Electron. Notes Discret. Math. Jirí Matousek
2000	—	`ch.`	Derandomization in Computational Geometry. Handbook of Computational Geometry Jirí Matousek
2000	J	`jnl`	On Approximate Geometric k-Clustering. Discret. Comput. Geom. Jirí Matousek
2000	J	`jnl`	On the Linear and Hereditary Discrepancies. Eur. J. Comb. Jirí Matousek
2000	J	`jnl`	On the Signed Domination in Graphs. Comb. Jirí Matousek
2000	—	`conf`	Reachability by paths of bounded curvature in convex polygons. SCG Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron
1999	J	`jnl`	Almost-Tiling the Plane by Ellipses. Discret. Comput. Geom. Krystyna Trybulec Kuperberg, Wlodzimierz Kuperberg, Jirí Matousek, Pavel Valtr
1999	J	`jnl`	Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM J. Comput. Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
1999	A	`conf`	The Anatomy of a Geometric Algorithm. GD Jirí Matousek
1998	J	`jnl`	An L Eur. J. Comb. Jirí Matousek
1998	J	`jnl`	Computing Many Faces in Arrangements of Lines and Segments. SIAM J. Comput. Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf
1998	J	`jnl`	Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. SIAM J. Comput. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
1998	J	`jnl`	Efficient Randomized Algorithms for the Repeated Median Line Estimator. Algorithmica Jirí Matousek, David M. Mount, Nathan S. Netanyahu
1998	A*	`conf`	Geometric Computation and the Art of Sampling. FOCS Jirí Matousek
1998	—	`book`	Invitation to discrete mathematics. Jirí Matousek, Jaroslav Nesetril
1998	J	`jnl`	On Constants for Cuttings in the Plane. Discret. Comput. Geom. Jirí Matousek
1998	J	`jnl`	On Functional Separately Convex Hulls. Discret. Comput. Geom. Jirí Matousek, Petr Plechác
1998	J	`jnl`	On the J. Complex. Jirí Matousek
1998	J	`jnl`	The Exponent of Discrepancy Is at Least 1.0669. J. Complex. Jirí Matousek
1997	J	`jnl`	A Helly-Type Theorem for Unions of Convex Sets. Discret. Comput. Geom. Jirí Matousek
1997	—	`conf`	Separating an Object from its Cast. SCG Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
1996	J	`jnl`	A Deterministic Algorithm for the Three-dimensional Diameter Problem. Comput. Geom. Jirí Matousek, Otfried Schwarzkopf
1996	J	`jnl`	A Subexponential Bound for Linear Programming. Algorithmica Jirí Matousek, Micha Sharir, Emo Welzl
1996	J	`jnl`	Derandomization in Computational Geometry. J. Algorithms Jirí Matousek
1996	J	`jnl`	Note on the Colored Tverberg Theorem. J. Comb. Theory B Jirí Matousek
1996	J	`jnl`	On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension. J. Algorithms Bernard Chazelle, Jirí Matousek
1995	—	`conf`	A Helly-Type Theorem for Unions of Convex Sets. SCG Jirí Matousek
1995	J	`jnl`	An Elementary Approach to Lower Bounds in Geometric Discrepancy. Discret. Comput. Geom. Bernard Chazelle, Jirí Matousek, Micha Sharir
1995	J	`jnl`	Approximations and Optimal Geometric Divide-an-Conquer. J. Comput. Syst. Sci. Jirí Matousek
1995	J	`jnl`	Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions. Comput. Geom. Bernard Chazelle, Jirí Matousek
1995	J	`jnl`	Dynamic Half-Space Range Reporting and Its Applications. Algorithmica Pankaj K. Agarwal, Jirí Matousek
1995	J	`jnl`	On Enclosing k Points by a Circle. Inf. Process. Lett. Jirí Matousek
1995	J	`jnl`	On Geometric Optimization with Few Violated Constraints. Discret. Comput. Geom. Jirí Matousek
1995	J	`jnl`	On Ramsey Sets in Spheres. J. Comb. Theory A Jirí Matousek, Vojtech Rödl
1995	J	`jnl`	Piecewise Linear Paths Among Convex Obstacles. Discret. Comput. Geom. Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
1995	J	`jnl`	Tight Upper Bounds for the Discrepancy of Half-Spaces. Discret. Comput. Geom. Jirí Matousek
1995	J	`jnl`	Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. Discret. Comput. Geom. Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir
1994	J	`jnl`	Algorithms for Ham-Sandwich Cuts. Discret. Comput. Geom. Chi-Yuan Lo, Jirí Matousek, William L. Steiger
1994	J	`jnl`	Complexity of Projected Images of Convex Subdivisions. Comput. Geom. Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama
1994	—	`conf`	Computing Many Faces in Arrangements of Lines and Segments. SCG Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf
1994	—	`conf`	Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. SCG Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
1994	J	`jnl`	Fat Triangles Determine Linearly Many Holes. SIAM J. Comput. Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
1994	J	`jnl`	Geometric Range Searching. ACM Comput. Surv. Jirí Matousek
1994	J	`jnl`	Intersection Graphs of Segments. J. Comb. Theory B Jan Kratochvíl, Jirí Matousek
1994	J	`jnl`	Lower Bounds for a Subexponential Optimization Algorithm. Random Struct. Algorithms Jirí Matousek
1994	—	`conf`	On Geometric Optimization with Few Violated Constraints. SCG Jirí Matousek
1994	J	`jnl`	On Range Searching with Semialgebraic Sets. Discret. Comput. Geom. Pankaj K. Agarwal, Jirí Matousek
1994	J	`jnl`	On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. J. Comb. Theory A Boris Aronov, Jirí Matousek, Micha Sharir
1993	A*	`conf`	A deterministic algorithm for the three-dimensional diameter problem. STOC Jirí Matousek, Otfried Schwarzkopf
1993	J	`jnl`	Discrepancy and approximations for bounded VC-dimension. Comb. Jirí Matousek, Emo Welzl, Lorenz Wernisch
1993	A*	`conf`	Efficient Randomized Algorithms for the Repeated Median Line Estimator. SODA Jirí Matousek, David M. Mount, Nathan S. Netanyahu
1993	J	`jnl`	Linear Optimization Queries. J. Algorithms Jirí Matousek
1993	A*	`conf`	On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions. SODA Bernard Chazelle, Jirí Matousek
1993	J	`jnl`	On Ray Shooting in Convex Polytopes. Discret. Comput. Geom. Jirí Matousek, Otfried Schwarzkopf
1993	—	`conf`	On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. CCCG Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir
1993	A*	`conf`	Piecewise linear paths among convex obstacles. STOC Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
1993	A*	`conf`	Product Range Spaces, Sensitive Sampling, and Derandomization FOCS Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
1993	J	`jnl`	Range Searching with Efficient Hiearchical Cutting. Discret. Comput. Geom. Jirí Matousek
1993	J	`jnl`	Ray Shooting and Parametric Search. SIAM J. Comput. Pankaj K. Agarwal, Jirí Matousek
1992	—	`conf`	A Subexponential Bound for Linear Programming. SCG Jirí Matousek, Micha Sharir, Emo Welzl
1992	A*	`conf`	A Tail Estimate for Mulmuley's Segment Intersection Algorithm. ICALP Jirí Matousek, Raimund Seidel
1992	A*	`conf`	Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees FOCS Pankaj K. Agarwal, David Eppstein, Jirí Matousek
1992	J	`jnl`	Efficient Partition Trees. Discret. Comput. Geom. Jirí Matousek
1992	J	`jnl`	Good Splitters for Counting Points in Triangles. J. Algorithms Jirí Matousek, Emo Welzl
1992	A*	`conf`	Ham-Sandwich Cuts in R^d STOC Chi-Yuan Lo, Jirí Matousek, William L. Steiger
1992	—	`conf`	Linear Optimization Queries. SCG Jirí Matousek, Otfried Schwarzkopf
1992	B	`conf`	On Range Searching with Semialgebraic Sets. MFCS Pankaj K. Agarwal, Jirí Matousek
1992	J	`jnl`	On Vertical Ray Shooting in Arrangements. Comput. Geom. Jirí Matousek
1992	J	`jnl`	On the complexity of finding iso- and other morphisms for partial k-trees. Discret. Math. Jirí Matousek, Robin Thomas
1992	—	`conf`	Range Searching with Efficient Hierarchical Cuttings. SCG Jirí Matousek
1992	A*	`conf`	Ray Shooting and Parametric Search STOC Pankaj K. Agarwal, Jirí Matousek
1992	A*	`conf`	Relative Neighborhood Graphs in Three Dimensions. SODA Pankaj K. Agarwal, Jirí Matousek
1992	J	`jnl`	Relative Neighborhood Graphs in Three Dimensions. Comput. Geom. Pankaj K. Agarwal, Jirí Matousek
1992	J	`jnl`	Reporting Points in Halfspaces. Comput. Geom. Jirí Matousek
1991	J	`jnl`	Algorithms Finding Tree-Decompositions of Graphs. J. Algorithms Jirí Matousek, Robin Thomas
1991	J	`jnl`	Approximate Levels in Line Arrangements. SIAM J. Comput. Jirí Matousek
1991	A*	`conf`	Approximations and Optimal Geometric Divide-And-Conquer STOC Jirí Matousek
1991	J	`jnl`	Computing Dominances in E^n. Inf. Process. Lett. Jirí Matousek
1991	J	`jnl`	Cutting Hyperplane Arrangements. Discret. Comput. Geom. Jirí Matousek
1991	A*	`conf`	Discrepancy and epsilon-approximations for bounded VC-dimension FOCS Jirí Matousek, Emo Welzl, Lorenz Wernisch
1991	—	`conf`	Efficient Partition Trees. SCG Jirí Matousek
1991	J	`jnl`	Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. Comput. Geom. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri
1991	B	`conf`	Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. WADS Pankaj K. Agarwal, Jirí Matousek, Subhash Suri
1991	A*	`conf`	Fat Triangles Determine Linearly Many Holes FOCS Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
1991	J	`jnl`	Lower Bounds on the Length of Monotone Paths in Arrangement. Discret. Comput. Geom. Jirí Matousek
1991	—	`conf`	On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. SCG Boris Aronov, Jirí Matousek, Micha Sharir
1991	J	`jnl`	Randomized Optimal Algorithm for Slope Selection Inf. Process. Lett. Jirí Matousek
1991	A*	`conf`	Reporting Points in Halfspaces FOCS Jirí Matousek
1991	J	`jnl`	Spanning trees with low crossing number. RAIRO Theor. Informatics Appl. Jirí Matousek
1991	J	`jnl`	String graphs requiring exponential representations. J. Comb. Theory B Jan Kratochvíl, Jirí Matousek
1990	—	`conf`	Computing the Center of Planar Point Sets. Discrete and Computational Geometry Jirí Matousek
1990	J	`jnl`	Construction of epsilon-Nets. Discret. Comput. Geom. Jirí Matousek
1990	—	`conf`	Cutting Hyperplane Arrangements. SCG Jirí Matousek
1990	—	`conf`	How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces. SCG Jirí Matousek, Raimund Seidel, Emo Welzl
1989	—	`conf`	Construction of epsilon Nets. SCG Jirí Matousek
1989	—	`conf`	Good Splitters for Counting Points in Triangles. SCG Jirí Matousek, Emo Welzl
1989	J	`jnl`	On-Line Computation of Convolutions. Inf. Process. Lett. Jirí Matousek
1988	J	`jnl`	Line Arrangements and Range Search. Inf. Process. Lett. Jirí Matousek