Jirí Matousek

	2012
181		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
180		Marek Krcál, Jirí Matousek, Francis Sergeraert: Polynomial-time homology for simplicial Eilenberg-MacLane spaces CoRR abs/1201.6222: (2012)
179		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)
178		Jirí Matousek, Martin Tancer, Uli Wagner: A Geometric Proof of the Colored Tverberg Theorem. Discrete & Computational Geometry 47(2): 245-265 (2012)
	2011
177		Jirí Matousek, Pavol Korcek: Precise IPv4/IPv6 packet generator based on NetCOPE platform. DDECS 2011: 319-324
176		Jirí Matousek, Uli Wagner: On Gromov's Method of Selecting Heavily Covered Points CoRR abs/1102.3515: (2011)
175		Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno: A Doubly Exponentially Crumbled Cake CoRR abs/1104.0122: (2011)
174		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)
173		Marek Elias, Jirí Matousek: Higher-order Erdos--Szekeres theorems CoRR abs/1111.3824: (2011)
172		Jirí Matousek, Zuzana Safernová: On the Nonexistence of k-reptile Tetrahedra. Discrete & Computational Geometry 46(3): 599-609 (2011)
171		Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: The t-Pebbling Number is Eventually Linear in t. Electr. J. Comb. 18(1): (2011)
170		Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno: A Doubly Exponentially Crumbled Cake. Electronic Notes in Discrete Mathematics 38: 265-271 (2011)
	2010
169		Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: Minimum and Maximum against k Lies. SWAT 2010: 139-149
168		Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama: Distance k-sectors exist. Symposium on Computational Geometry 2010: 210-215
167		Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama: Zone diagrams in Euclidean spaces and in other normed spaces. Symposium on Computational Geometry 2010: 216-221
166		Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: Minimum and maximum against k lies CoRR abs/1002.0562: (2010)
165		Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron: Reachability by Paths of Bounded Curvature in a Convex Polygon CoRR abs/1008.4244: (2010)
164		Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama: Distance k-sectors exist. Comput. Geom. 43(9): 713-720 (2010)
163		Boris Bukh, Jirí Matousek, Gabriel Nivasch: Stabbing Simplices by Points and Flats. Discrete & Computational Geometry 43(2): 321-338 (2010)
	2009
162		Jirí Matousek, Jaroslav Nesetril: Invitation to Discrete Mathematics (2. ed.). Oxford University Press 2009: I-XVII, 1-443
161		Jirí Matousek, Martin Tancer, Uli Wagner: Hardness of embedding simplicial complexes in Rd. SODA 2009: 855-864
160		Boris Bukh, Jirí Matousek, Gabriel Nivasch: Lower bounds for weak epsilon-nets and stair-convexity. Symposium on Computational Geometry 2009: 1-10
159		Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama: Zone Diagrams in Euclidean Spaces and in Other Normed Spaces CoRR abs/0912.3016: (2009)
158		Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama: Distance k-Sectors Exist CoRR abs/0912.4164: (2009)
157		Vojtech Franek, Jirí Matousek: Computing D-convex hulls in the plane. Comput. Geom. 42(1): 81-89 (2009)
156		Jirí Matousek: Blocking Visibility for Points in General Position. Discrete & Computational Geometry 42(2): 219-223 (2009)
155		Jirí Matousek: Removing Degeneracy in LP-Type Problems Revisited. Discrete & Computational Geometry 42(4): 517-526 (2009)
154		Jirí Matousek, Martin Tancer: Dimension Gaps between Representability and Collapsibility. Discrete & Computational Geometry 42(4): 631-639 (2009)
	2008
