Jirí Matousek

According to our database, Jirí Matousek authored at least 179 papers between 1988 and 2016.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2016

A zero-player graph game in NP $\cap$ coNP.

Jérôme Dohrau, Bernd Gärtner, Manuel Kohler, Jirí Matousek, Emo Welzl

CoRR, 2016

2015

Multilevel Polynomial Partitions and Simplified Range Searching.

Jirí Matousek, Zuzana Patáková

Discret. Comput. Geom., 2015

Three-Monotone Interpolation.

Josef Cibulka, Jirí Matousek, Pavel Paták

Discret. Comput. Geom., 2015

Simplifying Inclusion-Exclusion Formulas.

Xavier Goaoc, Jirí Matousek, Pavel Paták, Zuzana Safernová, Martin Tancer

Comb. Probab. Comput., 2015

Combinatorial Discrepancy for Boxes via the gamma_2 Norm.

Jirí Matousek, Aleksandar Nikolov

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension.

Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner

SIAM J. Comput., 2014

On Gromov's Method of Selecting Heavily Covered Points.

Jirí Matousek, Uli Wagner

Discret. Comput. Geom., 2014

Extendability of Continuous Maps Is Undecidable.

Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner

Discret. Comput. Geom., 2014

Near-Optimal Separators in String Graphs.

Jirí Matousek

Comb. Probab. Comput., 2014

Factorization Norms and Hereditary Discrepancy.

Jirí Matousek, Aleksandar Nikolov, Kunal Talwar

CoRR, 2014

Intersection graphs of segments and ∃ℝ.

Jirí Matousek

CoRR, 2014

Embeddability in the 3-sphere is decidable.

Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Lower bounds on geometric Ramsey functions.

Marek Eliás, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Curves in Rd intersecting every hyperplane at most d + 1 times.

Imre Bárány, Jirí Matousek, Attila Pór

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

String graphs and separators.

Jirí Matousek

Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014

2013

Polynomial-Time Homology for Simplicial Eilenberg-MacLane Spaces.

Marek Krcál, Jirí Matousek, Francis Sergeraert

Found. Comput. Math., 2013

Computing higher homotopy groups is W[1]-hard

Jirí Matousek

CoRR, 2013

String graphs and separators.

Jirí Matousek

CoRR, 2013

Extending continuous maps: polynomiality and undecidability.

Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner

Proceedings of the Symposium on Theory of Computing Conference, 2013

Untangling Two Systems of Noncrossing Curves.

Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner

Proceedings of the Graph Drawing - 21st International Symposium, 2013

On Lipschitz Mappings Onto a Square.

Jirí Matousek

Proceedings of the Mathematics of Paul Erdős I, 2013

2012

Vectors in a box.

Kevin Buchin, Jirí Matousek, Robin A. Moser, Dömötör Pálvölgyi

Math. Program., 2012

A Geometric Proof of the Colored Tverberg Theorem.

Jirí Matousek, Martin Tancer, Uli Wagner

Discret. Comput. Geom., 2012

Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique.

Haim Kaplan, Jirí Matousek, Micha Sharir

Discret. Comput. Geom., 2012

Unit Distances in Three Dimensions.

Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir

Comb. Probab. Comput., 2012

Reachability by paths of bounded curvature in a convex polygon.

Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron

Comput. Geom., 2012

Minimum and maximum against k lies.

Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein

Chic. J. Theor. Comput. Sci., 2012

Computing all maps into a sphere.

Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

On Range Searching with Semialgebraic Sets II.

Pankaj K. Agarwal, Jirí Matousek, Micha Sharir

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Higher-order Erdos-Szekeres theorems.

Marek Eliás, Jirí Matousek

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

A Doubly Exponentially Crumbled Cake.

Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno

Electron. Notes Discret. Math., 2011

On the Nonexistence of <i>k</i>-reptile Tetrahedra.

Jirí Matousek, Zuzana Safernová

Discret. Comput. Geom., 2011

The <i>t</i>-Pebbling Number is Eventually Linear in <i>t</i>.

Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein

Electron. J. Comb., 2011

2010

Stabbing Simplices by Points and Flats.

