Micha Sharir - RankMe

660 papers A* 105A 21B 18C 2Journal 388Unranked 117

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Computing the Heaviest Disk and Related Problems. SODA Pankaj K. Agarwal, Esther Ezra, Micha Sharir
2026	J	`jnl`	Dynamic Nearest-Neighbor Searching Under General Metrics in ℝ CoRR Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
2026	J	`jnl`	Implicit representations via the polynomial method. CoRR Jean Cardinal, Micha Sharir
2026	J	`jnl`	Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane. Discret. Comput. Geom. Pankaj K. Agarwal, Esther Ezra, Micha Sharir
2025	B	`conf`	BFS and Reverse Shortest Paths for Ball Intersection Graphs in Three and Higher Dimensions. ISAAC Matthew J. Katz, Rachel Saban, Micha Sharir
2025	J	`jnl`	Covering Points by Hyperplanes and Related Problems. SIAM J. Discret. Math. Zuzana Patáková, Micha Sharir
2025	J	`jnl`	Improved Algebraic Degeneracy Testing. Discret. Comput. Geom. Jean Cardinal, Micha Sharir
2025	B	`conf`	Incidences Between Curves and Points on the Grid. ISAAC Esther Ezra, Micha Sharir
2025	J	`jnl`	Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. ACM Trans. Algorithms Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir
2025	J	`jnl`	Intersection Searching amid Tetrahedra in Four Dimensions. Discret. Comput. Geom. Esther Ezra, Micha Sharir
2024	J	`jnl`	Covering points by hyperplanes and related problems. CoRR Zuzana Patáková, Micha Sharir
2024	J	`jnl`	Decomposing the Complement of the Union of Cubes and Boxes in Three Dimensions. Discret. Comput. Geom. Pankaj K. Agarwal, Micha Sharir, Alex Steiger
2024	A	`conf`	Lower Envelopes of Surface Patches in 3-Space. ESA Pankaj K. Agarwal, Esther Ezra, Micha Sharir
2024	A	`conf`	Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain. ESA Matthew J. Katz, Rachel Saban, Micha Sharir
2024	A*	`conf`	Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment. SODA Pankaj K. Agarwal, Dan Halperin, Micha Sharir, Alex Steiger
2024	J	`jnl`	On reverse shortest paths in geometric proximity graphs. Comput. Geom. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
2024	A	`conf`	Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments. ESA Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir
2024	A*	`conf`	Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the Plane. SoCG Pankaj K. Agarwal, Esther Ezra, Micha Sharir
2024	J	`jnl`	Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane. CoRR Pankaj K. Agarwal, Esther Ezra, Micha Sharir
2024	A*	`conf`	Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D. SODA Pankaj K. Agarwal, Esther Ezra, Micha Sharir
2023	J	`jnl`	Bottleneck matching in the plane. Comput. Geom. Matthew J. Katz, Micha Sharir
2023	A*	`conf`	Improved Algebraic Degeneracy Testing. SoCG Jean Cardinal, Micha Sharir
2023	J	`jnl`	Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment. CoRR Pankaj K. Agarwal, Dan Halperin, Micha Sharir, Alex Steiger
2023	J	`jnl`	Space-Aware Reconfiguration. Discret. Comput. Geom. Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir
2023	J	`jnl`	Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
2023	A	`conf`	The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. ESA Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir
2023	J	`jnl`	The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. CoRR Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir
2023	J	`jnl`	Throwing a Sofa Through the Window. Discret. Comput. Geom. Dan Halperin, Micha Sharir, Itay Yehuda
2023	J	`jnl`	Time and space efficient collinearity indexing. Comput. Geom. Boris Aronov, Esther Ezra, Micha Sharir, Guy Zigdon
2023	J	`jnl`	Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D. CoRR Pankaj K. Agarwal, Esther Ezra, Micha Sharir
2022	J	`jnl`	Bottleneck Matching in the Plane. CoRR Matthew J. Katz, Micha Sharir
2022	J	`jnl`	Counting and Cutting Rich Lenses in Arrangements of Circles. SIAM J. Discret. Math. Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl
2022	A*	`conf`	Covering Points by Hyperplanes and Related Problems. SoCG Zuzana Patáková, Micha Sharir
2022	J	`jnl`	Improved Algebraic Degeneracy Testing. CoRR Jean Cardinal, Micha Sharir
2022	J	`jnl`	Incidences between points and curves with almost two degrees of freedom. J. Comb. Theory A Micha Sharir, Noam Solomon, Oleg Zlydenko
2022	A*	`conf`	Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. SoCG Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir
2022	J	`jnl`	Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. CoRR Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir
2022	A	`conf`	Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection. ESA Esther Ezra, Micha Sharir
2022	J	`jnl`	Intersection Searching amid Tetrahedra in Four Dimensions. CoRR Esther Ezra, Micha Sharir
2022	J	`jnl`	On Ray Shooting for Triangles in 3-Space and Related Problems. SIAM J. Comput. Esther Ezra, Micha Sharir
2022	B	`conf`	On Reverse Shortest Paths in Geometric Proximity Graphs. ISAAC Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
2022	J	`jnl`	Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems. Discret. Comput. Geom. Boris Aronov, Esther Ezra, Micha Sharir
2022	J	`jnl`	The Maximum-Level Vertex in an Arrangement of Lines. Discret. Comput. Geom. Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
2021	A*	`conf`	Decomposing the Complement of the Union of Cubes in Three Dimensions. SODA Pankaj K. Agarwal, Micha Sharir, Alex Steiger
2021	J	`jnl`	Efficient algorithms for optimization problems involving distances in a point set. CoRR Matthew J. Katz, Micha Sharir
2021	A*	`conf`	On Ray Shooting for Triangles in 3-Space and Related Problems. SoCG Esther Ezra, Micha Sharir
2021	J	`jnl`	On Ray Shooting for Triangles in 3-Space and Related Problems. CoRR Esther Ezra, Micha Sharir
2021	A*	`conf`	On Rich Lenses in Planar Arrangements of Circles and Related Problems. SoCG Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl
2021	A*	`conf`	On Rich Points and Incidences with Restricted Sets of Lines in 3-Space. SoCG Micha Sharir, Noam Solomon
2021	J	`jnl`	On rich points and incidences with restricted sets of lines in 3-space. J. Comput. Geom. Micha Sharir, Noam Solomon
2021	J	`jnl`	On the complexity of the k-level in arrangements of pseudoplanes. Discret. Math. Micha Sharir, Chen Ziv
2021	C	`conf`	Space-Aware Reconfiguration. WAFR Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir
2021	J	`jnl`	Stabbing pairwise intersecting disks by five points. Discret. Math. Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2021	B	`conf`	Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
2021	J	`jnl`	Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. CoRR Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
2021	A*	`conf`	Throwing a Sofa Through the Window. SoCG Dan Halperin, Micha Sharir, Itay Yehuda
2021	J	`jnl`	Throwing a Sofa Through the Window. CoRR Dan Halperin, Micha Sharir, Itay Yehuda
2021	J	`jnl`	Union of Hypercubes and 3D Minkowski Sums with Random Sizes. Discret. Comput. Geom. Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
2021	J	`jnl`	Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n SIAM J. Comput. Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
2020	J	`jnl`	Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location. Discret. Comput. Geom. Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir
2020	J	`jnl`	Duality-based approximation algorithms for depth queries and maximum depth. CoRR Dror Aiger, Haim Kaplan, Micha Sharir
2020	J	`jnl`	Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications. Discret. Comput. Geom. Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2020	J	`jnl`	Eliminating Depth Cycles Among Triangles in Three Dimensions. Discret. Comput. Geom. Boris Aronov, Edward Y. Miller, Micha Sharir
2020	A*	`conf`	How to Find a Point in the Convex Hull Privately. SoCG Haim Kaplan, Micha Sharir, Uri Stemmer
2020	J	`jnl`	How to Find a Point in the Convex Hull Privately. CoRR Haim Kaplan, Micha Sharir, Uri Stemmer
2020	A*	`conf`	Incidences Between Points and Curves with Almost Two Degrees of Freedom. SoCG Micha Sharir, Oleg Zlydenko
2020	J	`jnl`	Incidences between points and curves with almost two degrees of freedom. CoRR Micha Sharir, Oleg Zlydenko
2020	J	`jnl`	Incidences with curves in three dimensions. CoRR Micha Sharir, Noam Solomon
2020	J	`jnl`	On Radial Isotropic Position: Theory and Algorithms. CoRR Shiri Artstein-Avidan, Haim Kaplan, Micha Sharir
2020	J	`jnl`	On rich lenses in planar arrangements of circles and related problems. CoRR Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl
2020	J	`jnl`	On rich points and incidences with restricted sets of lines in 3-space. CoRR Micha Sharir, Noam Solomon
2020	J	`jnl`	Output sensitive algorithms for approximate incidences and their applications. Comput. Geom. Dror Aiger, Haim Kaplan, Micha Sharir
2020	J	`jnl`	Output sensitive algorithms for approximate incidences and their applications. CoRR Dror Aiger, Haim Kaplan, Micha Sharir
2020	J	`jnl`	Space-Aware Reconfiguration. CoRR Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir
2020	A*	`conf`	Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. SoCG Boris Aronov, Esther Ezra, Micha Sharir
2020	J	`jnl`	Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. CoRR Boris Aronov, Esther Ezra, Micha Sharir
2020	J	`jnl`	The Maximum-Level Vertex in an Arrangement of Lines. CoRR Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir
2019	J	`jnl`	A Nearly Quadratic Bound for Point-Location in Hyperplane Arrangements, in the Linear Decision Tree Model. Discret. Comput. Geom. Esther Ezra, Micha Sharir
2019	J	`jnl`	Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. Comput. Geom. Haim Kaplan, Sasanka Roy, Micha Sharir
2019	A*	`conf`	General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem. SoCG Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl
2019	J	`jnl`	General techniques for approximate incidences and their application to the camera posing problem. CoRR Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl
2019	A*	`conf`	On the Complexity of the k-Level in Arrangements of Pseudoplanes. SoCG Micha Sharir, Chen Ziv
2019	J	`jnl`	On the Complexity of the k-Level in Arrangements of Pseudoplanes. CoRR Micha Sharir, Chen Ziv
2019	A	`conf`	Triangles and Girth in Disk Graphs and Transmission Graphs. ESA Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2019	J	`jnl`	Triangles and Girth in Disk Graphs and Transmission Graphs. CoRR Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2018	B	`conf`	Algebraic Techniques in Geometry: The 10th Anniversary. ISSAC Micha Sharir
2018	J	`jnl`	Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. Discret. Comput. Geom. Boris Aronov, Micha Sharir
2018	B	`conf`	Approximate Minimum-Weight Matching with Outliers Under Translation. ISAAC Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao
2018	J	`jnl`	Approximate Minimum-Weight Matching with Outliers under Translation. CoRR Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao
2018	J	`jnl`	Distinct distances between a collinear set and an arbitrary set of points. Discret. Math. Ariel Bruner, Micha Sharir
2018	J	`jnl`	Distinct distances between points and lines. Comput. Geom. Micha Sharir, Shakhar Smorodinsky, Claudiu Valculescu, Frank de Zeeuw
2018	J	`jnl`	Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier. ACM Trans. Algorithms Omer Gold, Micha Sharir
2018	J	`jnl`	Homotheties and incidences. Discret. Math. Dror Aiger, Micha Sharir
2018	J	`jnl`	Incidences Between Points and Lines on Two- and Three-Dimensional Varieties. Discret. Comput. Geom. Micha Sharir, Noam Solomon
2018	J	`jnl`	Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms. Algorithmica Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis
2018	B	`conf`	Stabbing Pairwise Intersecting Disks by Five Points. ISAAC Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2018	J	`jnl`	Stabbing pairwise intersecting disks by five points. CoRR Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert
2018	A*	`conf`	Union of Hypercubes and 3D Minkowski Sums with Random Sizes. ICALP Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
2018	A*	`conf`	Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic SODA Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
2017	A*	`conf`	A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM. SoCG Esther Ezra, Micha Sharir
2017	A	`conf`	Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. ESA Pankaj K. Agarwal, Natan Rubin, Micha Sharir
2017	J	`jnl`	Computational Geometry Column 65. SIGACT News Micha Sharir
2017	J	`jnl`	Cutting algebraic curves into pseudo-segments and applications. J. Comb. Theory A Micha Sharir, Joshua Zahl
2017	J	`jnl`	Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location. CoRR Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir
2017	B	`conf`	Dominance Product and High-Dimensional Closest Pair under L_infty. ISAAC Omer Gold, Micha Sharir
2017	A*	`conf`	Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. SODA Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2017	A*	`conf`	Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier. ICALP Omer Gold, Micha Sharir
2017	A*	`conf`	Eliminating Depth Cycles among Triangles in Three Dimensions. SODA Boris Aronov, Edward Y. Miller, Micha Sharir
2017	A	`conf`	Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points. ESA Haim Kaplan, Sasanka Roy, Micha Sharir
2017	J	`jnl`	Homotheties and incidences. CoRR Dror Aiger, Micha Sharir
2017	A	`conf`	Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy. ESA Omer Gold, Micha Sharir
2017	J	`jnl`	Incidences Between Points and Lines in $${\mathbb {R}}^4$$. Discret. Comput. Geom. Micha Sharir, Noam Solomon
2017	A*	`conf`	Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances. SODA Micha Sharir, Noam Solomon
2017	J	`jnl`	On the number of unit-area triangles spanned by convex grids in the plane. Comput. Geom. Orit E. Raz, Micha Sharir, Ilya D. Shkredov
2017	A	`conf`	Output Sensitive Algorithms for Approximate Incidences and Their Applications. ESA Dror Aiger, Haim Kaplan, Micha Sharir
2017	J	`jnl`	Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. ACM Trans. Algorithms Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
2017	A*	`conf`	The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art (Invited Talk). SoCG Micha Sharir
2017	J	`jnl`	The Number of Unit-Area Triangles in the Plane: Theme and Variation. Comb. Orit E. Raz, Micha Sharir
2017	J	`jnl`	Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n CoRR Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann
2016	A*	`conf`	Almost tight bounds for eliminating depth cycles in three dimensions. STOC Boris Aronov, Micha Sharir
2016	A*	`conf`	Approximating the SODA Sariel Har-Peled, Haim Kaplan, Micha Sharir
2016	J	`jnl`	Approximating the $k$-Level in Three-Dimensional Plane Arrangements. CoRR Sariel Har-Peled, Haim Kaplan, Micha Sharir
2016	J	`jnl`	Cutting Algebraic Curves into Pseudo-segments and Applications. CoRR Micha Sharir, Joshua Zahl
2016	J	`jnl`	Distinct Distances from Three Points. Comb. Probab. Comput. Micha Sharir, József Solymosi
2016	J	`jnl`	Dominance Products and Faster Algorithms for High-Dimensional Closest Pair under L CoRR Omer Gold, Micha Sharir
2016	J	`jnl`	Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. CoRR Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir
2016	J	`jnl`	Dynamic Time Warping: Breaking the Quadratic Barrier. CoRR Omer Gold, Micha Sharir
2016	J	`jnl`	Eliminating Depth Cycles among Triangles in Three Dimensions. CoRR Boris Aronov, Edward Y. Miller, Micha Sharir
2016	J	`jnl`	Generalizations of the Szemerédi-Trotter Theorem. Discret. Comput. Geom. Saarik Kalia, Micha Sharir, Noam Solomon, Ben Yang
2016	J	`jnl`	Incidences with Curves in ℝ Electron. J. Comb. Micha Sharir, Adam Sheffer, Noam Solomon
2016	J	`jnl`	The Decision Tree Complexity for k-SUM is at most Nearly Quadratic. CoRR Esther Ezra, Micha Sharir
2016	J	`jnl`	The Elekes-Szabó Theorem in four dimensions. CoRR Orit E. Raz, Micha Sharir, Frank de Zeeuw
2015	J	`jnl`	A faster algorithm for the discrete Fréchet distance under translation. CoRR Rinat Ben Avraham, Haim Kaplan, Micha Sharir
2015	J	`jnl`	Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. CoRR Boris Aronov, Micha Sharir
2015	J	`jnl`	Delaunay Triangulations of Degenerate Point Sets. CoRR Michael Khanimov, Micha Sharir
2015	J	`jnl`	Finding the largest disk containing a query point in logarithmic time with linear storage. J. Comput. Geom. Tal Kaminker, Micha Sharir
2015	J	`jnl`	Improved Bounds for 3SUM, K-SUM, and Linear Degeneracy. CoRR Omer Gold, Micha Sharir
2015	J	`jnl`	Improved Bounds for Incidences Between Points and Circles. Comb. Probab. Comput. Micha Sharir, Adam Sheffer, Joshua Zahl
2015	A*	`conf`	Incidences between Points and Lines in R^4. FOCS Micha Sharir, Noam Solomon
2015	A*	`conf`	Incidences between Points and Lines in Three Dimensions. SoCG Micha Sharir, Noam Solomon
2015	A	`conf`	Incidences with Curves in ℝ d. ESA Micha Sharir, Adam Sheffer, Noam Solomon
2015	J	`jnl`	Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. Discret. Comput. Geom. Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir
2015	J	`jnl`	On Triple Intersections of Three Families of Unit Circles. Discret. Comput. Geom. Orit E. Raz, Micha Sharir, József Solymosi
2015	A*	`conf`	Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited. SoCG Orit E. Raz, Micha Sharir, Frank de Zeeuw
2015	J	`jnl`	Sets with few distinct distances do not have heavy lines. Discret. Math. Orit E. Raz, Oliver Roche-Newton, Micha Sharir
2015	J	`jnl`	Stable Delaunay Graphs. CoRR Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir
2015	J	`jnl`	Stable Delaunay Graphs. Discret. Comput. Geom. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir
2015	J	`jnl`	The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. ACM Trans. Algorithms Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir
2015	A*	`conf`	The Number of Unit-Area Triangles in the Plane: Theme and Variations. SoCG Orit E. Raz, Micha Sharir
2015	J	`jnl`	The number of unit-area triangles in the plane: Theme and variations. CoRR Orit E. Raz, Micha Sharir
2014	J	`jnl`	A note on distinct distances in rectangular lattices. Discret. Math. Javier Cilleruelo, Micha Sharir, Adam Sheffer
2014	J	`jnl`	Computing the Discrete Fréchet Distance in Subquadratic Time. SIAM J. Comput. Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir
2014	J	`jnl`	Epsilon-Nets for Halfspaces Revisited. CoRR Sariel Har-Peled, Haim Kaplan, Micha Sharir, Shakhar Smorodinsky
2014	A*	`conf`	Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage. SoCG Tal Kaminker, Micha Sharir
2014	J	`jnl`	Improved Bounds for the Union of Locally Fat Objects in the Plane. SIAM J. Comput. Boris Aronov, Mark de Berg, Esther Ezra, Micha Sharir
2014	A*	`conf`	Incidences between points and lines in R4: Extended Abstract. SoCG Micha Sharir, Noam Solomon
2014	J	`jnl`	Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. CoRR Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir
2014	A	`conf`	Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. ESA Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis
2014	A*	`conf`	On triple intersections of three families of unit circles. SoCG Orit E. Raz, Micha Sharir, József Solymosi
2014	J	`jnl`	Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms. CoRR Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis
2014	A*	`conf`	Polynomials vanishing on grids: The Elekes-Rónyai problem revisited. SoCG Orit E. Raz, Micha Sharir, József Solymosi
2014	J	`jnl`	Polynomials vanishing on grids: The Elekes-Rónyai problem revisited. CoRR Orit E. Raz, Micha Sharir, József Solymosi
2014	J	`jnl`	Reporting Neighbors in High-Dimensional Euclidean Space. SIAM J. Comput. Dror Aiger, Haim Kaplan, Micha Sharir
2014	A*	`conf`	The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. SoCG Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir
2014	J	`jnl`	Union of Random Minkowski Sums and Network Vulnerability Analysis. Discret. Comput. Geom. Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir
2013	A*	`conf`	Computing the Discrete Fréchet Distance in Subquadratic Time. SODA Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir
2013	J	`jnl`	Counting Plane Graphs: Cross-Graph Charging Schemes. Comb. Probab. Comput. Micha Sharir, Adam Sheffer
2013	J	`jnl`	Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique. J. Comb. Theory A Micha Sharir, Adam Sheffer, Emo Welzl
2013	J	`jnl`	Distinct distances on two lines CoRR Micha Sharir, Adam Sheffer
2013	J	`jnl`	Distinct distances on two lines. J. Comb. Theory A Micha Sharir, Adam Sheffer, József Solymosi
2013	J	`jnl`	Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage. CoRR Tal Kaminker, Micha Sharir
2013	J	`jnl`	Finding the largest Empty Disk containing a Query Point. Int. J. Comput. Geom. Appl. Haim Kaplan, Micha Sharir
2013	A*	`conf`	Improved bounds for incidences between points and circles. SoCG Micha Sharir, Adam Sheffer, Joshua Zahl
2013	J	`jnl`	On Range Searching with Semialgebraic Sets. II. SIAM J. Comput. Pankaj K. Agarwal, Jirí Matousek, Micha Sharir
2013	J	`jnl`	On lattices, distinct distances, and the Elekes-Sharir framework. CoRR Javier Cilleruelo, Micha Sharir, Adam Sheffer
2013	J	`jnl`	On the Union Complexity of Diametral Disks. Electron. J. Comb. Boris Aronov, Muriel Dulieu, Rom Pinchasi, Micha Sharir
2013	J	`jnl`	Output-Sensitive Tools for Range Searching in Higher Dimensions. CoRR Micha Sharir, Shai Zaban
2013	A*	`conf`	Reporting neighbors in high-dimensional Euclidean spaces. SODA Dror Aiger, Haim Kaplan, Micha Sharir
2013	J	`jnl`	The 2-center problem in three dimensions. Comput. Geom. Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
2013	J	`jnl`	The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques. CoRR Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir
2013	J	`jnl`	Union of Random Minkowski Sums and Network Vulnerability Analysis. CoRR Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir
2013	A*	`conf`	Union of random minkowski sums and network vulnerability analysis. SoCG Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
2012	J	`jnl`	Computing the Discrete Fréchet Distance in Subquadratic Time CoRR Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir
2012	J	`jnl`	Counting Plane Graphs: Cross-Graph Charging Schemes CoRR Micha Sharir, Adam Sheffer
2012	A	`conf`	Counting Plane Graphs: Cross-Graph Charging Schemes. GD Micha Sharir, Adam Sheffer
2012	—	`conf`	Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique. SCG Micha Sharir, Adam Sheffer, Emo Welzl
2012	—	`conf`	Finding the maximal empty disk containing a query point. SCG Haim Kaplan, Micha Sharir
2012	J	`jnl`	Improved Bounds for Geometric Permutations. SIAM J. Comput. Natan Rubin, Haim Kaplan, Micha Sharir
2012	J	`jnl`	Incidences between points and non-coplanar circles CoRR Micha Sharir, Adam Sheffer, Joshua Zahl
2012	J	`jnl`	Near-Linear Approximation Algorithms for Geometric Hitting Sets. Algorithmica Pankaj K. Agarwal, Esther Ezra, Micha Sharir
2012	J	`jnl`	On Range Searching with Semialgebraic Sets II CoRR Pankaj K. Agarwal, Jirí Matousek, Micha Sharir
2012	A*	`conf`	On Range Searching with Semialgebraic Sets II. FOCS Pankaj K. Agarwal, Jirí Matousek, Micha Sharir
2012	J	`jnl`	Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique. Discret. Comput. Geom. Haim Kaplan, Jirí Matousek, Micha Sharir
2012	A*	`conf`	Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. SODA Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
2012	J	`jnl`	Unit Distances in Three Dimensions. Comb. Probab. Comput. Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir
2011	J	`jnl`	A kinetic triangulation scheme for moving points in the plane. Comput. Geom. Haim Kaplan, Natan Rubin, Micha Sharir
2011	J	`jnl`	An Improved Bound for Comb. Probab. Comput. Micha Sharir
2011	B	`conf`	Counting Plane Graphs: Flippability and Its Applications. WADS Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl
2011	J	`jnl`	Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique CoRR Micha Sharir, Adam Sheffer, Emo Welzl
2011	J	`jnl`	Counting Triangulations of Planar Point Sets. Electron. J. Comb. Micha Sharir, Adam Sheffer
2011	J	`jnl`	Finding the Maximal Empty Rectangle Containing a Query Point CoRR Haim Kaplan, Micha Sharir
2011	A*	`conf`	Improved Bound for the Union of Fat Triangles. SODA Esther Ezra, Boris Aronov, Micha Sharir
2011	J	`jnl`	Incidences in Three Dimensions and Distinct Distances in the Plane. Comb. Probab. Comput. György Elekes, Micha Sharir
2011	J	`jnl`	Kinetic Stable Delaunay Graphs CoRR Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir
2011	J	`jnl`	Non-Degenerate Spheres in Three Dimensions. Comb. Probab. Comput. Roel Apfelbaum, Micha Sharir
2011	J	`jnl`	On degrees in random triangulations of point sets. J. Comb. Theory A Micha Sharir, Adam Sheffer, Emo Welzl
2011	J	`jnl`	On lines, joints, and incidences in three dimensions. J. Comb. Theory A György Elekes, Haim Kaplan, Micha Sharir
2011	J	`jnl`	Optimal Cover of Points by Disks in a Simple Polygon. SIAM J. Comput. Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir
2011	J	`jnl`	Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting. Discret. Comput. Geom. Haim Kaplan, Edgar Ramos, Micha Sharir
2011	J	`jnl`	Relative ( Discret. Comput. Geom. Sariel Har-Peled, Micha Sharir
2011	J	`jnl`	Semialgebraic Range Reporting and Emptiness Searching with Applications. SIAM J. Comput. Micha Sharir, Hayim Shaul
2011	J	`jnl`	The Overlay of Minimization Diagrams in a Randomized Incremental Construction. Discret. Comput. Geom. Haim Kaplan, Edgar Ramos, Micha Sharir
2010	J	`jnl`	A Kinetic Triangulation Scheme for Moving Points in The Plane CoRR Haim Kaplan, Natan Rubin, Micha Sharir
2010	—	`conf`	A kinetic triangulation scheme for moving points in the plane. SCG Haim Kaplan, Natan Rubin, Micha Sharir
2010	—	`book`	Algorithm Derivation by Transformations (reprint). Micha Sharir
2010	J	`jnl`	An Improved Bound on the Number of Unit Area Triangles CoRR Roel Apfelbaum, Micha Sharir
2010	J	`jnl`	An Improved Bound on the Number of Unit Area Triangles. Discret. Comput. Geom. Roel Apfelbaum, Micha Sharir
2010	J	`jnl`	Approximate Halfspace Range Counting. SIAM J. Comput. Boris Aronov, Micha Sharir
2010	—	`book`	Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces (reprint). Kenneth L. Clarkson, Micha Sharir
2010	J	`jnl`	Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. Trans. Comput. Sci. Ophir Setter, Micha Sharir, Dan Halperin
2010	J	`jnl`	Counting Plane Graphs: Flippability and its Applications CoRR Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl
2010	J	`jnl`	Guarding a Terrain by Two Watchtowers. Algorithmica Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu
2010	J	`jnl`	Hausdorff distance under translation for points and balls. ACM Trans. Algorithms Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang
2010	J	`jnl`	Improved Bounds for Geometric Permutations CoRR Natan Rubin, Haim Kaplan, Micha Sharir
2010	A*	`conf`	Improved Bounds for Geometric Permutations. FOCS Natan Rubin, Haim Kaplan, Micha Sharir
2010	J	`jnl`	Incidences in Three Dimensions and Distinct Distances in the Plane CoRR György Elekes, Micha Sharir
2010	—	`conf`	Incidences in three dimensions and distinct distances in the plane. SCG György Elekes, Micha Sharir
2010	—	`conf`	Kinetic stable Delaunay graphs. SCG Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir
2010	J	`jnl`	Line Transversals of Convex Polyhedra in R SIAM J. Comput. Haim Kaplan, Natan Rubin, Micha Sharir
2010	J	`jnl`	On Lines and Joints. Discret. Comput. Geom. Haim Kaplan, Micha Sharir, Eugenii Shustin
2010	—	`conf`	On degrees in random triangulations of point sets. SCG Micha Sharir, Adam Sheffer, Emo Welzl
2010	—	`conf`	Optimal Cover of Points by Disks in a Simple Polygon. ESA (1) Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir
2010	J	`jnl`	Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes. SIAM J. Comput. Boris Aronov, Esther Ezra, Micha Sharir
2010	J	`jnl`	The 2-Center Problem in Three Dimensions CoRR Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
2010	—	`conf`	The 2-center problem in three dimensions. SCG Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
2009	—	`conf`	An improved bound on the number of unit area triangles. SCG Roel Apfelbaum, Micha Sharir
2009	—	`conf`	Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. ISVD Ophir Setter, Micha Sharir, Dan Halperin
2009	J	`jnl`	Counting Triangulations of Planar Point Sets CoRR Micha Sharir, Adam Sheffer, Emo Welzl
2009	J	`jnl`	Eppstein's bound on intersecting triangles revisited. J. Comb. Theory A Gabriel Nivasch, Micha Sharir
2009	J	`jnl`	Extremal problems on triangle areas in two and three dimensions. J. Comb. Theory A Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth
2009	A*	`conf`	Line transversals of convex polyhedra in SODA Haim Kaplan, Natan Rubin, Micha Sharir
2009	J	`jnl`	Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. Algorithmica Haim Kaplan, Natan Rubin, Micha Sharir
2009	—	`conf`	Near-linear approximation algorithms for geometric hitting sets. SCG Pankaj K. Agarwal, Esther Ezra, Micha Sharir
2009	J	`jnl`	On Lines, Joints, and Incidences in Three Dimensions CoRR György Elekes, Haim Kaplan, Micha Sharir
2009	J	`jnl`	On Overlays and Minimization Diagrams. Discret. Comput. Geom. Vladlen Koltun, Micha Sharir
2009	J	`jnl`	On Regular Vertices of the Union of Planar Convex Objects. Discret. Comput. Geom. Esther Ezra, János Pach, Micha Sharir
2009	J	`jnl`	On lines and Joints CoRR Haim Kaplan, Micha Sharir, Eugenii Shustin
2009	J	`jnl`	On the union of fat tetrahedra in three dimensions. J. ACM Esther Ezra, Micha Sharir
2009	J	`jnl`	Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. ACM Trans. Algorithms Ke Chen, Haim Kaplan, Micha Sharir
2009	J	`jnl`	Relative (p,epsilon)-Approximations in Geometry CoRR Sariel Har-Peled, Micha Sharir
2009	J	`jnl`	Semi-algebraic Range Reporting and Emptiness Searching with Applications CoRR Micha Sharir, Hayim Shaul
2009	A*	`conf`	Small-size epsilon-nets for axis-parallel rectangles and boxes. STOC Boris Aronov, Esther Ezra, Micha Sharir
2008	J	`jnl`	Algorithms for center and Tverberg points. ACM Trans. Algorithms Pankaj K. Agarwal, Micha Sharir, Emo Welzl
2008	J	`jnl`	An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions. Discret. Comput. Geom. Yevgeny Schreiber, Micha Sharir
2008	J	`jnl`	Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. Discret. Comput. Geom. Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman, Pat Morin, Micha Sharir, Michael A. Soss
2008	J	`jnl`	Efficient Algorithms for Maximum Regression Depth. Discret. Comput. Geom. Marc J. van Kreveld, Joseph S. B. Mitchell, Peter J. Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann
2008	J	`jnl`	Efficient Colored Orthogonal Range Counting. SIAM J. Comput. Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
2008	J	`jnl`	Eppstein's bound on intersecting triangles revisited CoRR Gabriel Nivasch, Micha Sharir
2008	—	`conf`	Extremal problems on triangle areas in two and three dimensions. SCG Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth
2008	J	`jnl`	Kinetic and dynamic data structures for closest pair and all nearest neighbors. ACM Trans. Algorithms Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
2008	J	`jnl`	Line Transversals of Convex Polyhedra in R CoRR Haim Kaplan, Natan Rubin, Micha Sharir
2008	J	`jnl`	On planar intersection graphs with forbidden subgraphs. J. Graph Theory János Pach, Micha Sharir
2008	J	`jnl`	On the performance of the ICP algorithm. Comput. Geom. Esther Ezra, Micha Sharir, Alon Efrat
2008	A	`conf`	Stabbing Convex Polygons with a Segment or a Polygon. ESA Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. Ganjugunte, Ewa Misiolek, Micha Sharir, Kai Tang
2008	—	`conf`	The complexity of the outer face in arrangements of random segments. SCG Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir
2008	A*	`conf`	Weak ε-nets and interval chains. SODA Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky
2008	J	`jnl`	Weak ε-nets and interval chains. J. ACM Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky
2007	J	`jnl`	A Single Cell in an Arrangement of Convex Polyhedra in \Bbb Discret. Comput. Geom. Esther Ezra, Micha Sharir
2007	A*	`conf`	Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions. FOCS Esther Ezra, Micha Sharir
2007	A	`conf`	Arrangements in Geometry: Recent Advances and Challenges. ESA Micha Sharir
2007	—	`conf`	Bi-criteria linear-time approximations for generalized k-mean/median/center. SCG Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
2007	—	`conf`	Computing the volume of the union of cubes. SCG Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
2007	A*	`conf`	Counting colors in boxes. SODA Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
2007	J	`jnl`	Kinetic and dynamic data structures for convex hulls and upper envelopes. Comput. Geom. Giora Alexandron, Haim Kaplan, Micha Sharir
2007	J	`jnl`	Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes. SIAM J. Discret. Math. Roel Apfelbaum, Micha Sharir
2007	A	`conf`	Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. ESA Haim Kaplan, Natan Rubin, Micha Sharir
2007	—	`conf`	On approximate halfspace range counting and relative epsilon-approximations. SCG Boris Aronov, Sariel Har-Peled, Micha Sharir
2007	—	`conf`	On regular vertices on the union of planar objects. SCG Esther Ezra, János Pach, Micha Sharir
2007	J	`jnl`	Online Conflict-Free Coloring for Intervals. SIAM J. Comput. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
2007	—	`conf`	Similar simplices in a d-dimensional point set. SCG Pankaj K. Agarwal, Roel Apfelbaum, George B. Purdy, Micha Sharir
2007	J	`jnl`	Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space. Discret. Comput. Geom. János Pach, Rom Pinchasi, Micha Sharir
2006	—	`conf`	An optimal-time algorithm for shortest paths on a convex polytope in three dimensions. SCG Yevgeny Schreiber, Micha Sharir
2006	—	`conf`	Colored intersection searching via sparse rectangular matrix multiplication. SCG Haim Kaplan, Micha Sharir, Elad Verbin
2006	J	`jnl`	Computing Maximally Separated Sets in the Plane. SIAM J. Comput. Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir
2006	—	`conf`	Computing a Center-Transversal Line. FSTTCS Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir
2006	A*	`conf`	Coresets forWeighted Facilities and Their Applications. FOCS Dan Feldman, Amos Fiat, Micha Sharir
2006	J	`jnl`	Minkowski Sums of Monotone and General Simple Polygons. Discret. Comput. Geom. Eduard Oks, Micha Sharir
2006	J	`jnl`	On empty convex polygons in a planar point set. J. Comb. Theory A Rom Pinchasi, Rados Radoicic, Micha Sharir
2006	—	`conf`	On overlays and minimization diagrams. SCG Vladlen Koltun, Micha Sharir
2006	—	`conf`	On the ICP algorithm. SCG Esther Ezra, Micha Sharir, Alon Efrat
2006	J	`jnl`	On the Number of Crossing-Free Matchings, Cycles, and Partitions. SIAM J. Comput. Micha Sharir, Emo Welzl
2006	J	`jnl`	On the Union of kappa-Round Objects in Three and Four Dimensions. Discret. Comput. Geom. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir
2006	A*	`conf`	On the number of crossing-free matchings, (cycles, and partitions). SODA Micha Sharir, Emo Welzl
2006	—	`conf`	Random triangulations of planar point sets. SCG Micha Sharir, Emo Welzl
2006	A*	`conf`	Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. SODA Haim Kaplan, Micha Sharir
2006	J	`jnl`	k-Sets in Four Dimensions. Discret. Comput. Geom. Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner
2005	J	`jnl`	An Improved Bound for Joints in Arrangements of Lines in Space. Discret. Comput. Geom. Sharona Feldman, Micha Sharir
2005	J	`jnl`	Counting and representing intersections among triangles in three dimensions. Comput. Geom. Esther Ezra, Micha Sharir
2005	J	`jnl`	Crossing patterns of semi-algebraic sets. J. Comb. Theory A Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir
2005	J	`jnl`	Curve-Sensitive Cuttings. SIAM J. Comput. Vladlen Koltun, Micha Sharir
2005	J	`jnl`	Cutting Triangular Cycles of Lines in Space. Discret. Comput. Geom. Boris Aronov, Vladlen Koltun, Micha Sharir
2005	J	`jnl`	Incidences between Points and Circles in Three and Higher Dimensions. Discret. Comput. Geom. Boris Aronov, Vladlen Koltun, Micha Sharir
2005	B	`conf`	Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. WADS Giora Alexandron, Haim Kaplan, Micha Sharir
2005	J	`jnl`	Lines Avoiding Unit Balls in Three Dimensions. Discret. Comput. Geom. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir
2005	J	`jnl`	On Graphs That Do Not Contain The Cube And Related Problems. Comb. Rom Pinchasi, Micha Sharir
2005	A*	`conf`	Online conflict-free coloring for intervals. SODA Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
2005	J	`jnl`	Output-Sensitive Construction of the Union of Triangles. SIAM J. Comput. Esther Ezra, Micha Sharir
2005	J	`jnl`	Pseudo-Line Arrangements: Duality, Algorithms, and Applications. SIAM J. Comput. Pankaj K. Agarwal, Micha Sharir
2005	A*	`conf`	Ray shooting amid balls, farthest point from a line, and range emptiness searching. SODA Micha Sharir, Hayim Shaul
2005	J	`jnl`	Ray shooting and stone throwing with near-linear storage. Comput. Geom. Micha Sharir, Hayim Shaul
2005	J	`jnl`	Repeated Angles in Three and Four Dimensions. SIAM J. Discret. Math. Roel Apfelbaum, Micha Sharir
2005	A*	`conf`	The interface between computational and combinatorial geometry. SODA Micha Sharir
2005	J	`jnl`	Top-Down Analysis of Path Compression. SIAM J. Comput. Raimund Seidel, Micha Sharir
2005	J	`jnl`	Topological Graphs with No Large Grids. Graphs Comb. János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth
2004	—	`ch.`	Algorithmic motion planning. Handbook of Discrete and Computational Geometry, 2nd Ed. Micha Sharir
2004	—	`conf`	Algorithms for center and Tverberg points. SCG Pankaj K. Agarwal, Micha Sharir, Emo Welzl
2004	J	`jnl`	Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles. Discret. Comput. Geom. Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir
2004	J	`jnl`	Cell Complexities in Hyperplane Arrangements. Discret. Comput. Geom. Boris Aronov, Micha Sharir
2004	A*	`conf`	Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. SODA Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir
2004	—	`conf`	Counting and representing intersections among triangles in three dimensions. SCG Esther Ezra, Micha Sharir
2004	J	`jnl`	Distinct Distances in Three and Higher Dimensions. Comb. Probab. Comput. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
2004	A*	`conf`	Geometrically aware communication in random wireless networks. PODC Gady Kozma, Zvi Lotker, Micha Sharir, Gideon Stupp
2004	J	`jnl`	Lenses in arrangements of pseudo-circles and their applications. J. ACM Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
2004	—	`conf`	New results on shortest paths in three dimensions. SCG Joseph S. B. Mitchell, Micha Sharir
2004	—	`conf`	On empty convex polygons in a planar point set. SCG Rom Pinchasi, Rados Radoicic, Micha Sharir
2004	—	`conf`	On lines avoiding unit balls in three dimensions. SCG Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir
2004	J	`jnl`	On the number of directions determined by a three-dimensional points set. J. Comb. Theory A János Pach, Rom Pinchasi, Micha Sharir
2004	J	`jnl`	On the number of views of translates of a cube and related problems. Comput. Geom. Boris Aronov, Robert Schiffenbauer, Micha Sharir
2004	—	`conf`	On the union of kapa-round objects. SCG Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir
2004	A*	`conf`	Output-sensitive construction of the union of triangles. SODA Eti Ezra, Micha Sharir
2004	J	`jnl`	Point-Line Incidences in Space. Comb. Probab. Comput. Micha Sharir, Emo Welzl
2004	J	`jnl`	Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions. Discret. Comput. Geom. Vladlen Koltun, Micha Sharir
2004	J	`jnl`	Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. Comb. Probab. Comput. Shakhar Smorodinsky, Micha Sharir
2004	—	`conf`	Solution of Scott's problem on the number of directions determined by a point set in 3-space. SCG János Pach, Rom Pinchasi, Micha Sharir
2004	J	`jnl`	Speeding up the incremental construction of the union of geometric objects in practice. Comput. Geom. Eti Ezra, Dan Halperin, Micha Sharir
2004	J	`jnl`	The Simplex Algorithm in Dimension Three. SIAM J. Comput. Volker Kaibel, Rafael Mechtel, Micha Sharir, Günter M. Ziegler
2003	J	`jnl`	3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations. SIAM J. Comput. Vladlen Koltun, Micha Sharir
2003	—	`conf`	A tight bound for the number of different directions in three dimensions. SCG János Pach, Rom Pinchasi, Micha Sharir
2003	—	`conf`	Curve-sensitive cuttings. SCG Vladlen Koltun, Micha Sharir
2003	A*	`conf`	Cutting triangular cycles of lines in space. STOC Boris Aronov, Vladlen Koltun, Micha Sharir
2003	A*	`conf`	Distinct distances in three and higher dimensions. STOC Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
2003	B	`conf`	Extremal Configurations and Levels in Pseudoline Arrangements. WADS Micha Sharir, Shakhar Smorodinsky
2003	—	`conf`	Hausdorff distance under translation for points and balls. SCG Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang
2003	J	`jnl`	On neighbors in geometric permutations. Discret. Math. Micha Sharir, Shakhar Smorodinsky
2003	A	`conf`	Ray Shooting and Stone Throwing. ESA Micha Sharir, Hayim Shaul
2003	J	`jnl`	The Clarkson-Shor Technique Revisited And Extended. Comb. Probab. Comput. Micha Sharir
2003	J	`jnl`	The Minkowski sum of a simple polygon and a segment. Inf. Process. Lett. Gennady Pustylnik, Micha Sharir
2003	J	`jnl`	The Partition Technique for Overlays of Envelopes. SIAM J. Comput. Vladlen Koltun, Micha Sharir
2003	J	`jnl`	The Union of Congruent Cubes in Three Dimensions. Discret. Comput. Geom. János Pach, Ido Safruti, Micha Sharir
2002	J	`jnl`	Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. Discret. Comput. Geom. Boris Aronov, Micha Sharir
2002	—	`conf`	Incidences between points and circles in three and higher dimensions. SCG Boris Aronov, Vladlen Koltun, Micha Sharir
2002	—	`conf`	Lenses in arrangements of pseudo-circles and their applications. SCG Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
2002	—	`conf`	On Neighbors in Geometric Permutations. SWAT Micha Sharir, Shakhar Smorodinsky
2002	A*	`conf`	On the overlay of envelopes in four dimensions. SODA Vladlen Koltun, Micha Sharir
2002	—	`conf`	Point-line incidences in space. SCG Micha Sharir, Emo Welzl
2002	—	`conf`	Polyhedral Voronoi diagrams of polyhedra in three dimensions. SCG Vladlen Koltun, Micha Sharir
2002	A*	`conf`	Pseudo-line arrangements: duality, algorithms, and applications. SODA Pankaj K. Agarwal, Micha Sharir
2002	J	`jnl`	Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
2002	A	`conf`	Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. ESA Eti Ezra, Dan Halperin, Micha Sharir
2002	J	`jnl`	The 2-Center Problem with Obstacles. J. Algorithms Dan Halperin, Micha Sharir, Kenneth Y. Goldberg
2002	J	`jnl`	The Number of Congruent Simplices in a Point Set. Discret. Comput. Geom. Pankaj K. Agarwal, Micha Sharir
2002	A*	`conf`	The Partition Technique for Overlays of Envelopes. FOCS Vladlen Koltun, Micha Sharir
2002	—	`conf`	Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations. SCG Vladlen Koltun, Micha Sharir
2002	A	`conf`	Translating a Planar Object to Maximize Point Containment. ESA Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl
2001	J	`jnl`	An Improved Bound for Discret. Comput. Geom. Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
2001	—	`conf`	Balanced lines, halving triangles, and the generalized lower bound theorem. SCG Micha Sharir, Emo Welzl
2001	—	`conf`	Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. SCG Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir
2001	J	`jnl`	Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. Discret. Comput. Geom. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
2001	J	`jnl`	On the Complexity of Arrangements of Circles in the Plane. Discret. Comput. Geom. Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir
2001	A*	`conf`	On the Complexity of Many Faces in Arrangements of Circles. FOCS Pankaj K. Agarwal, Boris Aronov, Micha Sharir
2001	J	`jnl`	On the Number of Regular Vertices of the Union of Jordan Regions. Discret. Comput. Geom. Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir
2001	—	`conf`	On the number of congruent simplices in a point. SCG Pankaj K. Agarwal, Micha Sharir
2001	J	`jnl`	Online Point Location in Planar Arrangements and Its Applications. Discret. Comput. Geom. Sariel Har-Peled, Micha Sharir
2001	A*	`conf`	Online point location in planar arrangements and its applications. SODA Sariel Har-Peled, Micha Sharir
2001	J	`jnl`	Radial Points in the Plane. Eur. J. Comb. János Pach, Micha Sharir
2001	B	`conf`	Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. WADS Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
2001	—	`conf`	The Clarkson-Shor technique revisited and extended. SCG Micha Sharir
2001	—	`conf`	The union of congruent cubes in three dimensions. SCG János Pach, Ido Safruti, Micha Sharir
2000	C	`conf`	An Improved Bound for k-Sets in Three Dimensions. EuroCG Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
2000	—	`conf`	An improved bound for SCG Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
2000	J	`jnl`	Approximation Algorithms for Minimum-Width Annuli and Shells. Discret. Comput. Geom. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
2000	—	`ch.`	Arrangements and Their Applications. Handbook of Computational Geometry Pankaj K. Agarwal, Micha Sharir
2000	—	`conf`	Computing the Penetration Depth of Two Convex Polytopes in 3D. SWAT Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir
2000	—	`ch.`	Davenport-Schinzel Sequences and Their Geometric Applications. Handbook of Computational Geometry Pankaj K. Agarwal, Micha Sharir
2000	J	`jnl`	Dynamic data structures for fat objects and their applications. Comput. Geom. Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir
2000	A*	`conf`	Exact and approximation algorithms for minimum-width cylindrical shells. SODA Pankaj K. Agarwal, Boris Aronov, Micha Sharir
2000	J	`jnl`	On the Complexity of the Union of Fat Convex Objects in the Plane. Discret. Comput. Geom. Alon Efrat, Micha Sharir
2000	J	`jnl`	Penetration Depth of Two Convex Polytopes in 3D. Nord. J. Comput. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir
2000	J	`jnl`	Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions. Discret. Comput. Geom. Pankaj K. Agarwal, Micha Sharir
2000	J	`jnl`	Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. Discret. Comput. Geom. Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir
2000	—	`conf`	The 2-center problem with obstacles. SCG Dan Halperin, Micha Sharir, Kenneth Y. Goldberg
1999	—	`conf`	Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. SCG Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
1999	—	`conf`	Efficient Algorithms for Maximum Regression Depth. SCG Marc J. van Kreveld, Joseph S. B. Mitchell, Peter J. Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann
1999	J	`jnl`	Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Discret. Comput. Geom. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
1999	J	`jnl`	Motion Planning for a Convex Polygon in a Polygonal Environment. Discret. Comput. Geom. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
1999	A*	`conf`	Motion Planning of a Ball Amid Segments in Three Dimensions. SODA Pankaj K. Agarwal, Micha Sharir
1999	J	`jnl`	On the Boundary of the Union of Planar Convex Sets. Discret. Comput. Geom. János Pach, Micha Sharir
1999	J	`jnl`	Partial surface matching by using directed footprints. Comput. Geom. Gill Barequet, Micha Sharir
1999	—	`conf`	Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. SCG Pankaj K. Agarwal, Micha Sharir
1999	—	`conf`	Recent Developments in the Theory of Arrangements of Surfaces. FSTTCS Micha Sharir
1999	—	`conf`	Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inR SCG Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir
1999	J	`jnl`	Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. SIAM J. Comput. Pankaj K. Agarwal, Alon Efrat, Micha Sharir
1998	J	`jnl`	Efficient Algorithms for Geometric Optimization. ACM Comput. Surv. Pankaj K. Agarwal, Micha Sharir
1998	J	`jnl`	Largest Placement of One Convex Polygon Inside Another. Discret. Comput. Geom. Pankaj K. Agarwal, Nina Amenta, Micha Sharir
1998	J	`jnl`	On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Discret. Comput. Geom. Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir
1998	J	`jnl`	On the Number of Incidences Between Points and Curves. Comb. Probab. Comput. János Pach, Micha Sharir
1998	—	`conf`	On the Number of Regular Vertices of the Union of Jordan Regions. SWAT Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir
1998	J	`jnl`	The Discrete 2-Center Problem. Discret. Comput. Geom. Pankaj K. Agarwal, Micha Sharir, Emo Welzl
1998	J	`jnl`	Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. Discret. Comput. Geom. Jean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec
1998	J	`jnl`	Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. J. Algorithms L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
1997	J	`jnl`	A Near-Linear Algorithm for the Planar 2-Center Problem. Discret. Comput. Geom. Micha Sharir
1997	J	`jnl`	An Expander-Based Approach to Geometric Optimization. SIAM J. Comput. Matthew J. Katz, Micha Sharir
1997	J	`jnl`	Approximating shortest paths on a convex polytope in three dimensions. J. ACM Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
1997	J	`jnl`	Computing Envelopes in Four Dimensions with Applications. SIAM J. Comput. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
1997	B	`conf`	Dynamic Data Structures for Fat Objects and Their Applications. WADS Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir
1997	A*	`conf`	Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. SODA Pankaj K. Agarwal, Boris Aronov, Micha Sharir
1997	J	`jnl`	On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm. Discret. Comput. Geom. Klara Kedem, Micha Sharir, Sivan Toledo
1997	—	`conf`	On Levels in Arrangements of Lines, Segments, Planes, and Triangles. SCG Pankaj K. Agarwal, Boris Aronov, Micha Sharir
1997	J	`jnl`	On Translational Motion Planning of a Convex Polyhedron in 3-Space. SIAM J. Comput. Boris Aronov, Micha Sharir
1997	—	`conf`	On the Complexity of the Union of Fat Objects in the Plane. SCG Alon Efrat, Micha Sharir
1997	J	`jnl`	Optimized-motion planning - theory and implementation by Cherif Ahrikencheikh and Ali Seireg : John Wiley & Sons Inc., Chichester (1994) 366 pp, ISBN 0-471-01903-8. Comput. Aided Des. Micha Sharir
1997	J	`jnl`	Quasi-Planar Graphs Have a Linear Number of Edges. Comb. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
1997	J	`jnl`	Ray Shooting Amidst Spheres in Three Dimensions and Related Problems. SIAM J. Comput. Shai Mohaban, Micha Sharir
1997	J	`jnl`	The Common Exterior of Convex Polygons in the Plane. Comput. Geom. Boris Aronov, Micha Sharir
1997	—	`conf`	The Discrete 2-Center Problem. SCG Pankaj K. Agarwal, Micha Sharir, Emo Welzl
1997	J	`jnl`	The Union of Convex Polyhedra in Three Dimensions. SIAM J. Comput. Boris Aronov, Micha Sharir, Boaz Tagansky
1997	J	`jnl`	Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces. Discret. Comput. Geom. Otfried Schwarzkopf, Micha Sharir
1996	—	`conf`	A Near-Linear Algorithm for the Planar 2-Center Problem. SCG Micha Sharir
1996	J	`jnl`	A Near-Linear Algorithm for the Planar Segment-Center Problem. Discret. Comput. Geom. Alon Efrat, Micha Sharir
1996	J	`jnl`	A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment. Discret. Comput. Geom. Dan Halperin, Micha Sharir
1996	J	`jnl`	A Subexponential Bound for Linear Programming. Algorithmica Jirí Matousek, Micha Sharir, Emo Welzl
1996	—	`conf`	Approximating Shortest Paths on a Convex Polytope in Three Dimensions. SCG Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
1996	—	`conf`	Arrangements of Curves and Surfaces in Computational Geometry. ISTCS Micha Sharir
1996	A*	`conf`	Efficient Generation of k-Directional Assembly Sequences. SODA Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir
1996	J	`jnl`	Efficient Randomized Algorithms for Some Geometric. Optimization Problems. Discret. Comput. Geom. Pankaj K. Agarwal, Micha Sharir
1996	J	`jnl`	Excess in Arrangements of Segments. Inf. Process. Lett. Micha Sharir
1996	J	`jnl`	Lines in Space: Combinatorics and Algorithms. Algorithmica Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi
1996	—	`conf`	Partial Surface Matching by Using Directed Footprints. SCG Gill Barequet, Micha Sharir
1996	J	`jnl`	Piecewise-Linear Interpolation between Polygonal Slices. Comput. Vis. Image Underst. Gill Barequet, Micha Sharir
1996	J	`jnl`	Ray Shooting Amidst Convex Polygons in 2D. J. Algorithms Pankaj K. Agarwal, Micha Sharir
1996	J	`jnl`	Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions. SIAM J. Comput. Pankaj K. Agarwal, Micha Sharir
1996	—	`conf`	Rectilinear and Polygonal SCG Micha Sharir, Emo Welzl
1996	J	`jnl`	The Overlay of Lower Envelopes and Its Applications. Discret. Comput. Geom. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir
1996	—	`conf`	Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications. SCG Otfried Schwarzkopf, Micha Sharir
1995	—	`ch.`	Algorithmic Techniques for Geometric Optimization. Computer Science Today Pankaj K. Agarwal, Micha Sharir
1995	J	`jnl`	Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. Discret. Comput. Geom. Dan Halperin, Micha Sharir
1995	J	`jnl`	An Elementary Approach to Lower Bounds in Geometric Discrepancy. Discret. Comput. Geom. Bernard Chazelle, Jirí Matousek, Micha Sharir
1995	B	`conf`	Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications. WADS Micha Sharir
1995	J	`jnl`	Computing Depth Orders for Fat Objects and Related Problems. Comput. Geom. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
1995	—	`book`	Davenport-Schinzel sequences and their geometric applications. Micha Sharir, Pankaj K. Agarwal
1995	—	`conf`	Efficient Randomized Algorithms for Some Geometric Optimization Problems. SCG Pankaj K. Agarwal, Micha Sharir
1995	J	`jnl`	Filling gaps in the boundary of a polyhedron. Comput. Aided Geom. Des. Gill Barequet, Micha Sharir
1995	J	`jnl`	Improved Bounds on Weak epsilon-Nets for Convex Sets. Discret. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1995	A	`conf`	Quasi-Planar Graphs Have a Linear Number of Edges. GD Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
1995	J	`jnl`	Reaching a Goal with Directional Uncertainty. Theor. Comput. Sci. Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud
1995	—	`conf`	The Overlay of Lower Envelopes in Three Dimensions and Its Applications. SCG Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir
1995	J	`jnl`	Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. Discret. Comput. Geom. Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir
1995	—	`conf`	Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. SCG Pankaj K. Agarwal, Alon Efrat, Micha Sharir
1995	—	`conf`	Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. SCG Jean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec
1995	A*	`conf`	Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. SODA L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
1994	A*	`conf`	A Near-Linear Algorithm for the Planar Segment Center Problem. SODA Alon Efrat, Micha Sharir
1994	J	`jnl`	Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. Algorithmica Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1994	J	`jnl`	Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions. Discret. Comput. Geom. Micha Sharir
1994	—	`conf`	Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. SCG Dan Halperin, Micha Sharir
1994	J	`jnl`	An Improved Technique for Output-Sensitive Hidden Surface Removal. Algorithmica Mark H. Overmars, Micha Sharir
1994	J	`jnl`	Applications of Parametric Searching in Geometric Optimization. J. Algorithms Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
1994	J	`jnl`	Castles in the Air Revisited. Discret. Comput. Geom. Boris Aronov, Micha Sharir
1994	—	`conf`	Computing Depth Orders and Related Problems. SWAT Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
1994	—	`conf`	Computing Envelopes in Four Dimensions with Applications. SCG Pankaj K. Agarwal, Boris Aronov, Micha Sharir
1994	J	`jnl`	Computing the Smallest K-enclosing Circle and Related Problems. Comput. Geom. Alon Efrat, Micha Sharir, Alon Ziv
1994	J	`jnl`	External Polygon Containment Problems. Comput. Geom. Micha Sharir, Sivan Toledo
1994	J	`jnl`	Fat Triangles Determine Linearly Many Holes. SIAM J. Comput. Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
1994	J	`jnl`	Motion Planning in the Presence of Moving Obstacles. J. ACM John H. Reif, Micha Sharir
1994	J	`jnl`	New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains. Discret. Comput. Geom. Dan Halperin, Micha Sharir
1994	J	`jnl`	On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. Dan Halperin, Micha Sharir
1994	J	`jnl`	On Joints in Arrangements of Lines in Space and Related Problems. J. Comb. Theory A Micha Sharir
1994	—	`conf`	On Translational Motion Planning in 3-Space. SCG Boris Aronov, Micha Sharir
1994	J	`jnl`	On the Number of Views of Polyhedral Terrains. Discret. Comput. Geom. Pankaj K. Agarwal, Micha Sharir
1994	J	`jnl`	On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. J. Comb. Theory A Boris Aronov, Jirí Matousek, Micha Sharir
1994	—	`conf`	Partial surface and volume matching in three dimensions. ICPR (2) Gill Barequet, Micha Sharir
1994	—	`conf`	Piecewise-Linear Interpolation Between Polygonal Slices. SCG Gill Barequet, Micha Sharir
1994	J	`jnl`	Planar Geometric Location Problems. Algorithmica Pankaj K. Agarwal, Micha Sharir
1994	J	`jnl`	Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
1994	J	`jnl`	Selecting Heavily Covered Points. SIAM J. Comput. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
1993	A*	`conf`	Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions FOCS Micha Sharir
1993	—	`conf`	An Expander-Based Approach to Geometric Optimization. SCG Matthew J. Katz, Micha Sharir
1993	J	`jnl`	An Invariant Property of Balls in Arrangements of Hyperplanes. Discret. Comput. Geom. Boris Aronov, Daniel Q. Naiman, János Pach, Micha Sharir
1993	J	`jnl`	Applications of a New Space-Partitioning Technique. Discret. Comput. Geom. Pankaj K. Agarwal, Micha Sharir
1993	—	`conf`	Arrangements of Surfaces in Higher Dimensions: Envelopes Single Cells and Other Recent Developments. CCCG Micha Sharir
1993	J	`jnl`	Circle Shooting in a Simple Polygon. J. Algorithms Pankaj K. Agarwal, Micha Sharir
1993	J	`jnl`	Circular visibility of a simple polygon from a fixed point. Int. J. Comput. Geom. Appl. Pankaj K. Agarwal, Micha Sharir
1993	J	`jnl`	Computing a Face in an Arrangement of Line Segments and Related Problems. SIAM J. Comput. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
1993	J	`jnl`	Computing a Segment Center for a Planar Point Set. J. Algorithms Pankaj K. Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo
1993	B	`conf`	Computing the Smallest k-Enclosing Circle and Related Problems. WADS Alon Efrat, Micha Sharir, Alon Ziv
1993	J	`jnl`	Counting Circular Arc Intersections. SIAM J. Comput. Pankaj K. Agarwal, Marco Pellegrini, Micha Sharir
1993	J	`jnl`	Diameter, Width, Closest Line Pair, and Parametric Searching. Discret. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1993	—	`conf`	Finding Maximally Consistent Sets of Halfspaces. CCCG Alon Efrat, Micha Lindenbaum, Micha Sharir
1993	—	`conf`	Implementation of a Motion Planning System in Three Dimensions. SCG Estarose Wolfson, Micha Sharir
1993	A*	`conf`	Improved bounds on weak epsilon-nets for convex sets. STOC Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1993	A*	`conf`	Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment FOCS Dan Halperin, Micha Sharir
1993	—	`conf`	New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. SCG Dan Halperin, Micha Sharir
1993	—	`conf`	On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm for a Convex Polygon in the Plane. CCCG Klara Kedem, Micha Sharir, Sivan Toledo
1993	—	`conf`	On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. CCCG Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir
1993	—	`conf`	On the Number of Views of Polyhedral Terrains. CCCG Pankaj K. Agarwal, Micha Sharir
1993	—	`conf`	On the Union of Fat Wedges and Separating a Collection of Segments By a Line. CCCG Alon Efrat, Günter Rote, Micha Sharir
1993	J	`jnl`	On the Union of Fat Wedges and Separating a Collection of Segments By a Line. Comput. Geom. Alon Efrat, Günter Rote, Micha Sharir
1993	J	`jnl`	On the Zone Theorem for Hyperplane Arrangements. SIAM J. Comput. Herbert Edelsbrunner, Raimund Seidel, Micha Sharir
1993	J	`jnl`	On the Zone of a Surface in a Hyperplane Arrangement. Discret. Comput. Geom. Boris Aronov, Marco Pellegrini, Micha Sharir
1993	—	`conf`	Optimal Slope Selection Via Expanders. CCCG Matthew J. Katz, Micha Sharir
1993	J	`jnl`	Optimal Slope Selection via Expanders. Inf. Process. Lett. Matthew J. Katz, Micha Sharir
1993	A*	`conf`	Ray Shooting Amidst Convex Polytopes in Three Dimensions. SODA Pankaj K. Agarwal, Micha Sharir
1993	B	`conf`	Reaching a Goal with Directional Uncertainty. ISAAC Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir
1993	J	`jnl`	Selecting Distances in the Plane. Algorithmica Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri
1993	J	`jnl`	Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. Comput. Geom. Kurt Mehlhorn, Micha Sharir, Emo Welzl
1993	—	`conf`	The Power of Geometric Duality and Minkowski Sums in Optical Computational Geometry. SCG Y. B. Karasik, Micha Sharir
1993	A*	`conf`	The Union of Convex Polyhedra in Three Dimensions FOCS Boris Aronov, Micha Sharir
1993	J	`jnl`	The Upper Envelope of voronoi Surfaces and Its Applications. Discret. Comput. Geom. Daniel P. Huttenlocher, Klara Kedem, Micha Sharir
1993	J	`jnl`	k-sets and random hulls. Comb. Micha Sharir
1992	A	`conf`	A Combinatorial Bound for Linear Programming and Related Problems. STACS Micha Sharir, Emo Welzl
1992	J	`jnl`	A Simple Output-Sensitive Algorithm for Hidden Surface Removal. ACM Trans. Graph. Micha Sharir, Mark H. Overmars
1992	—	`conf`	A Subexponential Bound for Linear Programming. SCG Jirí Matousek, Micha Sharir, Emo Welzl
1992	A*	`conf`	Applications of Parametric Searching in Geometric Optimization. SODA Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
1992	J	`jnl`	Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. Theor. Comput. Sci. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
1992	—	`conf`	Castles in the Air Revisited. SCG Boris Aronov, Micha Sharir
1992	—	`conf`	Diameter, Width, Closest Line Pair, and Parametric Searching. SCG Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1992	J	`jnl`	Efficient Hidden Surface Removal for Objects with Small Union Size. Comput. Geom. Matthew J. Katz, Mark H. Overmars, Micha Sharir
1992	J	`jnl`	Efficient Motion Planning for an L-Shaped Object. SIAM J. Comput. Dan Halperin, Mark H. Overmars, Micha Sharir
1992	J	`jnl`	Finding Effective "Force Targets" for Two-Dimensional Multifinger Frictional Grips. Algorithmica Jacob T. Schwartz, Micha Sharir
1992	—	`conf`	Optical Computational Geometry. SCG Y. B. Karasik, Micha Sharir
1992	J	`jnl`	Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. Algorithmica Bernard Chazelle, Micha Sharir, Emo Welzl
1992	J	`jnl`	Randomized Incremental Construction of Delaunay and Voronoi Diagrams. Algorithmica Leonidas J. Guibas, Donald E. Knuth, Micha Sharir
1992	J	`jnl`	Repeated Angles in the Plane and Related Problems. J. Comb. Theory A János Pach, Micha Sharir
1992	A*	`conf`	Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. SODA Kurt Mehlhorn, Micha Sharir, Emo Welzl
1992	J	`jnl`	The number of edges of many faces in a line segment arrangement. Comb. Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1991	J	`jnl`	A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications. Theor. Comput. Sci. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1991	B	`conf`	Applications of a New Space Partitioning Technique. WADS Pankaj K. Agarwal, Micha Sharir
1991	A*	`conf`	Computing a Face in an Arrangement of Line Segments. SODA Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
1991	J	`jnl`	Coordinated Motion Planning for Two Independent Robots. Ann. Math. Artif. Intell. Micha Sharir, Shmuel Sifrony
1991	—	`conf`	Counting Circular Arc Intersections. SCG Pankaj K. Agarwal, Micha Sharir
1991	J	`jnl`	Counting and Cutting Cycles of Lines and Rods in Space. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1991	—	`conf`	Efficient Hidden Surface Removal for Objects with small Union Size. SCG Matthew J. Katz, Mark H. Overmars, Micha Sharir
1991	A*	`conf`	Fat Triangles Determine Linearly Many Holes FOCS Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
1991	J	`jnl`	Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom. Comput. Geom. Dan Halperin, Micha Sharir
1991	J	`jnl`	Merging Visibility Maps. Comput. Geom. Mark H. Overmars, Micha Sharir
1991	J	`jnl`	Off-line Dynamic Maintenance of the Width of a Planar Point Set. Comput. Geom. Pankaj K. Agarwal, Micha Sharir
1991	J	`jnl`	On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. Dan Halperin, Micha Sharir
1991	J	`jnl`	On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm. SIAM J. Comput. János Pach, Micha Sharir
1991	J	`jnl`	On k-Sets in Arrangement of Curves and Surfaces. Discret. Comput. Geom. Micha Sharir
1991	—	`conf`	On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. SCG Boris Aronov, Jirí Matousek, Micha Sharir
1991	—	`conf`	On the Zone Theorem for Hyperplane Arrangements. New Results and New Trends in Computer Science Herbert Edelsbrunner, Raimund Seidel, Micha Sharir
1991	B	`conf`	On the Zone of a Surface in a Hyperplane Arrangement. WADS Boris Aronov, Micha Sharir
1991	A*	`conf`	Planar Geometric Location Problems and Maintaining the Width of a Planar Set. SODA Pankaj K. Agarwal, Micha Sharir
1991	J	`jnl`	Points and Triangles in the Plane and Halving Planes in Space. Discret. Comput. Geom. Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger
1991	A*	`conf`	Ray Shooting in Polygons Using Geodesic Triangulations. ICALP Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
1991	—	`conf`	The Upper Envelope of Voronoi Surfaces and Its Applications. SCG Daniel P. Huttenlocher, Klara Kedem, Micha Sharir
1991	J	`jnl`	Tight bounds on a problem of lines and intersections. Discret. Math. Micha Sharir, Steven Skiena
1990	—	`conf`	A Hyperplane Incidence Problem with Applications to Counting Distances. Applied Geometry And Discrete Mathematics Herbert Edelsbrunner, Micha Sharir
1990	—	`conf`	A Hyperplane Incidence Problem with Applications to Counting Distances. SIGAL International Symposium on Algorithms Herbert Edelsbrunner, Micha Sharir
1990	—	`ch.`	Algorithmic Motion Planning in Robotics. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) Jacob T. Schwartz, Micha Sharir
1990	J	`jnl`	An Algorithm for Generalized Point Location and its Applications. J. Symb. Comput. Bernard Chazelle, Micha Sharir
1990	—	`ch.`	An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space. Autonomous Robot Vehicles Klara Kedem, Micha Sharir
1990	J	`jnl`	An Efficient Motion-planning Algorithm for a Convex Polygonal Object in Two Dimensional Polygonal Space. Discret. Comput. Geom. Klara Kedem, Micha Sharir
1990	J	`jnl`	Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discret. Comput. Geom. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1990	A*	`conf`	Counting and Cutting Cycles of Lines and Rods in Space FOCS Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1990	—	`conf`	Merging Visibility Maps. SCG Mark H. Overmars, Micha Sharir
1990	J	`jnl`	On the Two-Dimensional Davenport Schinzel Problem. J. Symb. Comput. Jacob T. Schwartz, Micha Sharir
1990	—	`conf`	Points and Triangles in the Plane and Halving Planes in Space. SCG Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger
1990	—	`conf`	Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. SCG Bernard Chazelle, Micha Sharir, Emo Welzl
1990	A*	`conf`	Randomized Incremental Construction of Delaunay and Voronoi Diagrams. ICALP Leonidas J. Guibas, Donald E. Knuth, Micha Sharir
1990	J	`jnl`	Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. SIAM J. Comput. Pankaj K. Agarwal, Micha Sharir
1990	—	`conf`	Selecting Distances in the Plane. SCG Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri
1990	—	`conf`	Slimming Down by Adding: Selecting Heavily Covered Points. SCG Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
1990	J	`jnl`	Storing Line Segments in Partition Trees. BIT Mark H. Overmars, Haijo Schipper, Micha Sharir
1990	J	`jnl`	The Caratheodory number for the k-core. Comb. Imre Bárány, Micha Sharir
1990	—	`conf`	The Combinatorial Complexity of Hyperplane Transversals. SCG Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger
1990	J	`jnl`	The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1990	J	`jnl`	The Complexity of Many Cells in Arrangements of Planes and Related Problems. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1990	J	`jnl`	The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2. Discret. Comput. Geom. Herbert Edelsbrunner, Micha Sharir
1990	J	`jnl`	Triangles in space or building (and analyzing) castles in the air. Comb. Boris Aronov, Micha Sharir
1989	J	`jnl`	A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal Piecewise-Linear Motion of a Ladder. Inf. Process. Lett. Micha Sharir
1989	A*	`conf`	A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. ICALP Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1989	J	`jnl`	Algorithmic Motion Planning in Robotics. Computer Micha Sharir
1989	J	`jnl`	Computing the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. Richard Pollack, Micha Sharir, Günter Rote
1989	J	`jnl`	Implicitly Representing Arrangements of Lines or Segments. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
1989	A*	`conf`	Lines in Space-Combinatorics, Algorithms and Applications STOC Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1989	J	`jnl`	On Arrangement of Jordan Arcs with Three Intersection per Pair. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1989	J	`jnl`	On the General Motion-Planning Problem with Two Degrees of Freedom. Discret. Comput. Geom. Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony
1989	A*	`conf`	Output-Sensitive Hidden Surface Removal FOCS Mark H. Overmars, Micha Sharir
1989	J	`jnl`	Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. J. Comb. Theory A Pankaj K. Agarwal, Micha Sharir, Peter W. Shor
1989	J	`jnl`	The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis. Discret. Comput. Geom. János Pach, Micha Sharir
1989	J	`jnl`	The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1989	J	`jnl`	Visibility Problems for Polyhedral Terrains. J. Symb. Comput. Richard Cole, Micha Sharir
1988	J	`jnl`	A Survey of Motion Planning and Related Geometric Algorithms. Artif. Intell. Jacob T. Schwartz, Micha Sharir
1988	—	`conf`	An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space. SCG Klara Kedem, Micha Sharir
1988	A*	`conf`	Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. ICALP Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
1988	A*	`conf`	Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces FOCS Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1988	J	`jnl`	Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1988	—	`conf`	Coordinated Motion Planning for Two Independent Robots. SCG Micha Sharir, Shmuel Sifrony
1988	—	`conf`	Implicitly Representing Arrangements of Lines or Segments. SCG Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
1988	J	`jnl`	Improved lower bounds on the length of Davenport - Schinzel sequences. Comb. Micha Sharir
1988	—	`conf`	Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques. SWAT Leonidas J. Guibas, Mark H. Overmars, Micha Sharir
1988	—	`conf`	On Arrangements of Jordan Arcs with Three Intersections per Pair. SCG Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1988	—	`conf`	On the General Motion Planning Problem with Two Degrees of Freedom. SCG Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony
1988	J	`jnl`	On the shortest paths between two convex polyhedra. J. ACM Avikam Baltsan, Micha Sharir
1988	J	`jnl`	Planar Realizations of Nonlinear Davenport-Schnitzel Sequences by Segments. Discret. Comput. Geom. Ady Wiernik, Micha Sharir
1988	—	`conf`	Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. SCG Pankaj K. Agarwal, Micha Sharir
1988	J	`jnl`	Separating Two Simple Polygons by a Sequence of Translations. Discret. Comput. Geom. Ricky Pollack, Micha Sharir, Shmuel Sifrony
1988	—	`conf`	The Complexity of Many Faces in Arrangements of Lines and of Segments. SCG Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1988	J	`jnl`	The Shortest Watchtower and Related Problems for Polyhedral Terrains. Inf. Process. Lett. Micha Sharir
1988	A*	`conf`	Theoretical and experimental studies using a multifinger planar manipulator. ICRA James Demmel, Gerardo Lafferriere, Jacob T. Schwartz, Micha Sharir
1988	—	`conf`	Triangles in Space or Building (and Analyzing) Castles in the Air. SCG Boris Aronov, Micha Sharir
1987	J	`jnl`	A New Efficient Motion-Planning Algorithm for a Rod in Two-Dimensional Polygonal Space. Algorithmica Shmuel Sifrony, Micha Sharir
1987	J	`jnl`	Almost linear upper bounds on the length of general Davenport-Schinzel sequences. Comb. Micha Sharir
1987	J	`jnl`	An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers. J. Algorithms Daniel Leven, Micha Sharir
1987	—	`conf`	Computing the Link Center of a Simple Polygon. SCG William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1987	A*	`conf`	Efficient algorithms for planning purely translational collision-free motion in two and three dimensions. ICRA Micha Sharir
1987	J	`jnl`	Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. Algorithmica Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
1987	J	`jnl`	Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons. Algorithmica Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan
1987	J	`jnl`	On Shortest Paths Amidst Convex Polyhedra. SIAM J. Comput. Micha Sharir
1987	J	`jnl`	On k-Hulls and Related Problems. SIAM J. Comput. Richard Cole, Micha Sharir, Chee-Keng Yap
1987	A*	`conf`	On the Bivariate Function Minimization Problem And Its Applications to Motion Planning. ICALP Jacob T. Schwartz, Micha Sharir
1987	J	`jnl`	On the Existence and Synthesis of Multifinger Positive Grips. Algorithmica Bhubaneswar Mishra, Jacob T. Schwartz, Micha Sharir
1987	A*	`conf`	On the Lower Envelope of Bivariate Functions and its Applications FOCS Herbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir
1987	J	`jnl`	On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space. Discret. Comput. Geom. Daniel Leven, Micha Sharir
1987	J	`jnl`	Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams. Discret. Comput. Geom. Daniel Leven, Micha Sharir
1986	—	`conf`	A New Efficient Motion-Planning Algorithm for a Rod in Polygonal Space. SCG Shmuel Sifrony, Micha Sharir
1986	A*	`conf`	Geometric Applications of Davenport-Schinzel Sequences FOCS Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony
1986	—	`conf`	Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. SCG Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan
1986	J	`jnl`	Nonlinearity of Davenport - Schinzel sequences and of generalized path compression schemes. Comb. Sergiu Hart, Micha Sharir
1986	J	`jnl`	Object recognition by three-dimensional curve matching. Int. J. Intell. Syst. C. Marc Bastuscheck, Edith Schonberg, Jacob T. Schwartz, Micha Sharir
1986	—	`conf`	On Shortest Paths Amidst Convex Polyhedra. SCG Micha Sharir, Avikam Baltsan
1986	J	`jnl`	On Shortest Paths in Polyhedral Spaces. SIAM J. Comput. Micha Sharir, Amir Schorr
1986	J	`jnl`	On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles. Discret. Comput. Geom. Klara Kedem, Ron Livne, János Pach, Micha Sharir
1986	J	`jnl`	Probabilistic Propositional Temporal Logics Inf. Control. Sergiu Hart, Micha Sharir
1985	—	`conf`	An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles. SCG Klara Kedem, Micha Sharir
1985	—	`conf`	An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract). SCG Daniel Leven, Micha Sharir
1985	J	`jnl`	Concurrent Probabilistic Programs, Or: How to Schedule if You Must. SIAM J. Comput. Sergiu Hart, Micha Sharir
1985	J	`jnl`	Intersection and Closest-Pair Problems for a Set of Planar Discs. SIAM J. Comput. Micha Sharir
1985	A*	`conf`	Motion Planning in the Presence of Moving Obstacles FOCS John H. Reif, Micha Sharir
1985	A*	`conf`	On Minima of Functions, Intersection Patterns of Curves, and Davenport-Schinzel Sequences FOCS Micha Sharir, Ron Livne
1984	A*	`conf`	Nonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme FOCS Sergiu Hart, Micha Sharir
1984	A*	`conf`	On Shortest Paths in Polyhedral Spaces STOC Micha Sharir, Amir Schorr
1984	A*	`conf`	On k-hulls and Related Problems STOC Richard Cole, Micha Sharir, Chee-Keng Yap
1984	A*	`conf`	Probabilistic Temporal Logics for Finite and Bounded Models STOC Sergiu Hart, Micha Sharir
1984	J	`jnl`	Verification of Probabilistic Programs. SIAM J. Comput. Micha Sharir, Amir Pnueli, Sergiu Hart
1983	A*	`conf`	Concurrent Probabilistic Program, or: How to Schedule if You Must. ICALP Sergiu Hart, Micha Sharir
1983	J	`jnl`	Experience with the SETL Optimizer. ACM Trans. Program. Lang. Syst. Stefan M. Freudenberger, Jacob T. Schwartz, Micha Sharir
1983	A*	`conf`	Retraction: A New Approach to Motion-Planning (Extended Abstract) STOC Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
1983	J	`jnl`	Termination of Probabilistic Concurrent Program. ACM Trans. Program. Lang. Syst. Sergiu Hart, Micha Sharir, Amir Pnueli
1982	J	`jnl`	Fast Composition of Sparse Maps. Inf. Process. Lett. Micha Sharir
1982	J	`jnl`	Some Modified Algorithms for Dijkstra's Longest Upsequence Problem. Acta Informatica Robert B. K. Dewar, Susan M. Merritt, Micha Sharir
1982	J	`jnl`	Some Observations Concerning Formal Differentiation of Set Theoretic Expressions. ACM Trans. Program. Lang. Syst. Micha Sharir
1982	A*	`conf`	Termination of Probabilistic Concurrent Programs. POPL Sergiu Hart, Micha Sharir, Amir Pnueli
1982	J	`jnl`	Transformational Derivation of a Garbage Collection Algorithm. ACM Trans. Program. Lang. Syst. Robert B. K. Dewar, Micha Sharir, Elia Weixelbaum
1981	J	`jnl`	An Automatic Technique for Selection of Data Structures in SETL Programs. ACM Trans. Program. Lang. Syst. Edmond Schonberg, Jacob T. Schwartz, Micha Sharir
1981	A*	`conf`	Data Flow Analysis of Applicative Programs. ICALP Micha Sharir
1981	J	`jnl`	Formal Integration: A Program Transformation Technique. Comput. Lang. Micha Sharir
1980	J	`jnl`	Structural Analysis: A New Approch to Flow Analysis in Optimizing Compilers. Comput. Lang. Micha Sharir
1979	A*	`conf`	Automatic Data Structure Selection in SETL. POPL Edmond Schonberg, Jacob T. Schwartz, Micha Sharir
1979	—	`conf`	The design of a global optimizer. SIGPLAN Symposium on Compiler Construction Ronald J. Mintz, Gerald A. Fisher, Micha Sharir