153		Jirí Matousek, Anastasios Sidiropoulos: Inapproximability for Metric Embeddings into R^d. FOCS 2008: 405-413
152		Boris Bukh, Jirí Matousek, Gabriel Nivasch: Stabbing simplices by points and flats CoRR abs/0804.4464: (2008)
151		Jirí Matousek, Martin Tancer, Uli Wagner: Hardness of embedding simplicial complexes in Rd CoRR abs/0807.0336: (2008)
150		Jirí Matousek, Anastasios Sidiropoulos: Inapproximability for metric embeddings into R^d CoRR abs/0807.2472: (2008)
149		Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos: Graph Colouring with No Large Monochromatic Components. Combinatorics, Probability & Computing 17(4): 577-589 (2008)
148		Jirí Matousek, Robert Sámal: Induced Trees in Triangle-Free Graphs. Electr. J. Comb. 15(1): (2008)
147		Jirí Matousek: On variants of the Johnson-Lindenstrauss lemma. Random Struct. Algorithms 33(2): 142-156 (2008)
146		Jirí Matousek, Ales Prívetivý: Large Monochromatic Components in Two-Colored Grids. SIAM J. Discrete Math. 22(1): 295-311 (2008)
145		Jirí Matousek, Ales Prívetivý, Petr Skovron: How Many Points Can Be Reconstructed from k Projections? SIAM J. Discrete Math. 22(4): 1605-1623 (2008)
	2007
144		Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama: Zone diagrams: existence, uniqueness and algorithmic challenge. SODA 2007: 756-765
143		Imre Bárány, Jirí Matousek: Packing Cones and Their Negatives in Space. Discrete & Computational Geometry 38(2): 177-187 (2007)
142		Jirí Matousek, Petr Skovron: Removing degeneracy may require unbounded dimension increase. Electronic Notes in Discrete Mathematics 29: 107-113 (2007)
141		Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos: Graph coloring with no large monochromatic components. Electronic Notes in Discrete Mathematics 29: 115-122 (2007)
140		Jirí Matousek, Ales Prívetivý: Large Monochromatic Components in Two-colored Grids. Electronic Notes in Discrete Mathematics 29: 3-9 (2007)
139		Jirí Matousek, Robert Sámal: Induced trees in triangle-free graphs. Electronic Notes in Discrete Mathematics 29: 307-313 (2007)
138		Jirí Matousek, Ales Prívetivý, Petr Skovron: How many points can be reconstructed from k projections? Electronic Notes in Discrete Mathematics 29: 427-434 (2007)
137		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)
136		Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama: Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge. SIAM J. Comput. 37(4): 1182-1198 (2007)
135		Imre Bárány, Jirí Matousek: Quadratically Many Colorful Simplices. SIAM J. Discrete Math. 21(1): 191-198 (2007)
134		Jirí Matousek, Petr Skovron: Removing Degeneracy May Require a Large Dimension Increase. Theory of Computing 3(1): 159-177 (2007)
	2006
133		Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron: Violator Spaces: Structure and Algorithms. ESA 2006: 387-398
132		Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama: The distance trisector curve. STOC 2006: 336-343
131		Jirí Matousek: The Number Of Unique-Sink Orientations of the Hypercube*. Combinatorica 26(1): 91-99 (2006)
130		Jirí Matousek, Ales Prívetivý: The Minimum Independence Number of a Hasse Diagram. Combinatorics, Probability & Computing 15(3): 473-475 (2006)
129		Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner: k-Sets in Four Dimensions. Discrete & Computational Geometry 35(2): 177-191 (2006)
128		Imre Bárány, Jirí Matousek: Berge's theorem, fractional Helly, and art galleries. Discrete Mathematics 306(19-20): 2303-2313 (2006)
127		János Barát, Jirí Matousek, David R. Wood: Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. Electr. J. Comb. 13(1): (2006)
126		Pankaj K. Agarwal, David J. Brady, Jirí Matousek: Segmenting object space by geometric reference structures. TOSN 2(4): 455-465 (2006)
	2005
125		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
124		Micah Adler, Jeff Edmonds, Jirí Matousek: Towards asymptotic optimality in probabilistic packet marking. STOC 2005: 450-459
123		Jeong Han Kim, Jirí Matousek, Van H. Vu: Discrepancy After Adding A Single Set. Combinatorica 25(4): 499-501 (2005)
122		Imre Bárány, Jirí Matousek: The Randomized Integer Convex Hull. Discrete & Computational Geometry 33(1): 3-25 (2005)
	2004