Boris Bukh, Jirí Matousek, Gabriel Nivasch

Discret. Comput. Geom., 2010

Distance k-sectors exist.

Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama

Comput. Geom., 2010

Minimum and Maximum against <i>k</i> Lies.

Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein

Proceedings of the Algorithm Theory, 2010

Zone diagrams in Euclidean spaces and in other normed spaces.

Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Distance <i>k</i>-sectors exist.

Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Dimension Gaps between Representability and Collapsibility.

Jirí Matousek, Martin Tancer

Discret. Comput. Geom., 2009

Removing Degeneracy in LP-Type Problems Revisited.

Jirí Matousek

Discret. Comput. Geom., 2009

Blocking Visibility for Points in General Position.

Jirí Matousek

Discret. Comput. Geom., 2009

Computing D-convex hulls in the plane.

Vojtech Franek, Jirí Matousek

Comput. Geom., 2009

Hardness of embedding simplicial complexes in <i>R</i>^d.

Jirí Matousek, Martin Tancer, Uli Wagner

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Lower bounds for weak epsilon-nets and stair-convexity.

Boris Bukh, Jirí Matousek, Gabriel Nivasch

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Invitation to Discrete Mathematics (2. ed.).

Jirí Matousek, Jaroslav Nesetril

Oxford University Press, ISBN: 978-0-19-857042-4, 2009

2008

On variants of the Johnson-Lindenstrauss lemma.

Jirí Matousek

Random Struct. Algorithms, 2008

Graph Colouring with No Large Monochromatic Components.

Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos

Comb. Probab. Comput., 2008

Hardness of embedding simplicial complexes in R^d

Jirí Matousek, Martin Tancer, Uli Wagner

CoRR, 2008

LC reductions yield isomorphic simplicial complexes.

Jirí Matousek

Contributions Discret. Math., 2008

Inapproximability for Metric Embeddings into R^d.

Jirí Matousek, Anastasios Sidiropoulos

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Removing Degeneracy May Require a Large Dimension Increase.

Jirí Matousek, Petr Skovron

Theory Comput., 2007

Quadratically Many Colorful Simplices.

Imre Bárány, Jirí Matousek

SIAM J. Discret. Math., 2007

Online Conflict-Free Coloring for Intervals.

Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl

SIAM J. Comput., 2007

Induced trees in triangle-free graphs.

Jirí Matousek, Robert Sámal

Electron. Notes Discret. Math., 2007

Removing degeneracy may require unbounded dimension increase.

Jirí Matousek, Petr Skovron

Electron. Notes Discret. Math., 2007

How many points can be reconstructed from k projections?

Jirí Matousek, Ales Prívetivý, Petr Skovron

Electron. Notes Discret. Math., 2007

Large Monochromatic Components in Two-colored Grids.

Jirí Matousek, Ales Prívetivý

Electron. Notes Discret. Math., 2007

Graph coloring with no large monochromatic components.

Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos

Electron. Notes Discret. Math., 2007

Packing Cones and Their Negatives in Space.

Imre Bárány, Jirí Matousek

Discret. Comput. Geom., 2007

Zone diagrams: existence, uniqueness and algorithmic challenge.

Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Understanding and using linear programming.

Bernd Gärtner, Jirí Matousek

Universitext, Springer, ISBN: 978-3-540-30697-9, 2007

2006

Segmenting object space by geometric reference structures.

Pankaj K. Agarwal, David J. Brady, Jirí Matousek

ACM Trans. Sens. Networks, 2006

Berge's theorem, fractional Helly, and art galleries.

Imre Bárány, Jirí Matousek

Discret. Math., 2006

k-Sets in Four Dimensions.

Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner

Discret. Comput. Geom., 2006

The Minimum Independence Number of a Hasse Diagram.

Jirí Matousek, Ales Prívetivý

Comb. Probab. Comput., 2006

Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness.

János Barát, Jirí Matousek, David R. Wood

Electron. J. Comb., 2006

The Number Of Unique-Sink Orientations of the Hypercube*.

Jirí Matousek

Comb., 2006

The distance trisector curve.

Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Violator Spaces: Structure and Algorithms.

Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron

