Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDMicha Sharir
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j287]Dror Aiger, Haim Kaplan, Micha Sharir:
Output sensitive algorithms for approximate incidences and their applications. Comput. Geom. 91: 101666 (2020)- [j286]Esther Ezra
, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location. Discret. Comput. Geom. 64(1): 109-173 (2020) - [j285]Boris Aronov, Edward Y. Miller, Micha Sharir:
Eliminating Depth Cycles Among Triangles in Three Dimensions. Discret. Comput. Geom. 64(3): 627-653 (2020) - [j284]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications. Discret. Comput. Geom. 64(3): 838-904 (2020) - [c240]Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. Symposium on Computational Geometry 2020: 8:1-8:14 - [c239]Haim Kaplan, Micha Sharir, Uri Stemmer:
How to Find a Point in the Convex Hull Privately. Symposium on Computational Geometry 2020: 52:1-52:15 - [c238]Micha Sharir, Oleg Zlydenko:
Incidences Between Points and Curves with Almost Two Degrees of Freedom. Symposium on Computational Geometry 2020: 66:1-66:14 - [i64]Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. CoRR abs/2003.00518 (2020) - [i63]Micha Sharir, Oleg Zlydenko:
Incidences between points and curves with almost two degrees of freedom. CoRR abs/2003.02190 (2020) - [i62]Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. CoRR abs/2003.09533 (2020) - [i61]Haim Kaplan, Micha Sharir, Uri Stemmer:
How to Find a Point in the Convex Hull Privately. CoRR abs/2003.13192 (2020) - [i60]Shiri Artstein-Avidan, Haim Kaplan, Micha Sharir:
On Radial Isotropic Position: Theory and Algorithms. CoRR abs/2005.04918 (2020) - [i59]Dror Aiger, Haim Kaplan, Micha Sharir:
Output sensitive algorithms for approximate incidences and their applications. CoRR abs/2005.08193 (2020) - [i58]Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir:
Space-Aware Reconfiguration. CoRR abs/2006.04402 (2020) - [i57]Dror Aiger, Haim Kaplan, Micha Sharir:
Duality-based approximation algorithms for depth queries and maximum depth. CoRR abs/2006.12318 (2020) - [i56]Micha Sharir, Noam Solomon:
Incidences with curves in three dimensions. CoRR abs/2007.04081 (2020) - [i55]Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl:
On rich lenses in planar arrangements of circles and related problems. CoRR abs/2012.04204 (2020) - [i54]Micha Sharir, Noam Solomon:
On rich points and incidences with restricted sets of lines in 3-space. CoRR abs/2012.11913 (2020)
2010 – 2019
- 2019
- [j283]Haim Kaplan, Sasanka Roy, Micha Sharir:
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. Comput. Geom. 81: 1-11 (2019) - [j282]Esther Ezra, Micha Sharir:
A Nearly Quadratic Bound for Point-Location in Hyperplane Arrangements, in the Linear Decision Tree Model. Discret. Comput. Geom. 61(4): 735-755 (2019) - [c237]Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl:
General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem. Symposium on Computational Geometry 2019: 8:1-8:14 - [c236]Micha Sharir, Chen Ziv:
On the Complexity of the k-Level in Arrangements of Pseudoplanes. Symposium on Computational Geometry 2019: 62:1-62:15 - [c235]Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Triangles and Girth in Disk Graphs and Transmission Graphs. ESA 2019: 64:1-64:14 - [i53]Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl:
General techniques for approximate incidences and their application to the camera posing problem. CoRR abs/1903.07047 (2019) - [i52]Micha Sharir, Chen Ziv:
On the Complexity of the k-Level in Arrangements of Pseudoplanes. CoRR abs/1903.07196 (2019) - [i51]Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Triangles and Girth in Disk Graphs and Transmission Graphs. CoRR abs/1907.01980 (2019) - 2018
- [j281]Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis:
Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms. Algorithmica 80(8): 2400-2421 (2018) - [j280]Micha Sharir, Shakhar Smorodinsky, Claudiu Valculescu, Frank de Zeeuw:
Distinct distances between points and lines. Comput. Geom. 69: 2-15 (2018) - [j279]Micha Sharir, Noam Solomon:
Incidences Between Points and Lines on Two- and Three-Dimensional Varieties. Discret. Comput. Geom. 59(1): 88-130 (2018) - [j278]Boris Aronov, Micha Sharir:
Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. Discret. Comput. Geom. 59(3): 725-741 (2018) - [j277]Ariel Bruner, Micha Sharir:
Distinct distances between a collinear set and an arbitrary set of points. Discret. Math. 341(1): 261-265 (2018) - [j276]Dror Aiger, Micha Sharir:
Homotheties and incidences. Discret. Math. 341(7): 2011-2017 (2018) - [j275]Omer Gold, Micha Sharir:
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier. ACM Trans. Algorithms 14(4): 50:1-50:17 (2018) - [c234]Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Union of Hypercubes and 3D Minkowski Sums with Random Sizes. ICALP 2018: 10:1-10:15 - [c233]Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao:
Approximate Minimum-Weight Matching with Outliers Under Translation. ISAAC 2018: 26:1-26:13 - [c232]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing Pairwise Intersecting Disks by Five Points. ISAAC 2018: 50:1-50:12 - [c231]Micha Sharir:
Algebraic Techniques in Geometry: The 10th Anniversary. ISSAC 2018: 1-5 - [c230]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. SODA 2018: 495-514 - [i50]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing pairwise intersecting disks by five points. CoRR abs/1801.03158 (2018) - [i49]Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao:
Approximate Minimum-Weight Matching with Outliers under Translation. CoRR abs/1810.10466 (2018) - 2017
- [j274]Orit E. Raz, Micha Sharir:
The Number of Unit-Area Triangles in the Plane: Theme and Variation. Comb. 37(6): 1221-1240 (2017) - [j273]Orit E. Raz, Micha Sharir, Ilya D. Shkredov:
On the number of unit-area triangles spanned by convex grids in the plane. Comput. Geom. 62: 25-33 (2017) - [j272]Micha Sharir, Noam Solomon:
Incidences Between Points and Lines in $${\mathbb {R}}^4$$. Discret. Comput. Geom. 57(3): 702-756 (2017) - [j271]Micha Sharir, Joshua Zahl:
Cutting algebraic curves into pseudo-segments and applications. J. Comb. Theory, Ser. A 150: 1-35 (2017) - [j270]Micha Sharir:
Computational Geometry Column 65. SIGACT News 48(2): 68-85 (2017) - [j269]Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir:
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. ACM Trans. Algorithms 13(2): 26:1-26:42 (2017) - [c229]Micha Sharir:
The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art (Invited Talk). Symposium on Computational Geometry 2017: 2:1-2:1 - [c228]Esther Ezra, Micha Sharir:
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM. Symposium on Computational Geometry 2017: 41:1-41:15 - [c227]Pankaj K. Agarwal, Natan Rubin, Micha Sharir:
Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. ESA 2017: 4:1-4:13 - [c226]Dror Aiger, Haim Kaplan, Micha Sharir:
Output Sensitive Algorithms for Approximate Incidences and Their Applications. ESA 2017: 5:1-5:13 - [c225]Omer Gold, Micha Sharir:
Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy. ESA 2017: 42:1-42:13 - [c224]Haim Kaplan, Sasanka Roy, Micha Sharir:
Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points. ESA 2017: 52:1-52:13 - [c223]Omer Gold, Micha Sharir:
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier. ICALP 2017: 25:1-25:14 - [c222]Omer Gold, Micha Sharir:
Dominance Product and High-Dimensional Closest Pair under L_infty. ISAAC 2017: 39:1-39:12 - [c221]Micha Sharir, Noam Solomon:
Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances. SODA 2017: 2456-2475 - [c220]Boris Aronov, Edward Y. Miller, Micha Sharir:
Eliminating Depth Cycles among Triangles in Three Dimensions. SODA 2017: 2476-2494 - [c219]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. SODA 2017: 2495-2504 - [i48]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n5/3) time. CoRR abs/1704.02793 (2017) - [i47]Dror Aiger, Micha Sharir:
Homotheties and incidences. CoRR abs/1709.02933 (2017) - [i46]Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location. CoRR abs/1712.02913 (2017) - 2016
- [j268]Micha Sharir, Adam Sheffer, Noam Solomon:
Incidences with Curves in $\mathbb{R}^d$. Electron. J. Comb. 23(4): P4.16 (2016) - [j267]Micha Sharir, József Solymosi:
Distinct Distances from Three Points. Comb. Probab. Comput. 25(4): 623-632 (2016) - [j266]Saarik Kalia, Micha Sharir, Noam Solomon, Ben Yang:
Generalizations of the Szemerédi-Trotter Theorem. Discret. Comput. Geom. 55(3): 571-593 (2016) - [c218]Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Approximating the k-Level in Three-Dimensional Plane Arrangements. SODA 2016: 1193-1212 - [c217]Boris Aronov, Micha Sharir:
Almost tight bounds for eliminating depth cycles in three dimensions. STOC 2016: 1-8 - [i45]Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Approximating the $k$-Level in Three-Dimensional Plane Arrangements. CoRR abs/1601.04755 (2016) - [i44]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. CoRR abs/1604.03654 (2016) - [i43]Micha Sharir, Joshua Zahl:
Cutting Algebraic Curves into Pseudo-segments and Applications. CoRR abs/1604.07877 (2016) - [i42]Omer Gold, Micha Sharir:
Dominance Products and Faster Algorithms for High-Dimensional Closest Pair under L∞. CoRR abs/1605.08107 (2016) - [i41]Orit E. Raz, Micha Sharir, Frank de Zeeuw:
The Elekes-Szabó Theorem in four dimensions. CoRR abs/1607.03600 (2016) - [i40]Esther Ezra, Micha Sharir:
The Decision Tree Complexity for k-SUM is at most Nearly Quadratic. CoRR abs/1607.04336 (2016) - [i39]Omer Gold, Micha Sharir:
Dynamic Time Warping: Breaking the Quadratic Barrier. CoRR abs/1607.05994 (2016) - [i38]Boris Aronov, Edward Y. Miller, Micha Sharir:
Eliminating Depth Cycles among Triangles in Three Dimensions. CoRR abs/1607.06136 (2016) - 2015
- [j265]Micha Sharir, Adam Sheffer, Joshua Zahl:
Improved Bounds for Incidences Between Points and Circles. Comb. Probab. Comput. 24(3): 490-520 (2015) - [j264]Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir:
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. Discret. Comput. Geom. 54(4): 871-904 (2015) - [j263]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir:
Stable Delaunay Graphs. Discret. Comput. Geom. 54(4): 905-929 (2015) - [j262]Orit E. Raz, Micha Sharir, József Solymosi:
On Triple Intersections of Three Families of Unit Circles. Discret. Comput. Geom. 54(4): 930-953 (2015) - [j261]Orit E. Raz, Oliver Roche-Newton, Micha Sharir:
Sets with few distinct distances do not have heavy lines. Discret. Math. 338(8): 1484-1492 (2015) - [j260]Tal Kaminker, Micha Sharir:
Finding the largest disk containing a query point in logarithmic time with linear storage. J. Comput. Geom. 6(2): 3-18 (2015) - [j259]Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. ACM Trans. Algorithms 11(4): 29:1-29:29 (2015) - [c216]Orit E. Raz, Micha Sharir, Frank de Zeeuw:
Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited. Symposium on Computational Geometry 2015: 522-536 - [c215]Micha Sharir, Noam Solomon:
Incidences between Points and Lines in Three Dimensions. Symposium on Computational Geometry 2015: 553-568 - [c214]Orit E. Raz, Micha Sharir:
The Number of Unit-Area Triangles in the Plane: Theme and Variations. Symposium on Computational Geometry 2015: 569-583 - [c213]Micha Sharir, Adam Sheffer, Noam Solomon:
Incidences with Curves in ℝ d. ESA 2015: 977-988 - [c212]Micha Sharir, Noam Solomon:
Incidences between Points and Lines in R^4. FOCS 2015: 1378-1394 - [i37]Orit E. Raz, Micha Sharir:
The number of unit-area triangles in the plane: Theme and variations. CoRR abs/1501.00379 (2015) - [i36]Rinat Ben Avraham, Haim Kaplan, Micha Sharir:
A faster algorithm for the discrete Fréchet distance under translation. CoRR abs/1501.03724 (2015) - [i35]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir:
Stable Delaunay Graphs. CoRR abs/1504.06851 (2015) - [i34]Michael Khanimov, Micha Sharir:
Delaunay Triangulations of Degenerate Point Sets. CoRR abs/1510.04608 (2015) - [i33]Boris Aronov, Micha Sharir:
Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. CoRR abs/1512.00358 (2015) - [i32]Omer Gold, Micha Sharir:
Improved Bounds for 3SUM, K-SUM, and Linear Degeneracy. CoRR abs/1512.05279 (2015) - 2014
- [j258]Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Union of Random Minkowski Sums and Network Vulnerability Analysis. Discret. Comput. Geom. 52(3): 551-582 (2014) - [j257]Javier Cilleruelo, Micha Sharir, Adam Sheffer:
A note on distinct distances in rectangular lattices. Discret. Math. 336: 37-40 (2014) - [j256]Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir:
Computing the Discrete Fréchet Distance in Subquadratic Time. SIAM J. Comput. 43(2): 429-449 (2014) - [j255]Boris Aronov, Mark de Berg, Esther Ezra, Micha Sharir:
Improved Bounds for the Union of Locally Fat Objects in the Plane. SIAM J. Comput. 43(2): 543-572 (2014) - [j254]Dror Aiger, Haim Kaplan, Micha Sharir:
Reporting Neighbors in High-Dimensional Euclidean Space. SIAM J. Comput. 43(4): 1363-1395 (2014) - [c211]Micha Sharir, Noam Solomon:
Incidences between points and lines in R4: Extended Abstract. Symposium on Computational Geometry 2014: 189 - [c210]Orit E. Raz, Micha Sharir, József Solymosi:
On triple intersections of three families of unit circles. Symposium on Computational Geometry 2014: 198 - [c209]Tal Kaminker, Micha Sharir:
Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage. Symposium on Computational Geometry 2014: 206 - [c208]Orit E. Raz, Micha Sharir, József Solymosi:
Polynomials vanishing on grids: The Elekes-Rónyai problem revisited. Symposium on Computational Geometry 2014: 251 - [c207]Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. Symposium on Computational Geometry 2014: 377 - [c206]Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis:
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. ESA 2014: 100-111 - [i31]Orit E. Raz, Micha Sharir, József Solymosi:
Polynomials vanishing on grids: The Elekes-Rónyai problem revisited. CoRR abs/1401.7419 (2014) - [i30]Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir:
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. CoRR abs/1404.4851 (2014) - [i29]Sariel Har-Peled, Haim Kaplan, Micha Sharir, Shakhar Smorodinsky:
Epsilon-Nets for Halfspaces Revisited. CoRR abs/1410.3154 (2014) - [i28]Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis:
Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms. CoRR abs/1411.7273 (2014) - 2013
- [j253]Boris Aronov, Muriel Dulieu, Rom Pinchasi, Micha Sharir:
On the Union Complexity of Diametral Disks. Electron. J. Comb. 20(2): P53 (2013) - [j252]Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir:
The 2-center problem in three dimensions. Comput. Geom. 46(6): 734-746 (2013) - [j251]Micha Sharir, Adam Sheffer:
Counting Plane Graphs: Cross-Graph Charging Schemes. Comb. Probab. Comput. 22(6): 935-954 (2013) - [j250]Haim Kaplan, Micha Sharir:
Finding the largest Empty Disk containing a Query Point. Int. J. Comput. Geom. Appl. 23(4-5): 335-356 (2013) - [j249]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique. J. Comb. Theory, Ser. A 120(4): 777-794 (2013) - [j248]Micha Sharir, Adam Sheffer, József Solymosi:
Distinct distances on two lines. J. Comb. Theory, Ser. A 120(7): 1732-1736 (2013) - [j247]Pankaj K. Agarwal, Jirí Matousek, Micha Sharir:
On Range Searching with Semialgebraic Sets. II. SIAM J. Comput. 42(6): 2039-2062 (2013) - [c205]Micha Sharir, Adam Sheffer, Joshua Zahl:
Improved bounds for incidences between points and circles. Symposium on Computational Geometry 2013: 97-106 - [c204]Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Union of random minkowski sums and network vulnerability analysis. Symposium on Computational Geometry 2013: 177-186 - [c203]Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir:
Computing the Discrete Fréchet Distance in Subquadratic Time. SODA 2013: 156-167 - [c202]Dror Aiger, Haim Kaplan, Micha Sharir:
Reporting neighbors in high-dimensional Euclidean spaces. SODA 2013: 784-803 - [i27]Micha Sharir, Adam Sheffer:
Distinct distances on two lines. CoRR abs/1302.3081 (2013) - [i26]Javier Cilleruelo, Micha Sharir, Adam Sheffer:
On lattices, distinct distances, and the Elekes-Sharir framework. CoRR abs/1306.0242 (2013) - [i25]Tal Kaminker, Micha Sharir:
Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage. CoRR abs/1310.3388 (2013) - [i24]Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques. CoRR abs/1310.5245 (2013) - [i23]Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Union of Random Minkowski Sums and Network Vulnerability Analysis. CoRR abs/1310.5647 (2013) - [i22]Micha Sharir, Shai Zaban:
Output-Sensitive Tools for Range Searching in Higher Dimensions. CoRR abs/1312.6305 (2013) - 2012
- [j246]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Near-Linear Approximation Algorithms for Geometric Hitting Sets. Algorithmica 63(1-2): 1-25 (2012) - [j245]Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir:
Unit Distances in Three Dimensions. Comb. Probab. Comput. 21(4): 597-610 (2012) - [j244]Haim Kaplan, Jirí Matousek, Micha Sharir:
Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique. Discret. Comput. Geom. 48(3): 499-517 (2012) - [j243]Natan Rubin, Haim Kaplan, Micha Sharir:
Improved Bounds for Geometric Permutations. SIAM J. Comput. 41(2): 367-390 (2012) - [c201]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique. Symposium on Computational Geometry 2012: 189-198 - [c200]Haim Kaplan, Micha Sharir:
Finding the maximal empty disk containing a query point. Symposium on Computational Geometry 2012: 287-292 - [c199]Pankaj K. Agarwal, Jirí Matousek, Micha Sharir:
On Range Searching with Semialgebraic Sets II. FOCS 2012: 420-429 - [c198]Micha Sharir, Adam Sheffer:
Counting Plane Graphs: Cross-Graph Charging Schemes. Graph Drawing 2012: 19-30 - [c197]Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir:
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. SODA 2012: 338-355 - [i21]Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir:
Computing the Discrete Fréchet Distance in Subquadratic Time. CoRR abs/1204.5333 (2012) - [i20]Micha Sharir, Adam Sheffer, Joshua Zahl:
Incidences between points and non-coplanar circles. CoRR abs/1208.0053 (2012) - [i19]