121		Jirí Matousek, Tibor Szabó: Random Edge Can Be Exponential on Abstract Cubes. FOCS 2004: 92-100
120		Jirí Matousek: Nonexistence of 2-Reptile Simplices. JCDCG 2004: 151-160
119		Marcos A. Kiwi, Martin Loebl, Jirí Matousek: Expected Length of the Longest Common Subsequence for Large Alphabets. LATIN 2004: 302-311
118		Jirí Matousek: A Combinatorial Proof of Kneser's Conjecture. Combinatorica 24(1): 163-170 (2004)
117		Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek: The One-Round Voronoi Game. Discrete & Computational Geometry 31(1): 125-138 (2004)
116		Jirí Matousek: Bounded VC-Dimension Implies a Fractional Helly Theorem. Discrete & Computational Geometry 31(2): 251-255 (2004)
115		Andreas Holmsen, Jirí Matousek: No Helly Theorem for Stabbing Translates by Lines in R 3. Discrete & Computational Geometry 31(3): 405-410 (2004)
114		Jirí Matousek, Uli Wagner: New Constructions of Weak epsilon-Nets. Discrete & Computational Geometry 32(2): 195-206 (2004)
113		Martin Loebl, Jirí Matousek, Ondrej Pangrác: Triangles in random graphs. Discrete Mathematics 289(1-3): 181-185 (2004)
112		Petr Kolman, Jirí Matousek: Crossing number, pair-crossing number, and expansion. J. Comb. Theory, Ser. B 92(1): 99-113 (2004)
	2003
111		Jirí Matousek: A Lower Bound on the Size of Lipschitz Subsets in Dimension 3. Combinatorics, Probability & Computing 12(4): 427-430 (2003)
110		Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr: Low-Distortion Embeddings of Trees. J. Graph Algorithms Appl. 7(4): 399-409 (2003)
109		Jirí Matousek, Milos Stojakovic: On restricted min-wise independence of permutations. Random Struct. Algorithms 23(4): 397-408 (2003)
	2002
108		Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek: The one-round Voronoi game. Symposium on Computational Geometry 2002: 97-101
107		Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf: Separating an object from its cast. Computer-Aided Design 34(8): 547-559 (2002)
106		Imre Bárány, Jirí Matousek: Equipartition of Two Measures by a 4-Fan. Discrete & Computational Geometry 27(3): 293-301 (2002)
105		Jirí Matousek: A Lower Bound for Weak epsilon-Nets in High Dimension. Discrete & Computational Geometry 28(1): 45-48 (2002)
104		Alon Amit, Nathan Linial, Jirí Matousek: Random lifts of graphs: Independence and chromatic number. Random Struct. Algorithms 20(1): 1-22 (2002)
	2001
103		Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr: Low-Distortion Embeddings of Trees. Graph Drawing 2001: 343-351
102		Alon Amit, Nathan Linial, Jirí Matousek, Eyal Rozenman: Random lifts of graphs. SODA 2001: 883-894
101		Imre Bárány, Jirí Matousek: Simultaneous Partitions of Measures by k-Fans. Discrete & Computational Geometry 25(3): 317-334 (2001)
100		Jirí Matousek: On Directional Convexity. Discrete & Computational Geometry 25(3): 389-403 (2001)
99		Jirí Matousek: Lower Bounds on the Transversal Numbers of d-Intervals. Discrete & Computational Geometry 26(3): 283-287 (2001)
98		Jirí Matousek: Lower bound on the minus-domination number. Discrete Mathematics 233(1-3): 361-370 (2001)
97		Jirí Matousek: Transversals of hypergraphs with geometric flavor. Electronic Notes in Discrete Mathematics 10: 194-197 (2001)
96		Paul Fischer, Jirí Matousek: A Lower Bound for Families of Natarajan Dimension d. J. Comb. Theory, Ser. A 95(1): 189-195 (2001)
	2000
95		Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron: Reachability by paths of bounded curvature in convex polygons. Symposium on Computational Geometry 2000: 251-259
94		Jirí Matousek: On the Signed Domination in Graphs. Combinatorica 20(1): 103-108 (2000)
93		Jirí Matousek: On Approximate Geometric k-Clustering. Discrete & Computational Geometry 24(1): 61-84 (2000)
92		Jirí Matousek: On the Linear and Hereditary Discrepancies. Eur. J. Comb. 21(4): 519-521 (2000)
	1999
91		Jirí Matousek: The Anatomy of a Geometric Algorithm. Graph Drawing 1999: 1-7
90		Krystyna Kuperberg, Wlodzimierz Kuperberg, Jirí Matousek, Pavel Valtr: Almost-Tiling the Plane by Ellipses. Discrete & Computational Geometry 22(3): 367-375 (1999)
89		Hervé Brönnimann, Bernard Chazelle, Jirí Matousek: Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM J. Comput. 28(5): 1552-1575 (1999)
	1998