Proceedings of the Algorithms, 2006

2005

The Randomized Integer Convex Hull.

Imre Bárány, Jirí Matousek

Discret. Comput. Geom., 2005

Discrepancy After Adding A Single Set.

Jeong Han Kim, Jirí Matousek, Van H. Vu

Comb., 2005

Towards asymptotic optimality in probabilistic packet marking.

Micah Adler, Jeff Edmonds, Jirí Matousek

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Online conflict-free coloring for intervals.

Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Low-Distortion Embeddings of Finite Metric Spaces.

Piotr Indyk, Jirí Matousek

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Crossing number, pair-crossing number, and expansion.

Petr Kolman, Jirí Matousek

J. Comb. Theory B, 2004

Triangles in random graphs.

Martin Loebl, Jirí Matousek, Ondrej Pangrác

Discret. Math., 2004

New Constructions of Weak epsilon-Nets.

Jirí Matousek, Uli Wagner

Discret. Comput. Geom., 2004

Bounded VC-Dimension Implies a Fractional Helly Theorem.

Jirí Matousek

Discret. Comput. Geom., 2004

No Helly Theorem for Stabbing Translates by Lines in R ³.

Andreas F. Holmsen, Jirí Matousek

Discret. Comput. Geom., 2004

A Combinatorial Proof of Kneser's Conjecture.

Jirí Matousek

Comb., 2004

Expected Length of the Longest Common Subsequence for Large Alphabets.

Marcos A. Kiwi, Martin Loebl, Jirí Matousek

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Nonexistence of 2-Reptile Simplices.

Jirí Matousek

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Random Edge Can Be Exponential on Abstract Cubes.

Jirí Matousek, Tibor Szabó

Proceedings of the 45th Symposium on Foundations of Computer Science, 2004

2003

On restricted min-wise independence of permutations.

Jirí Matousek, Milos Stojakovic

Random Struct. Algorithms, 2003

A Lower Bound on the Size of Lipschitz Subsets in Dimension 3.

Jirí Matousek

Comb. Probab. Comput., 2003

New constructions of weak epsilon-nets.

Jirí Matousek

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002

Random lifts of graphs: Independence and chromatic number.

Alon Amit, Nathan Linial, Jirí Matousek

Random Struct. Algorithms, 2002

A Lower Bound for Weak epsilon-Nets in High Dimension.

Jirí Matousek

Discret. Comput. Geom., 2002

Equipartition of Two Measures by a 4-Fan.

Imre Bárány, Jirí Matousek

Discret. Comput. Geom., 2002

Transversal numbers for hypergraphs arising in geometry.

Noga Alon, Gil Kalai, Jirí Matousek, Roy Meshulam

Adv. Appl. Math., 2002

The one-round Voronoi game.

Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

Lectures on discrete geometry.

Jirí Matousek

Graduate texts in mathematics 212, Springer, ISBN: 978-0-387-95373-1, 2002

Diskrete Mathematik - eine Entdeckungsreise (korrigierter Nachdruck).

Jirí Matousek, Jaroslav Nesetril

Springer-Lehrbuch, Springer, ISBN: 978-3-540-42386-7, 2002

2001

A Lower Bound for Families of Natarajan Dimension d.

Paul Fischer, Jirí Matousek

J. Comb. Theory A, 2001

Transversals of hypergraphs with geometric flavor.

Jirí Matousek

Electron. Notes Discret. Math., 2001

Lower bound on the minus-domination number.

Jirí Matousek

Discret. Math., 2001

Lower Bounds on the Transversal Numbers of <i>d</i>-Intervals.

Jirí Matousek

Discret. Comput. Geom., 2001

On Directional Convexity.

Jirí Matousek

Discret. Comput. Geom., 2001

Simultaneous Partitions of Measures by <i>k</i>-Fans.

Imre Bárány, Jirí Matousek

Discret. Comput. Geom., 2001

Random lifts of graphs.

Alon Amit, Nathan Linial, Jirí Matousek, Eyal Rozenman

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Low-Distortion Embeddings of Trees.

Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr

Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000

On the Linear and Hereditary Discrepancies.

