| 2026 | ESA | Triangle Nearest-Neighbor Searching in 3-Space. | Pankaj K. Agarwal, Esther Ezra, Micha Sharir |
| 2026 | ESA | Matching in Geometric Uniform Hypergraphs. | Matthew J. Katz, Yuval Nidam, Rachel Saban, Micha Sharir |
| 2026 | MFCS | Efficient Algorithms for the Bottleneck Path Problem in Geometric Graphs. | Matthew J. Katz, Rachel Saban, Micha Sharir |
| 2026 | SODA | Computing the Heaviest Disk and Related Problems. | Pankaj K. Agarwal, Esther Ezra, Micha Sharir |
| 2026 | WG | Implicit Representations via the Polynomial Method. | Jean Cardinal, Micha Sharir |
| 2025 | ISAAC | Incidences Between Curves and Points on the Grid. | Esther Ezra, Micha Sharir |
| 2025 | ISAAC | BFS and Reverse Shortest Paths for Ball Intersection Graphs in Three and Higher Dimensions. | Matthew J. Katz, Rachel Saban, Micha Sharir |
| 2024 | ESA | Lower Envelopes of Surface Patches in 3-Space. | Pankaj K. Agarwal, Esther Ezra, Micha Sharir |
| 2024 | ESA | Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments. | Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir |
| 2024 | ESA | Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain. | Matthew J. Katz, Rachel Saban, Micha Sharir |
| 2024 | SODA | Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D. | Pankaj K. Agarwal, Esther Ezra, Micha Sharir |
| 2024 | SODA | Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment. | Pankaj K. Agarwal, Dan Halperin, Micha Sharir, Alex Steiger |
| 2023 | ESA | The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. | Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir |
| 2022 | ESA | Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection. | Esther Ezra, Micha Sharir |
| 2022 | ISAAC | On Reverse Shortest Paths in Geometric Proximity Graphs. | Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir |
| 2021 | ISAAC | Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. | Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir |
| 2021 | SODA | Decomposing the Complement of the Union of Cubes in Three Dimensions. | Pankaj K. Agarwal, Micha Sharir, Alex Steiger |
| 2021 | WAFR | Space-Aware Reconfiguration. | Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir |
| 2019 | ESA | Triangles and Girth in Disk Graphs and Transmission Graphs. | Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir |
| 2018 | ICALP | Union of Hypercubes and 3D Minkowski Sums with Random Sizes. | Pankaj K. Agarwal, Haim Kaplan, Micha Sharir |
| 2018 | ISAAC | Approximate Minimum-Weight Matching with Outliers Under Translation. | Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Gnter Rote, Micha Sharir, Allen Xiao |
| 2018 | ISAAC | Stabbing Pairwise Intersecting Disks by Five Points. | Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert |
| 2018 | ISSAC | Algebraic Techniques in Geometry: The 10th Anniversary. | Micha Sharir |
| 2018 | SODA | Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic | Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann |
| 2017 | ESA | Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. | Pankaj K. Agarwal, Natan Rubin, Micha Sharir |
| 2017 | ESA | Output Sensitive Algorithms for Approximate Incidences and Their Applications. | Dror Aiger, Haim Kaplan, Micha Sharir |
| 2017 | ESA | Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy. | Omer Gold, Micha Sharir |
| 2017 | ESA | Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points. | Haim Kaplan, Sasanka Roy, Micha Sharir |
| 2017 | ICALP | Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier. | Omer Gold, Micha Sharir |
| 2017 | ISAAC | Dominance Product and High-Dimensional Closest Pair under L_infty. | Omer Gold, Micha Sharir |
| 2017 | SODA | Eliminating Depth Cycles among Triangles in Three Dimensions. | Boris Aronov, Edward Y. Miller, Micha Sharir |
| 2017 | SODA | Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. | Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir |
| 2017 | SODA | Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances. | Micha Sharir, Noam Solomon |
| 2016 | SODA | Approximating the | Sariel Har-Peled, Haim Kaplan, Micha Sharir |
| 2016 | STOC | Almost tight bounds for eliminating depth cycles in three dimensions. | Boris Aronov, Micha Sharir |
| 2015 | ESA | Incidences with Curves in ℝ d. | Micha Sharir, Adam Sheffer, Noam Solomon |
| 2015 | FOCS | Incidences between Points and Lines in R^4. | Micha Sharir, Noam Solomon |
| 2014 | ESA | Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. | Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balzs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis |
| 2013 | SODA | Computing the Discrete Frchet Distance in Subquadratic Time. | Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir |
| 2013 | SODA | Reporting neighbors in high-dimensional Euclidean spaces. | Dror Aiger, Haim Kaplan, Micha Sharir |
| 2012 | FOCS | On Range Searching with Semialgebraic Sets II. | Pankaj K. Agarwal, Jir Matousek, Micha Sharir |
| 2012 | GD | Counting Plane Graphs: Cross-Graph Charging Schemes. | Micha Sharir, Adam Sheffer |
| 2012 | SODA | Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. | Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir |
| 2011 | SODA | Improved Bound for the Union of Fat Triangles. | Esther Ezra, Boris Aronov, Micha Sharir |
| 2011 | WADS | Counting Plane Graphs: Flippability and Its Applications. | Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tth, Emo Welzl |
| 2010 | ESA | Optimal Cover of Points by Disks in a Simple Polygon. | Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir |
| 2010 | FOCS | Improved Bounds for Geometric Permutations. | Natan Rubin, Haim Kaplan, Micha Sharir |
| 2009 | SODA | Line transversals of convex polyhedra in | Haim Kaplan, Natan Rubin, Micha Sharir |
| 2009 | STOC | Small-size epsilon-nets for axis-parallel rectangles and boxes. | Boris Aronov, Esther Ezra, Micha Sharir |
| 2008 | ESA | Stabbing Convex Polygons with a Segment or a Polygon. | Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. Ganjugunte, Ewa Misiolek, Micha Sharir, Kai Tang |
| 2008 | SODA | Weak ε-nets and interval chains. | Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky |
| 2007 | ESA | Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. | Haim Kaplan, Natan Rubin, Micha Sharir |
| 2007 | ESA | Arrangements in Geometry: Recent Advances and Challenges. | Micha Sharir |
| 2007 | FOCS | Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions. | Esther Ezra, Micha Sharir |
| 2007 | SODA | Counting colors in boxes. | Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin |
| 2006 | FOCS | Coresets forWeighted Facilities and Their Applications. | Dan Feldman, Amos Fiat, Micha Sharir |
| 2006 | SODA | Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. | Haim Kaplan, Micha Sharir |
| 2006 | SODA | On the number of crossing-free matchings, (cycles, and partitions). | Micha Sharir, Emo Welzl |
| 2005 | SODA | Online conflict-free coloring for intervals. | Amos Fiat, Meital Levy, Jir Matousek, Elchanan Mossel, Jnos Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl |
| 2005 | SODA | The interface between computational and combinatorial geometry. | Micha Sharir |
| 2005 | SODA | Ray shooting amid balls, farthest point from a line, and range emptiness searching. | Micha Sharir, Hayim Shaul |
| 2005 | WADS | Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. | Giora Alexandron, Haim Kaplan, Micha Sharir |
| 2004 | PODC | Geometrically aware communication in random wireless networks. | Gady Kozma, Zvi Lotker, Micha Sharir, Gideon Stupp |
| 2004 | SODA | Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. | Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir |
| 2004 | SODA | Output-sensitive construction of the union of triangles. | Eti Ezra, Micha Sharir |
| 2003 | ESA | Ray Shooting and Stone Throwing. | Micha Sharir, Hayim Shaul |
| 2003 | STOC | Cutting triangular cycles of lines in space. | Boris Aronov, Vladlen Koltun, Micha Sharir |
| 2003 | STOC | Distinct distances in three and higher dimensions. | Boris Aronov, Jnos Pach, Micha Sharir, Gbor Tardos |
| 2003 | WADS | Extremal Configurations and Levels in Pseudoline Arrangements. | Micha Sharir, Shakhar Smorodinsky |
| 2002 | ESA | Translating a Planar Object to Maximize Point Containment. | Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl |
| 2002 | ESA | Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. | Eti Ezra, Dan Halperin, Micha Sharir |
| 2002 | FOCS | The Partition Technique for Overlays of Envelopes. | Vladlen Koltun, Micha Sharir |
| 2002 | SODA | Pseudo-line arrangements: duality, algorithms, and applications. | Pankaj K. Agarwal, Micha Sharir |
| 2002 | SODA | On the overlay of envelopes in four dimensions. | Vladlen Koltun, Micha Sharir |
| 2001 | FOCS | On the Complexity of Many Faces in Arrangements of Circles. | Pankaj K. Agarwal, Boris Aronov, Micha Sharir |
| 2001 | SODA | Online point location in planar arrangements and its applications. | Sariel Har-Peled, Micha Sharir |
| 2001 | WADS | Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. | Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold |
| 2000 | SODA | Exact and approximation algorithms for minimum-width cylindrical shells. | Pankaj K. Agarwal, Boris Aronov, Micha Sharir |
| 1999 | SODA | Motion Planning of a Ball Amid Segments in Three Dimensions. | Pankaj K. Agarwal, Micha Sharir |
| 1997 | SODA | Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. | Pankaj K. Agarwal, Boris Aronov, Micha Sharir |
| 1997 | WADS | Dynamic Data Structures for Fat Objects and Their Applications. | Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir |
| 1996 | SODA | Efficient Generation of k-Directional Assembly Sequences. | Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir |
| 1995 | GD | Quasi-Planar Graphs Have a Linear Number of Edges. | Pankaj K. Agarwal, Boris Aronov, Jnos Pach, Richard Pollack, Micha Sharir |
| 1995 | SODA | Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. | L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl |
| 1995 | WADS | Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications. | Micha Sharir |
| 1994 | ICPR | Partial surface and volume matching in three dimensions. | Gill Barequet, Micha Sharir |
| 1994 | SODA | A Near-Linear Algorithm for the Planar Segment Center Problem. | Alon Efrat, Micha Sharir |
| 1993 | FOCS | The Union of Convex Polyhedra in Three Dimensions | Boris Aronov, Micha Sharir |
| 1993 | FOCS | Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment | Dan Halperin, Micha Sharir |
| 1993 | FOCS | Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions | Micha Sharir |
| 1993 | ISAAC | Reaching a Goal with Directional Uncertainty. | Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir |
| 1993 | SODA | Ray Shooting Amidst Convex Polytopes in Three Dimensions. | Pankaj K. Agarwal, Micha Sharir |
| 1993 | STOC | Improved bounds on weak epsilon-nets for convex sets. | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl |
| 1993 | WADS | Computing the Smallest k-Enclosing Circle and Related Problems. | Alon Efrat, Micha Sharir, Alon Ziv |
| 1992 | SODA | Applications of Parametric Searching in Geometric Optimization. | Pankaj K. Agarwal, Micha Sharir, Sivan Toledo |
| 1992 | SODA | Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. | Kurt Mehlhorn, Micha Sharir, Emo Welzl |
| 1992 | STACS | A Combinatorial Bound for Linear Programming and Related Problems. | Micha Sharir, Emo Welzl |
| 1991 | FOCS | Fat Triangles Determine Linearly Many Holes | Jir Matousek, Nathaly Miller, Jnos Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl |
| 1991 | ICALP | Ray Shooting in Polygons Using Geodesic Triangulations. | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink |
| 1991 | SODA | Planar Geometric Location Problems and Maintaining the Width of a Planar Set. | Pankaj K. Agarwal, Micha Sharir |
| 1991 | SODA | Computing a Face in an Arrangement of Line Segments. | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink |
| 1991 | WADS | Applications of a New Space Partitioning Technique. | Pankaj K. Agarwal, Micha Sharir |
| 1991 | WADS | On the Zone of a Surface in a Hyperplane Arrangement. | Boris Aronov, Micha Sharir |
| 1990 | FOCS | Counting and Cutting Cycles of Lines and Rods in Space | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink |
| 1990 | ICALP | Randomized Incremental Construction of Delaunay and Voronoi Diagrams. | Leonidas J. Guibas, Donald E. Knuth, Micha Sharir |
| 1989 | FOCS | Output-Sensitive Hidden Surface Removal | Mark H. Overmars, Micha Sharir |
| 1989 | ICALP | A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir |
| 1989 | STOC | Lines in Space-Combinatorics, Algorithms and Applications | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir |
| 1988 | FOCS | Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces | Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl |
| 1988 | ICALP | Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. | Herbert Edelsbrunner, Leonidas J. Guibas, Jnos Pach, Richard Pollack, Raimund Seidel, Micha Sharir |
| 1988 | ICRA | Theoretical and experimental studies using a multifinger planar manipulator. | James Demmel, Gerardo Lafferriere, Jacob T. Schwartz, Micha Sharir |
| 1987 | FOCS | On the Lower Envelope of Bivariate Functions and its Applications | Herbert Edelsbrunner, Jnos Pach, Jacob T. Schwartz, Micha Sharir |
| 1987 | ICALP | On the Bivariate Function Minimization Problem And Its Applications to Motion Planning. | Jacob T. Schwartz, Micha Sharir |
| 1987 | ICRA | Efficient algorithms for planning purely translational collision-free motion in two and three dimensions. | Micha Sharir |
| 1986 | FOCS | Geometric Applications of Davenport-Schinzel Sequences | Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony |
| 1985 | FOCS | Motion Planning in the Presence of Moving Obstacles | John H. Reif, Micha Sharir |
| 1985 | FOCS | On Minima of Functions, Intersection Patterns of Curves, and Davenport-Schinzel Sequences | Micha Sharir, Ron Livne |
| 1984 | FOCS | Nonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme | Sergiu Hart, Micha Sharir |
| 1984 | STOC | On k-hulls and Related Problems | Richard Cole, Micha Sharir, Chee-Keng Yap |
| 1984 | STOC | Probabilistic Temporal Logics for Finite and Bounded Models | Sergiu Hart, Micha Sharir |
| 1984 | STOC | On Shortest Paths in Polyhedral Spaces | Micha Sharir, Amir Schorr |
| 1983 | ICALP | Concurrent Probabilistic Program, or: How to Schedule if You Must. | Sergiu Hart, Micha Sharir |
| 1983 | STOC | Retraction: A New Approach to Motion-Planning (Extended Abstract) | Colm 'Dnlaing, Micha Sharir, Chee-Keng Yap |
| 1982 | POPL | Termination of Probabilistic Concurrent Programs. | Sergiu Hart, Micha Sharir, Amir Pnueli |
| 1981 | ICALP | Data Flow Analysis of Applicative Programs. | Micha Sharir |
| 1979 | POPL | Automatic Data Structure Selection in SETL. | Edmond Schonberg, Jacob T. Schwartz, Micha Sharir |