88		Jirí Matousek, Jaroslav Nesetril: Invitation to discrete mathematics. Oxford University Press 1998: I-XV, 1-410
87		Jirí Matousek: Geometric Computation and the Art of Sampling. FOCS 1998: 2
86		Jirí Matousek, David M. Mount, Nathan S. Netanyahu: Efficient Randomized Algorithms for the Repeated Median Line Estimator. Algorithmica 20(2): 136-150 (1998)
85		Jirí Matousek, Petr Plechác: On Functional Separately Convex Hulls. Discrete & Computational Geometry 19(1): 105-130 (1998)
84		Jirí Matousek: On Constants for Cuttings in the Plane. Discrete & Computational Geometry 20(4): 427-448 (1998)
83		Jirí Matousek: An Lp Version of the Beck-Fiala Conjecture. Eur. J. Comb. 19(2): 175-182 (1998)
82		Jirí Matousek: The Exponent of Discrepancy Is at Least 1.0669. J. Complexity 14(4): 448-453 (1998)
81		Jirí Matousek: On the L2-Discrepancy for Anchored Boxes. J. Complexity 14(4): 527-556 (1998)
80		Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf: Computing Many Faces in Arrangements of Lines and Segments. SIAM J. Comput. 27(2): 491-505 (1998)
79		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)
	1997
78		Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf: Separating an Object from its Cast. Symposium on Computational Geometry 1997: 221-230
77		Jirí Matousek: A Helly-Type Theorem for Unions of Convex Sets. Discrete & Computational Geometry 18(1): 1-12 (1997)
	1996
76		Jirí Matousek, Micha Sharir, Emo Welzl: A Subexponential Bound for Linear Programming. Algorithmica 16(4/5): 498-516 (1996)
75		Jirí Matousek, Otfried Schwarzkopf: A Deterministic Algorithm for the Three-dimensional Diameter Problem. Comput. Geom. 6: 253-262 (1996)
74		Jirí Matousek: Derandomization in Computational Geometry. J. Algorithms 20(3): 545-580 (1996)
73		Bernard Chazelle, Jirí Matousek: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension. J. Algorithms 21(3): 579-597 (1996)
72		Jirí Matousek: Note on the Colored Tverberg Theorem. J. Comb. Theory, Ser. B 66(1): 146-151 (1996)
	1995
71		Jirí Matousek: A Helly-Type Theorem for Unions of Convex Sets. Symposium on Computational Geometry 1995: 138-146
70		Pankaj K. Agarwal, Jirí Matousek: Dynamic Half-Space Range Reporting and Its Applications. Algorithmica 13(4): 325-345 (1995)
69		Bernard Chazelle, Jirí Matousek: Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions. Comput. Geom. 5: 27-32 (1995)
68		Bernard Chazelle, Jirí Matousek, Micha Sharir: An Elementary Approach to Lower Bounds in Geometric Discrepancy. Discrete & Computational Geometry 13: 363-381 (1995)
67		Jirí Matousek: Tight Upper Bounds for the Discrepancy of Half-Spaces. Discrete & Computational Geometry 13: 593-601 (1995)
66		Mark de Berg, Jirí Matousek, Otfried Schwarzkopf: Piecewise Linear Paths Among Convex Obstacles. Discrete & Computational Geometry 14(1): 9-29 (1995)
65		Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir: Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. Discrete & Computational Geometry 14(2): 113-122 (1995)
64		Jirí Matousek: On Geometric Optimization with Few Violated Constraints. Discrete & Computational Geometry 14(4): 365-384 (1995)
63		Jirí Matousek: On Enclosing k Points by a Circle. Inf. Process. Lett. 53(4): 217-221 (1995)
62		Jirí Matousek, Vojtech Rödl: On Ramsey Sets in Spheres. J. Comb. Theory, Ser. A 70(1): 30-44 (1995)
61		Jirí Matousek: Approximations and Optimal Geometric Divide-an-Conquer. J. Comput. Syst. Sci. 50(2): 203-208 (1995)
	1994