Jirí Matousek

Eur. J. Comb., 2000

On Approximate Geometric k-Clustering.

Jirí Matousek

Discret. Comput. Geom., 2000

On the Signed Domination in Graphs.

Jirí Matousek

Comb., 2000

Reachability by paths of bounded curvature in convex polygons.

Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Derandomization in Computational Geometry.

Jirí Matousek

Proceedings of the Handbook of Computational Geometry, 2000

1999

Almost-Tiling the Plane by Ellipses.

Krystyna Trybulec Kuperberg, Wlodzimierz Kuperberg, Jirí Matousek, Pavel Valtr

Discret. Comput. Geom., 1999

The Anatomy of a Geometric Algorithm.

Jirí Matousek

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

On the <i>L</i>₂-Discrepancy for Anchored Boxes.

Jirí Matousek

J. Complex., 1998

The Exponent of Discrepancy Is at Least 1.0669.

Jirí Matousek

J. Complex., 1998

An L_p Version of the Beck-Fiala Conjecture.

Jirí Matousek

Eur. J. Comb., 1998

On Functional Separately Convex Hulls.

Jirí Matousek, Petr Plechác

Discret. Comput. Geom., 1998

On Constants for Cuttings in the Plane.

Jirí Matousek

Discret. Comput. Geom., 1998

Geometric Computation and the Art of Sampling.

Jirí Matousek

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Invitation to discrete mathematics.

Jirí Matousek, Jaroslav Nesetril

Oxford University Press, ISBN: 978-0-19-850207-4, 1998

1997

Separating an Object from its Cast.

Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Note on the Colored Tverberg Theorem.

Jirí Matousek

J. Comb. Theory B, 1996

Derandomization in Computational Geometry.

Jirí Matousek

J. Algorithms, 1996

On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension.

Bernard Chazelle, Jirí Matousek

J. Algorithms, 1996

1995

On Ramsey Sets in Spheres.

Jirí Matousek, Vojtech Rödl

J. Comb. Theory A, 1995

Approximations and Optimal Geometric Divide-an-Conquer.

Jirí Matousek

J. Comput. Syst. Sci., 1995

On Enclosing k Points by a Circle.

Jirí Matousek

Inf. Process. Lett., 1995

Tight Upper Bounds for the Discrepancy of Half-Spaces.

Jirí Matousek

Discret. Comput. Geom., 1995

An Elementary Approach to Lower Bounds in Geometric Discrepancy.

Bernard Chazelle, Jirí Matousek, Micha Sharir

Discret. Comput. Geom., 1995

Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions.

Bernard Chazelle, Jirí Matousek

Comput. Geom., 1995

Dynamic Half-Space Range Reporting and Its Applications.

Pankaj K. Agarwal, Jirí Matousek

Algorithmica, 1995

A Helly-Type Theorem for Unions of Convex Sets.

Jirí Matousek

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Fat Triangles Determine Linearly Many Holes.

Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl

SIAM J. Comput., 1994

Lower Bounds for a Subexponential Optimization Algorithm.

Jirí Matousek

Random Struct. Algorithms, 1994

Intersection Graphs of Segments.

Jan Kratochvíl, Jirí Matousek

J. Comb. Theory B, 1994

Algorithms for Ham-Sandwich Cuts.

Chi-Yuan Lo, Jirí Matousek, William L. Steiger

Discret. Comput. Geom., 1994

Geometric Range Searching.

Jirí Matousek

ACM Comput. Surv., 1994

Complexity of Projected Images of Convex Subdivisions.

Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama

Comput. Geom., 1994

On Geometric Optimization with Few Violated Constraints.

Jirí Matousek

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Computing Many Faces in Arrangements of Lines and Segments.

Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Constructing Levels in Arrangements and Higher Order Voronoi Diagrams.

Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993

Linear Optimization Queries.

Jirí Matousek

J. Algorithms, 1993

On Ray Shooting in Convex Polytopes.

Jirí Matousek, Otfried Schwarzkopf

Discret. Comput. Geom., 1993

Range Searching with Efficient Hiearchical Cutting.

Jirí Matousek

Discret. Comput. Geom., 1993

