The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jirí Matousek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jirí Matousek
    Geometric Range Searching. [Citation Graph (3, 0)][DBLP]
    ACM Comput. Surv., 1994, v:26, n:4, pp:421-461 [Journal]
  2. Jirí Matousek
    Efficient Partition Trees. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:1-9 [Conf]
  3. Jirí Matousek, Otfried Schwarzkopf
    Linear Optimization Queries. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:16-25 [Conf]
  4. Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir
    On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:127-132 [Conf]
  5. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:67-75 [Conf]
  6. Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf
    Computing Many Faces in Arrangements of Lines and Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:76-84 [Conf]
  7. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
    Separating an Object from its Cast. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:221-230 [Conf]
  8. Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron
    Reachability by paths of bounded curvature in convex polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:251-259 [Conf]
  9. Boris Aronov, Jirí Matousek, Micha Sharir
    On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:307-313 [Conf]
  10. Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
    The one-round Voronoi game. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:97-101 [Conf]
  11. Jirí Matousek
    Construction of epsilon Nets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:1-10 [Conf]
  12. Jirí Matousek
    Cutting Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:1-9 [Conf]
  13. Jirí Matousek
    Raimund Seidel, Emo Welzl: How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:16-22 [Conf]
  14. Jirí Matousek
    Range Searching with Efficient Hierarchical Cuttings. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:276-285 [Conf]
  15. Jirí Matousek
    On Geometric Optimization with Few Violated Constraints. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:312-321 [Conf]
  16. Jirí Matousek
    A Helly-Type Theorem for Unions of Convex Sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:138-146 [Conf]
  17. Jirí Matousek, Micha Sharir, Emo Welzl
    A Subexponential Bound for Linear Programming. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:1-8 [Conf]
  18. Jirí Matousek, Emo Welzl
    Good Splitters for Counting Points in Triangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:124-130 [Conf]
  19. Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron
    Violator Spaces: Structure and Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:387-398 [Conf]
  20. Pankaj K. Agarwal, David Eppstein, Jirí Matousek
    Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:80-89 [Conf]
  21. Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
    Product Range Spaces, Sensitive Sampling, and Derandomization [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:400-409 [Conf]
  22. Jirí Matousek
    Reporting Points in Halfspaces [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:207-215 [Conf]
  23. Jirí Matousek
    Geometric Computation and the Art of Sampling. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:2- [Conf]
  24. Jirí Matousek, Emo Welzl, Lorenz Wernisch
    Discrepancy and epsilon-approximations for bounded VC-dimension [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:424-430 [Conf]
  25. Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
    Fat Triangles Determine Linearly Many Holes [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:49-58 [Conf]
  26. Jirí Matousek, Tibor Szabó
    Random Edge Can Be Exponential on Abstract Cubes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:92-100 [Conf]
  27. Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr
    Low-Distortion Embeddings of Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:343-351 [Conf]
  28. Jirí Matousek
    The Anatomy of a Geometric Algorithm. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:1-7 [Conf]
  29. Jirí Matousek, Raimund Seidel
    A Tail Estimate for Mulmuley's Segment Intersection Algorithm. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:427-438 [Conf]
  30. Jirí Matousek
    Nonexistence of 2-Reptile Simplices. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:151-160 [Conf]
  31. Marcos A. Kiwi, Martin Loebl, Jirí Matousek
    Expected Length of the Longest Common Subsequence for Large Alphabets. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:302-311 [Conf]
  32. Pankaj K. Agarwal, Jirí Matousek
    On Range Searching with Semialgebraic Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:1-13 [Conf]
  33. Pankaj K. Agarwal, Jirí Matousek
    Relative Neighborhood Graphs in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:58-65 [Conf]
  34. Alon Amit, Nathan Linial, Jirí Matousek, Eyal Rozenman
    Random lifts of graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:883-894 [Conf]
  35. Bernard Chazelle, Jirí Matousek
    On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:281-290 [Conf]
  36. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:545-554 [Conf]
  37. Jirí Matousek, David M. Mount, Nathan S. Netanyahu
    Efficient Randomized Algorithms for the Repeated Median Line Estimator. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:74-82 [Conf]
  38. Micah Adler, Jeff Edmonds, Jirí Matousek
    Towards asymptotic optimality in probabilistic packet marking. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:450-459 [Conf]
  39. Pankaj K. Agarwal, Jirí Matousek
    Ray Shooting and Parametric Search [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:517-526 [Conf]
  40. Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
    The distance trisector curve. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:336-343 [Conf]
  41. Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Piecewise linear paths among convex obstacles. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:505-514 [Conf]
  42. Chi-Yuan Lo, Jirí Matousek, William L. Steiger
    Ham-Sandwich Cuts in R^d [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:539-545 [Conf]
  43. Jirí Matousek
    Approximations and Optimal Geometric Divide-And-Conquer [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:505-511 [Conf]
  44. Jirí Matousek, Otfried Schwarzkopf
    A deterministic algorithm for the three-dimensional diameter problem. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:478-484 [Conf]
  45. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri
    Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:105-116 [Conf]
  46. Pankaj K. Agarwal, Jirí Matousek
    Dynamic Half-Space Range Reporting and Its Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:4, pp:325-345 [Journal]
  47. Jirí Matousek, David M. Mount, Nathan S. Netanyahu
    Efficient Randomized Algorithms for the Repeated Median Line Estimator. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:2, pp:136-150 [Journal]
  48. Jirí Matousek, Micha Sharir, Emo Welzl
    A Subexponential Bound for Linear Programming. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:4/5, pp:498-516 [Journal]
  49. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
    Separating an object from its cast. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2002, v:34, n:8, pp:547-559 [Journal]
  50. Jeong Kim, Jirí Matousek, Van Vu
    Discrepancy After Adding A Single Set. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:4, pp:499-501 [Journal]
  51. Jirí Matousek
    On the Signed Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:1, pp:103-108 [Journal]
  52. Jirí Matousek
    A Combinatorial Proof of Kneser's Conjecture. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:1, pp:163-170 [Journal]
  53. Jirí Matousek
    The Number Of Unique-Sink Orientations of the Hypercube*. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:1, pp:91-99 [Journal]
  54. Jirí Matousek, Emo Welzl, Lorenz Wernisch
    Discrepancy and approximations for bounded VC-dimension. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:4, pp:455-466 [Journal]
  55. Pankaj K. Agarwal, Jirí Matousek
    Relative Neighborhood Graphs in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:1-14 [Journal]
  56. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri
    Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:189-201 [Journal]
  57. Bernard Chazelle, Jirí Matousek
    Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:27-32 [Journal]
  58. Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama
    Complexity of Projected Images of Convex Subdivisions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:293-308 [Journal]
  59. Jirí Matousek
    Reporting Points in Halfspaces. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:169-186 [Journal]
  60. Jirí Matousek
    On Vertical Ray Shooting in Arrangements. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:279-285 [Journal]
  61. Jirí Matousek, Otfried Schwarzkopf
    A Deterministic Algorithm for the Three-dimensional Diameter Problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:253-262 [Journal]
  62. Jirí Matousek
    A Lower Bound on the Size of Lipschitz Subsets in Dimension 3. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:4, pp:427-430 [Journal]
  63. Pankaj K. Agarwal, Jirí Matousek
    On Range Searching with Semialgebraic Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:393-418 [Journal]
  64. Imre Bárány, Jirí Matousek
    Simultaneous Partitions of Measures by k-Fans. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:3, pp:317-334 [Journal]
  65. Imre Bárány, Jirí Matousek
    Equipartition of Two Measures by a 4-Fan. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:27, n:3, pp:293-301 [Journal]
  66. Imre Bárány, Jirí Matousek
    The Randomized Integer Convex Hull. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:1, pp:3-25 [Journal]
  67. Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Piecewise Linear Paths Among Convex Obstacles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:1, pp:9-29 [Journal]
  68. Bernard Chazelle, Jirí Matousek, Micha Sharir
    An Elementary Approach to Lower Bounds in Geometric Discrepancy. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:363-381 [Journal]
  69. Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek
    The One-Round Voronoi Game. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:125-138 [Journal]
  70. Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir
    Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:2, pp:113-122 [Journal]
  71. Andreas Holmsen, Jirí Matousek
    No Helly Theorem for Stabbing Translates by Lines in R 3. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:3, pp:405-410 [Journal]
  72. Krystyna Kuperberg, Wlodzimierz Kuperberg, Jirí Matousek, Pavel Valtr
    Almost-Tiling the Plane by Ellipses. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:3, pp:367-375 [Journal]
  73. Chi-Yuan Lo, Jirí Matousek, William L. Steiger
    Algorithms for Ham-Sandwich Cuts. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:433-452 [Journal]
  74. Jirí Matousek
    On Approximate Geometric k-Clustering. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:1, pp:61-84 [Journal]
  75. Jirí Matousek
    On Directional Convexity. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:3, pp:389-403 [Journal]
  76. Jirí Matousek
    Lower Bounds on the Transversal Numbers of d-Intervals. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:283-287 [Journal]
  77. Jirí Matousek
    A Lower Bound for Weak epsilon-Nets in High Dimension. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:1, pp:45-48 [Journal]
  78. Jirí Matousek
    Bounded VC-Dimension Implies a Fractional Helly Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:2, pp:251-255 [Journal]
  79. Jirí Matousek
    Construction of epsilon-Nets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:427-448 [Journal]
  80. Jirí Matousek
    Lower Bounds on the Length of Monotone Paths in Arrangement. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:129-134 [Journal]
  81. Jirí Matousek
    Cutting Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:385-406 [Journal]
  82. Jirí Matousek
    Efficient Partition Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:315-334 [Journal]
  83. Jirí Matousek
    Range Searching with Efficient Hiearchical Cutting. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:157-182 [Journal]
  84. Jirí Matousek
    On Geometric Optimization with Few Violated Constraints. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:4, pp:365-384 [Journal]
  85. Jirí Matousek
    Tight Upper Bounds for the Discrepancy of Half-Spaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:593-601 [Journal]
  86. Jirí Matousek
    A Helly-Type Theorem for Unions of Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:1, pp:1-12 [Journal]
  87. Jirí Matousek
    On Constants for Cuttings in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:4, pp:427-448 [Journal]
  88. Jirí Matousek, Petr Plechác
    On Functional Separately Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:1, pp:105-130 [Journal]
  89. Jirí Matousek, Otfried Schwarzkopf
    On Ray Shooting in Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:215-232 [Journal]
  90. Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner
    k-Sets in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:2, pp:177-191 [Journal]
  91. Jirí Matousek, Uli Wagner
    New Constructions of Weak epsilon-Nets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:2, pp:195-206 [Journal]
  92. Martin Loebl, Jirí Matousek, Ondrej Pangrác
    Triangles in random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:289, n:1-3, pp:181-185 [Journal]
  93. Jirí Matousek
    Lower bound on the minus-domination number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:361-370 [Journal]
  94. Imre Bárány, Jirí Matousek
    Berge's theorem, fractional Helly, and art galleries. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2303-2313 [Journal]
  95. Jirí Matousek
    On the Linear and Hereditary Discrepancies. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:4, pp:519-521 [Journal]
  96. Jirí Matousek
    An Lp Version of the Beck-Fiala Conjecture. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:2, pp:175-182 [Journal]
  97. Jirí Matousek
    Line Arrangements and Range Search. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:6, pp:275-280 [Journal]
  98. Jirí Matousek
    On-Line Computation of Convolutions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:1, pp:15-16 [Journal]
  99. Jirí Matousek
    Computing Dominances in E^n. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:5, pp:277-278 [Journal]
  100. Jirí Matousek
    Randomized Optimal Algorithm for Slope Selection [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:4, pp:183-187 [Journal]
  101. Jirí Matousek
    On Enclosing k Points by a Circle. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:4, pp:217-221 [Journal]
  102. Jirí Matousek
    Spanning trees with low crossing number. [Citation Graph (0, 0)][DBLP]
    ITA, 1991, v:25, n:, pp:103-124 [Journal]
  103. Bernard Chazelle, Jirí Matousek
    On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:3, pp:579-597 [Journal]
  104. Jirí Matousek, Robin Thomas
    Algorithms Finding Tree-Decompositions of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:1, pp:1-22 [Journal]
  105. Jirí Matousek, Emo Welzl
    Good Splitters for Counting Points in Triangles. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:2, pp:307-319 [Journal]
  106. Jirí Matousek
    Linear Optimization Queries. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:3, pp:432-448 [Journal]
  107. Jirí Matousek
    Derandomization in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:3, pp:545-580 [Journal]
  108. Jirí Matousek
    The Exponent of Discrepancy Is at Least 1.0669. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1998, v:14, n:4, pp:448-453 [Journal]
  109. Jirí Matousek
    On the L2-Discrepancy for Anchored Boxes. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1998, v:14, n:4, pp:527-556 [Journal]
  110. Jirí Matousek
    Approximations and Optimal Geometric Divide-an-Conquer. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:2, pp:203-208 [Journal]
  111. Boris Aronov, Jirí Matousek, Micha Sharir
    On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:65, n:2, pp:311-321 [Journal]
  112. Paul Fischer, Jirí Matousek
    A Lower Bound for Families of Natarajan Dimension d. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:95, n:1, pp:189-195 [Journal]
  113. Petr Kolman, Jirí Matousek
    Crossing number, pair-crossing number, and expansion. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:92, n:1, pp:99-113 [Journal]
  114. Jan Kratochvíl, Jirí Matousek
    String graphs requiring exponential representations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:53, n:1, pp:1-4 [Journal]
  115. Jan Kratochvíl, Jirí Matousek
    Intersection Graphs of Segments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:2, pp:289-315 [Journal]
  116. Jirí Matousek
    Note on the Colored Tverberg Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:146-151 [Journal]
  117. Jirí Matousek, Vojtech Rödl
    On Ramsey Sets in Spheres. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:70, n:1, pp:30-44 [Journal]
  118. Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr
    Low-Distortion Embeddings of Trees. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:4, pp:399-409 [Journal]
  119. Alon Amit, Nathan Linial, Jirí Matousek
    Random lifts of graphs: Independence and chromatic number. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:1, pp:1-22 [Journal]
  120. Jirí Matousek
    Lower Bounds for a Subexponential Optimization Algorithm. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:4, pp:591-608 [Journal]
  121. Jirí Matousek, Milos Stojakovic
    On restricted min-wise independence of permutations. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:4, pp:397-408 [Journal]
  122. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:654-667 [Journal]
  123. Pankaj K. Agarwal, Jirí Matousek
    Ray Shooting and Parametric Search. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:4, pp:794-806 [Journal]
  124. Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf
    Computing Many Faces in Arrangements of Lines and Segments. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:2, pp:491-505 [Journal]
  125. Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
    Product Range Spaces, Sensitive Sampling, and Derandomization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1552-1575 [Journal]
  126. Jirí Matousek
    Approximate Levels in Line Arrangements. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:222-227 [Journal]
  127. Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
    Fat Triangles Determine Linearly Many Holes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:1, pp:154-169 [Journal]
  128. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1342-1359 [Journal]
  129. Pankaj K. Agarwal, David J. Brady, Jirí Matousek
    Segmenting object space by geometric reference structures. [Citation Graph (0, 0)][DBLP]
    TOSN, 2006, v:2, n:4, pp:455-465 [Journal]
  130. Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama
    Zone diagrams: existence, uniqueness and algorithmic challenge. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:756-765 [Conf]
  131. Jirí Matousek, Robin Thomas
    On the complexity of finding iso- and other morphisms for partial k-trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:343-364 [Journal]

  132. Lower bounds for weak epsilon-nets and stair-convexity. [Citation Graph (, )][DBLP]


  133. Distance k-sectors exist. [Citation Graph (, )][DBLP]


  134. Zone diagrams in Euclidean spaces and in other normed spaces. [Citation Graph (, )][DBLP]


  135. Inapproximability for Metric Embeddings into R^d. [Citation Graph (, )][DBLP]


  136. Hardness of embedding simplicial complexes in Rd. [Citation Graph (, )][DBLP]


  137. Minimum and Maximum against k Lies. [Citation Graph (, )][DBLP]


  138. Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. [Citation Graph (, )][DBLP]


  139. Computing D-convex hulls in the plane. [Citation Graph (, )][DBLP]


  140. Distance k-sectors exist. [Citation Graph (, )][DBLP]


  141. Stabbing simplices by points and flats [Citation Graph (, )][DBLP]


  142. Hardness of embedding simplicial complexes in Rd [Citation Graph (, )][DBLP]


  143. Inapproximability for metric embeddings into R^d [Citation Graph (, )][DBLP]


  144. Zone Diagrams in Euclidean Spaces and in Other Normed Spaces [Citation Graph (, )][DBLP]


  145. Distance k-Sectors Exist [Citation Graph (, )][DBLP]


  146. Minimum and maximum against k lies [Citation Graph (, )][DBLP]


  147. Reachability by Paths of Bounded Curvature in a Convex Polygon [Citation Graph (, )][DBLP]


  148. The Minimum Independence Number of a Hasse Diagram. [Citation Graph (, )][DBLP]


  149. Graph Colouring with No Large Monochromatic Components. [Citation Graph (, )][DBLP]


  150. Packing Cones and Their Negatives in Space. [Citation Graph (, )][DBLP]


  151. Blocking Visibility for Points in General Position. [Citation Graph (, )][DBLP]


  152. Removing Degeneracy in LP-Type Problems Revisited. [Citation Graph (, )][DBLP]


  153. Dimension Gaps between Representability and Collapsibility. [Citation Graph (, )][DBLP]


  154. Stabbing Simplices by Points and Flats. [Citation Graph (, )][DBLP]


Search in 0.013secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002