60		Jirí Matousek: On Geometric Optimization with Few Violated Constraints. Symposium on Computational Geometry 1994: 312-321
59		Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf: Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. Symposium on Computational Geometry 1994: 67-75
58		Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf: Computing Many Faces in Arrangements of Lines and Segments. Symposium on Computational Geometry 1994: 76-84
57		Jirí Matousek: Geometric Range Searching. ACM Comput. Surv. 26(4): 421-461 (1994)
56		Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama: Complexity of Projected Images of Convex Subdivisions. Comput. Geom. 4: 293-308 (1994)
55		Pankaj K. Agarwal, Jirí Matousek: On Range Searching with Semialgebraic Sets. Discrete & Computational Geometry 11: 393-418 (1994)
54		Chi-Yuan Lo, Jirí Matousek, William L. Steiger: Algorithms for Ham-Sandwich Cuts. Discrete & Computational Geometry 11: 433-452 (1994)
53		Boris Aronov, Jirí Matousek, Micha Sharir: On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. J. Comb. Theory, Ser. A 65(2): 311-321 (1994)
52		Jan Kratochvíl, Jirí Matousek: Intersection Graphs of Segments. J. Comb. Theory, Ser. B 62(2): 289-315 (1994)
51		Jirí Matousek: Lower Bounds for a Subexponential Optimization Algorithm. Random Struct. Algorithms 5(4): 591-608 (1994)
50		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)
	1993
49		Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir: On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. CCCG 1993: 127-132
48		Hervé Brönnimann, Bernard Chazelle, Jirí Matousek: Product Range Spaces, Sensitive Sampling, and Derandomization FOCS 1993: 400-409
47		Bernard Chazelle, Jirí Matousek: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions. SODA 1993: 281-290
46		Jirí Matousek, David M. Mount, Nathan S. Netanyahu: Efficient Randomized Algorithms for the Repeated Median Line Estimator. SODA 1993: 74-82
45		Jirí Matousek, Otfried Schwarzkopf: A deterministic algorithm for the three-dimensional diameter problem. STOC 1993: 478-484
44		Mark de Berg, Jirí Matousek, Otfried Schwarzkopf: Piecewise linear paths among convex obstacles. STOC 1993: 505-514
43		Jirí Matousek, Emo Welzl, Lorenz Wernisch: Discrepancy and approximations for bounded VC-dimension. Combinatorica 13(4): 455-466 (1993)
42		Jirí Matousek: Range Searching with Efficient Hiearchical Cutting. Discrete & Computational Geometry 10: 157-182 (1993)
41		Jirí Matousek, Otfried Schwarzkopf: On Ray Shooting in Convex Polytopes. Discrete & Computational Geometry 10: 215-232 (1993)
40		Jirí Matousek: Linear Optimization Queries. J. Algorithms 14(3): 432-448 (1993)
39		Pankaj K. Agarwal, Jirí Matousek: Ray Shooting and Parametric Search. SIAM J. Comput. 22(4): 794-806 (1993)
	1992
38		Pankaj K. Agarwal, David Eppstein, Jirí Matousek: Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees FOCS 1992: 80-89
37		Jirí Matousek, Raimund Seidel: A Tail Estimate for Mulmuley's Segment Intersection Algorithm. ICALP 1992: 427-438
36		Pankaj K. Agarwal, Jirí Matousek: On Range Searching with Semialgebraic Sets. MFCS 1992: 1-13
35		Pankaj K. Agarwal, Jirí Matousek: Relative Neighborhood Graphs in Three Dimensions. SODA 1992: 58-65
34		Pankaj K. Agarwal, Jirí Matousek: Ray Shooting and Parametric Search STOC 1992: 517-526
33		Chi-Yuan Lo, Jirí Matousek, William L. Steiger: Ham-Sandwich Cuts in R^d STOC 1992: 539-545
32		Jirí Matousek, Micha Sharir, Emo Welzl: A Subexponential Bound for Linear Programming. Symposium on Computational Geometry 1992: 1-8
31		Jirí Matousek, Otfried Schwarzkopf: Linear Optimization Queries. Symposium on Computational Geometry 1992: 16-25
30		Jirí Matousek: Range Searching with Efficient Hierarchical Cuttings. Symposium on Computational Geometry 1992: 276-285
29		Pankaj K. Agarwal, Jirí Matousek: Relative Neighborhood Graphs in Three Dimensions. Comput. Geom. 2: 1-14 (1992)
28		Jirí Matousek: Reporting Points in Halfspaces. Comput. Geom. 2: 169-186 (1992)
27		Jirí Matousek: On Vertical Ray Shooting in Arrangements. Comput. Geom. 2: 279-285 (1992)
26		Jirí Matousek: Efficient Partition Trees. Discrete & Computational Geometry 8: 315-334 (1992)
25		Jirí Matousek, Robin Thomas: On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Mathematics 108(1-3): 343-364 (1992)
24		Jirí Matousek, Emo Welzl: Good Splitters for Counting Points in Triangles. J. Algorithms 13(2): 307-319 (1992)
	1991