Discrepancy and approximations for bounded VC-dimension.

Jirí Matousek, Emo Welzl, Lorenz Wernisch

Comb., 1993

A deterministic algorithm for the three-dimensional diameter problem.

Jirí Matousek, Otfried Schwarzkopf

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Piecewise linear paths among convex obstacles.

Mark de Berg, Jirí Matousek, Otfried Schwarzkopf

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Efficient Randomized Algorithms for the Repeated Median Line Estimator.

Jirí Matousek, David M. Mount, Nathan S. Netanyahu

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions.

Bernard Chazelle, Jirí Matousek

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Product Range Spaces, Sensitive Sampling, and Derandomization

Hervé Brönnimann, Bernard Chazelle, Jirí Matousek

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions.

Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

On the complexity of finding iso- and other morphisms for partial k-trees.

Jirí Matousek, Robin Thomas

Discret. Math., 1992

On Vertical Ray Shooting in Arrangements.

Jirí Matousek

Comput. Geom., 1992

Ham-Sandwich Cuts in R^d

Chi-Yuan Lo, Jirí Matousek, William L. Steiger

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Ray Shooting and Parametric Search

Pankaj K. Agarwal, Jirí Matousek

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Relative Neighborhood Graphs in Three Dimensions.

Pankaj K. Agarwal, Jirí Matousek

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

On Range Searching with Semialgebraic Sets.

Pankaj K. Agarwal, Jirí Matousek

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

A Tail Estimate for Mulmuley's Segment Intersection Algorithm.

Jirí Matousek, Raimund Seidel

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees

Pankaj K. Agarwal, David Eppstein, Jirí Matousek

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

A Subexponential Bound for Linear Programming.

Jirí Matousek, Micha Sharir, Emo Welzl

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

Linear Optimization Queries.

Jirí Matousek, Otfried Schwarzkopf

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

Range Searching with Efficient Hierarchical Cuttings.

Jirí Matousek

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

Approximate Levels in Line Arrangements.

Jirí Matousek

SIAM J. Comput., 1991

String graphs requiring exponential representations.

Jan Kratochvíl, Jirí Matousek

J. Comb. Theory B, 1991

Algorithms Finding Tree-Decompositions of Graphs.

Jirí Matousek, Robin Thomas

J. Algorithms, 1991

Spanning trees with low crossing number.

Jirí Matousek

RAIRO Theor. Informatics Appl., 1991

Randomized Optimal Algorithm for Slope Selection

Jirí Matousek

Inf. Process. Lett., 1991

Computing Dominances in E^n.

Jirí Matousek

Inf. Process. Lett., 1991

Lower Bounds on the Length of Monotone Paths in Arrangement.

Jirí Matousek

Discret. Comput. Geom., 1991

Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions.

Pankaj K. Agarwal, Jirí Matousek, Subhash Suri

Comput. Geom., 1991

Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions.

Pankaj K. Agarwal, Jirí Matousek, Subhash Suri

Proceedings of the Algorithms and Data Structures, 1991

Approximations and Optimal Geometric Divide-And-Conquer

Jirí Matousek

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Discrepancy and epsilon-approximations for bounded VC-dimension

Jirí Matousek, Emo Welzl, Lorenz Wernisch

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Fat Triangles Determine Linearly Many Holes

Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Reporting Points in Halfspaces

Jirí Matousek

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Efficient Partition Trees.

Jirí Matousek

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

On the Sum of Squares of Cell Complexities in Hyperplane Arrangements.

Boris Aronov, Jirí Matousek, Micha Sharir

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Computing the Center of Planar Point Sets.

Jirí Matousek

Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces.

Jirí Matousek, Raimund Seidel, Emo Welzl

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Cutting Hyperplane Arrangements.

Jirí Matousek

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

On-Line Computation of Convolutions.

Jirí Matousek

Inf. Process. Lett., 1989

Good Splitters for Counting Points in Triangles.

Jirí Matousek, Emo Welzl

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

Construction of epsilon Nets.

Jirí Matousek

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Line Arrangements and Range Search.

Jirí Matousek

Inf. Process. Lett., 1988