23		Jirí Matousek: Reporting Points in Halfspaces FOCS 1991: 207-215
22		Jirí Matousek, Emo Welzl, Lorenz Wernisch: Discrepancy and epsilon-approximations for bounded VC-dimension FOCS 1991: 424-430
21		Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl: Fat Triangles Determine Linearly Many Holes FOCS 1991: 49-58
20		Jirí Matousek: Approximations and Optimal Geometric Divide-And-Conquer STOC 1991: 505-511
19		Jirí Matousek: Efficient Partition Trees. Symposium on Computational Geometry 1991: 1-9
18		Boris Aronov, Jirí Matousek, Micha Sharir: On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. Symposium on Computational Geometry 1991: 307-313
17		Pankaj K. Agarwal, Jirí Matousek, Subhash Suri: Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. WADS 1991: 105-116
16		Pankaj K. Agarwal, Jirí Matousek, Subhash Suri: Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. Comput. Geom. 1: 189-201 (1991)
15		Jirí Matousek: Lower Bounds on the Length of Monotone Paths in Arrangement. Discrete & Computational Geometry 6: 129-134 (1991)
14		Jirí Matousek: Cutting Hyperplane Arrangements. Discrete & Computational Geometry 6: 385-406 (1991)
13		Jirí Matousek: Spanning trees with low crossing number. ITA 25: 103-124 (1991)
12		Jirí Matousek: Computing Dominances in E^n. Inf. Process. Lett. 38(5): 277-278 (1991)
11		Jirí Matousek: Randomized Optimal Algorithm for Slope Selection Inf. Process. Lett. 39(4): 183-187 (1991)
10		Jirí Matousek, Robin Thomas: Algorithms Finding Tree-Decompositions of Graphs. J. Algorithms 12(1): 1-22 (1991)
9		Jan Kratochvíl, Jirí Matousek: String graphs requiring exponential representations. J. Comb. Theory, Ser. B 53(1): 1-4 (1991)
8		Jirí Matousek: Approximate Levels in Line Arrangements. SIAM J. Comput. 20(2): 222-227 (1991)
	1990
7		Jirí Matousek: Cutting Hyperplane Arrangements. Symposium on Computational Geometry 1990: 1-9
6		Jirí Matousek: Raimund Seidel, Emo Welzl: How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces. Symposium on Computational Geometry 1990: 16-22
5		Jirí Matousek: Construction of epsilon-Nets. Discrete & Computational Geometry 5: 427-448 (1990)
	1989
4		Jirí Matousek: Construction of epsilon Nets. Symposium on Computational Geometry 1989: 1-10
3		Jirí Matousek, Emo Welzl: Good Splitters for Counting Points in Triangles. Symposium on Computational Geometry 1989: 124-130
2		Jirí Matousek: On-Line Computation of Convolutions. Inf. Process. Lett. 32(1): 15-16 (1989)
	1988
1		Jirí Matousek: Line Arrangements and Range Search. Inf. Process. Lett. 27(6): 275-280 (1988)

Coauthor Index

1	Micah Adler	[124]
2	Pankaj K. Agarwal	[16] [17] [29] [34] [35] [36] [38] [39] [55] [58] [59] [70] [79] [80] [126]
3	Hee-Kap Ahn	[78] [95] [107] [165] [179]
4	Alon Amit	[102] [104]
5	Boris Aronov	[18] [53]
6	Tetsuo Asano	[132] [136] [144]
7	Robert Babilon	[103] [110]
8	Imre Bárány	[101] [106] [122] [128] [135] [143]
9	János Barát	[127]
10	Mark de Berg	[44] [59] [66] [78] [79] [107]
11	Prosenjit Bose	[78] [107]
12	David J. Brady	[126]
13	Hervé Brönnimann	[48] [89]
14	Boris Bukh	[152] [160] [163]
15	Martin Cadek	[174] [181]
16	Bernard Chazelle	[47] [48] [68] [69] [73] [89]
17	Ke Chen	[137]
18	Siu-Wing Cheng	[78] [107]
19	Otfried Cheong (Otfried Schwarzkopf)	[31] [41] [44] [45] [58] [59] [66] [75] [78] [79] [80] [95] [107] [108] [117] [165] [179]
20	Tobias Christ	[170] [175]
21	Jeff Edmonds	[124]
22	Marek Elias	[173]
23	David Eppstein	[38]
24	Amos Fiat	[125] [137]
25	Paul Fischer	[96]
26	Andrea Francke	[170] [175]
27	Vojtech Franek	[157]
28	Bernd Gärtner	[133]
29	Heidi Gebauer	[170] [175]
30	Leonidas J. Guibas	[49] [65]
31	Dan Halperin	[49] [65] [78] [107]
32	Sariel Har-Peled	[108] [117]
33	Tomio Hirata	[56]
34	Michael Hoffmann	[166] [169] [171]
35	Andreas Holmsen	[115]
36	Keiko Imai	[158] [164] [168]
37	Haim Kaplan	[137]
38	Akitoshi Kawamura	[158] [159] [164] [167] [168]
39	Jeong Han Kim	[123]
40	Marcos A. Kiwi	[119]
41	Petr Kolman	[112]
42	Pavol Korcek	[177]
43	Jan Kratochvíl	[9] [52]
44	Marek Krcál	[174] [180] [181]
45	Krystyna Kuperberg	[90]
46	Wlodzimierz Kuperberg	[90]
47	Meital Levy	[125] [137]
48	Nathan Linial (Nati Linial)	[102] [104] [108] [117] [141] [149]
49	Chi-Yuan Lo	[33] [54]
50	Martin Loebl	[113] [119]
51	Jana Maxová	[103] [110]
52	Nathaly Miller	[21]
53	Elchanan Mossel	[125] [137]
54	David M. Mount	[46] [86]
55	Jaroslav Nesetril (Jarik Nesetril)	[88] [162]
56	Nathan S. Netanyahu	[46] [86]
57	Gabriel Nivasch	[152] [160] [163]
58	Yoshio Okamoto	[166] [169] [171]
59	János Pach	[21] [50] [125] [137]
60	Ondrej Pangrác	[113]
61	Petr Plechác	[85]
62	Ales Prívetivý	[130] [138] [140] [145] [146]
63	Daniel Reem	[158] [164] [168]
64	Vojtech Rödl	[62]
65	Eyal Rozenman	[102]
66	Leo Rüst	[133]
67	Zuzana Safernová	[172]
68	Robert Sámal	[139] [148]
69	Raimund Seidel	[37]
70	Francis Sergeraert	[174] [180] [181]
71	Micha Sharir	[18] [21] [32] [49] [50] [53] [65] [68] [76] [125] [129] [137]
72	Or Sheffet	[141] [149]
73	Anastasios Sidiropoulos	[150] [153]
74	Shmuel Sifrony	[21] [50]
75	Petr Skovron	[133] [134] [138] [142] [145]
76	Shakhar Smorodinsky	[125] [129] [137]
77	William L. Steiger	[33] [54]
78	Milos Stojakovic	[109]
79	Subhash Suri	[16] [17]
80	Tibor Szabó	[121]
81	Xuehou Tan	[56]
82	Martin Tancer	[151] [154] [161] [178]
83	Gábor Tardos	[141] [149]
84	Robin Thomas	[10] [25]
85	Takeshi Tokuyama	[56] [132] [136] [144] [158] [159] [164] [167] [168]
86	Takeaki Uno	[170] [175]
87	Pavel Valtr	[90] [103] [110]
88	Antoine Vigneron	[95] [165] [179]
89	Lukás Vokrínek	[174] [181]
90	Van H. Vu	[123]
91	Uli Wagner	[114] [125] [129] [137] [151] [161] [174] [176] [178] [181]
92	Emo Welzl	[3] [21] [22] [24] [32] [43] [50] [76] [125] [137]
93	Lorenz Wernisch	[22] [43]
94	David R. Wood	[127]
95	Philipp Zumstein	[166] [169] [171]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page