, Near-linear time approximation algorithms for curve simplification, European Symposium on Algorithms (ESA), pp.29-41, 2002.
, Near-linear time approximation algorithms for curve simplification, Algorithmica, vol.42, pp.3-4203, 2005.
, Streaming geometric optimization using graphics hardware, European Symposium on Algorithms (ESA), pp.544-555, 2003.
, Independent set of intersection graphs of convex objects in 2D, Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pp.127-137, 2004.
, k-means projective clustering, ACM Symposium on Principles of Database Systems (PODS), pp.155-165, 2004.
, Independent set of intersection graphs of convex objects in 2D, Comput. Geom, vol.34, issue.2, pp.83-95, 2006.
, Fast molecular shape matching using contact maps, Journal of Computational Biology, vol.14, issue.2, pp.131-143, 2007.
, A conjecture on Wiener indices in combinatorial chemistry, Algorithmica, vol.40, issue.2, pp.99-117, 2004.
, On a conjecture on Wiener indices in combinatorial chemistry, International Computing and Combinatorics Conference (COCOON), pp.509-518, 2003.
, Centerpoints and Tverberg's technique, Computational Geometry, vol.43, issue.6-7, pp.6-7593, 2010.
DOI : 10.1016/j.comgeo.2010.03.002
, Hitting Simplices with Points in ???3, Discrete & Computational Geometry, vol.43, issue.2, pp.637-644, 2010.
DOI : 10.1007/s00454-010-9263-2
, Approximation algorithms for Euclidean group TSP, International Colloquium on Automata, Languages and Programming (ICALP), pp.1115-1126, 2005.
, Conflict-free colorings of rectangles ranges, Symposium on Theoretical Aspects of Computer Science (STACS), pp.254-263, 2006.
, Hardware-assisted computation of depth contours, ACM -SIAM Symposium on Discrete Algorithms (SODA), pp.558-567, 2002.
, Statistical Data Depth and the Graphics Hardware, Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp.223-250, 2006.
, Simplification of geometric objects, 2002.
, Simplification, Estimation and Classification of Geometric Objects, 2004.
, Hardware-assisted view-dependent map simplification, Symposium on Computational Geometry, pp.50-59, 2001.
, Dynamic simplification and visualization of large maps, International Journal of Geographical Information Science, vol.20, issue.3, pp.273-302, 2006.
, Majority consensus and the local majority rule, International Colloquium on Automata, Languages and Programming (ICALP), pp.530-542, 2001.
, Listen to your neighbors: How (not) to reach a consensus, SIAM J. Discrete Math, vol.17, issue.4, pp.634-660, 2004.
, Weak -nets have a basis of size O(1/? log 1/?), Comp. Geom: Theory and Appl, vol.40, issue.1, pp.84-91, 2008.
, Near-optimal generalizations of a theorem of Macbeath, Symposium on Theoretical Aspects of Computer Science (STACS), 2014.
, An optimal generalization of the centerpoint theorem, and its extensions, Symposium on Computational Geometry, pp.138-141, 2007.
, Weak -nets have basis of size O, any dimension. In Symposium on Computational Geometry, pp.239-244, 2007.
, An optimal extension of the Centerpoint theorem, Comput. Geom, vol.42, issue.6-7, pp.505-510, 2009.
, PTAS for geometric hitting set problems via local search, Symposium on Computational Geometry, pp.17-22, 2009.
, Improved results on geometric hitting set problems, Discrete & Computational Geometry, vol.44, issue.4, pp.883-895, 2010.
, A theorem of Bárány revisited and extended, Symposium on Computational Geometry, pp.333-338, 2012.
, Ray-shooting depth: Computing statistical data depth of point sets in the plane, European Symposium on Algorithms (ESA), pp.506-517, 2011.
, Centerflats: A unifying view of data-depth, 2013.
, A proof of the Oja-depth conjecture in the plane, Comp. Geom: Theory and Appl, 2013.
, Small weak epsilon-nets, Computational Geometry, vol.42, issue.5, pp.455-462, 2009.
DOI : 10.1016/j.comgeo.2008.02.005
URL : http://doi.org/10.1016/j.comgeo.2008.02.005
, Regression Depth and Center Points, Discrete & Computational Geometry, vol.23, issue.3, pp.305-323, 2000.
DOI : 10.1007/PL00009502
URL : http://arxiv.org/abs/cs/9809037
, Point Selections and Weak ??-Nets for Convex Hulls, Combinatorics, Probability and Computing, vol.89, issue.03, pp.189-200, 1992.
DOI : 10.1016/0012-365X(82)90115-7
, Small-size ??-nets for axis-parallel rectangles and boxes, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.3248-3282, 2010.
DOI : 10.1145/1536414.1536501
, Near-linear approximation algorithms for geometric hitting sets, Algorithmica, vol.63, issue.12, pp.1-25, 2012.
, A polynomial-time approximation scheme for weighted planar graph tsp, SODA, pp.33-41, 1998.
, Kamesh Munagala, and Vinayaka Pandit. Local search heuristic for k-median and facility location problems, STOC, pp.21-29, 2001.
, Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem, Advances in Mathematics, vol.96, issue.1, pp.103-112, 1992.
DOI : 10.1016/0001-8708(92)90052-M
, A Non-linear Lower Bound for Planar Epsilon-nets, Discrete & Computational Geometry, vol.16, issue.3, pp.235-244, 2012.
DOI : 10.1007/s00454-010-9323-7
, Algorithms for bivariate medians and a Fermat???Torricelli problem for lines, Computational Geometry, vol.26, issue.1, pp.69-79, 2003.
DOI : 10.1016/S0925-7721(02)00173-6
, Helly-type theorems and Generalized Linear Programming, Discrete & Computational Geometry, vol.4, issue.no. 1, pp.241-261, 1994.
DOI : 10.1007/BF02574379
, Label placement by maximum independent set in rectangles, Computational Geometry: Theory and Applications, vol.11, pp.209-218, 1998.
, Approximation Schemes for Maximum Weight Independent Set of Rectangles, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, p.2013, 2013.
DOI : 10.1109/FOCS.2013.50
, A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices, SODA, 2014.
DOI : 10.1137/1.9781611973402.49
, A generalization of carath??odory's theorem, Discrete Mathematics, vol.40, issue.2-3, pp.141-152, 1982.
DOI : 10.1016/0012-365X(82)90115-7
, Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles, Journal of Algorithms, vol.41, issue.2, pp.443-470, 2001.
DOI : 10.1006/jagm.2001.1188
, The number of triangles covering the center of an n-set, Geometriae Dedicata, vol.17, issue.1, pp.69-77, 1982.
DOI : 10.1007/BF00181519
, Almost optimal set covers in finite VC-dimension, Discrete & Computational Geometry, vol.16, issue.2, pp.463-479, 1995.
DOI : 10.1007/BF02570718
, Vorlesungen uber Differentialgeometrie. II, Affine Differentialgeometrie, 1923.
, Lower bounds for weak epsilon-nets and stair-convexity, Symposium on Computational Geometry, pp.1-10, 2009.
, Stabbing Simplices by Points and Flats, Discrete & Computational Geometry, vol.61, issue.2, pp.321-338, 2010.
DOI : 10.1007/s00454-008-9124-4
, A point in many triangles [CC09] Parinya Chalermsook and Julia Chuzhoy. Maximum independent set of rectangles, SODA, pp.892-901, 2006.
, Practical discrete unit disk cover using an exact line-separable algorithm, ISAAC, pp.45-54, 2009.
, Oja centers and centers of gravity, Computational Geometry, vol.46, issue.2, pp.140-147, 2013.
DOI : 10.1016/j.comgeo.2012.04.004
URL : https://hal.archives-ouvertes.fr/hal-00787177
, Improved bounds on weak ?-nets for convex sets, Proceedings of the twenty-fifth annual ACM Symposium on Theory of Computing, pp.495-504, 1993.
, A deterministic view of random sampling and its use in geometry, Combinatorica, vol.16, issue.3, pp.229-249, 1990.
DOI : 10.1007/BF02122778
, Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve, Computational Geometry, vol.46, issue.9, pp.1036-1041, 2013.
DOI : 10.1016/j.comgeo.2013.05.008
, Weighted Capacitated, Priority, and Geometric Set Cover via Improved Quasi-Uniform Sampling, SODA, 2012.
DOI : 10.1137/1.9781611973099.125
, Polynomial-time approximation schemes for packing and piercing fat objects, Journal of Algorithms, vol.46, issue.2, pp.178-189, 2003.
DOI : 10.1016/S0196-6774(02)00294-8
, Approximation algorithms for maximum independent set of pseudo-disks, Symposium on Computational Geometry, pp.333-340, 2009.
, Covering Points by Unit Disks of Fixed Location, ISAAC, pp.644-655, 2007.
DOI : 10.1007/978-3-540-77120-3_56
, Selecting Forwarding Neighbors in Wireless Ad Hoc Networks, Mobile Networks and Applications, vol.9, issue.2, pp.101-11143, 2004.
DOI : 10.1023/B:MONE.0000013622.63511.57
, On the discrete unit disk cover problem, In WALCOM, pp.146-157, 2011.
, Graph theory, 2000.
, Polynomial-Time Approximation Schemes for Geometric Intersection Graphs, Proc. of the 12th Annual ACM-SIAM Sympos. on Discrete Algorithms, pp.671-679, 2001.
DOI : 10.1137/S0097539702402676
, Hitting sets when the VC-dimension is small, Information Processing Letters, vol.95, issue.2, pp.358-362, 2005.
DOI : 10.1016/j.ipl.2005.03.010
, Approximating geometric coverage problems, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '08, 2008.
, Overlap properties of geometric expanders, SODA, 2011.
, Intersecting convex sets by rays, Proceedings of the Symposium on Computational Geometry, pp.385-391, 2008.
, Separator theorems and Tur??n-type results for planar intersection graphs, Advances in Mathematics, vol.219, issue.3, pp.1070-1080, 2009.
DOI : 10.1016/j.aim.2008.06.002
, Computing the Independence Number of Intersection Graphs, SODA, pp.1161-1165, 2011.
DOI : 10.1137/1.9781611973082.87
, Fast algorithms for shortest paths in planar graphs
, An Approximation Scheme for Terrain Guarding, APPROX-RANDOM, pp.140-148, 2009.
DOI : 10.1007/978-3-642-03685-9_11
, Polynomial Algorithms for Perfect Graphs, Ann. Discrete Math, vol.21, pp.211-356, 1981.
DOI : 10.1016/S0304-0208(08)72943-8
, Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics, vol.57, 2004.
, Approximation algorithms for dominating set in disk graphs. CoRR, abs/1004, 2010.
, Singularities, expanders and topology of map. part 2: From combinatorics to topology via algebraic isoperimetry, Geom. Func. Anal, vol.20, pp.416-526, 2010.
, Approximation schemes for covering and packing problems in robotics and vlsi, STACS, pp.55-62, 1984.
, Fast approximation algorithms for a nonconvex covering problem, Journal of Algorithms, vol.8, issue.3, pp.305-323, 1987.
DOI : 10.1016/0196-6774(87)90012-5
, NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs, Journal of Algorithms, vol.26, issue.2, pp.238-274, 1998.
DOI : 10.1006/jagm.1997.0903
, Epsilon-nets and simplex range queries, Proceedings of the second annual symposium on Computational geometry , SCG '86, pp.127-151, 1987.
DOI : 10.1145/10515.10522
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.5314
, Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane, Journal of Algorithms, vol.4, issue.4, pp.310-323, 1983.
DOI : 10.1016/0196-6774(83)90012-3
, A simpler proof of the boros-furedi-barany-pach-gromov theorem, Discrete and Computational Geometry, vol.47, issue.3, pp.492-495, 2012.
, A local search approximation algorithm for k-means clustering, Symposium on Computational Geometry, pp.10-18, 2002.
, A new lower bound based on Gromov's method of selecting heavily covered points Almost tight bounds for epsilon nets, Discrete & Computational Geometry, pp.163-173, 1992.
, Routing and Admission Control in Networks with Advance Reservations, Intl. Workshop on Approximation Algorithms for Combinatorial Optimization, pp.215-228, 2002.
DOI : 10.1007/3-540-45753-4_19
, A Separator Theorem for Planar Graphs, SIAM Journal on Applied Mathematics, vol.36, issue.2, 1977.
DOI : 10.1137/0136016
, Applications of a planar separator theorem, SIAM J. Comput, vol.9, issue.3, pp.615-627, 1980.
, Efficient partition trees, Discrete & Computational Geometry, vol.11, issue.5, pp.315-334, 1992.
DOI : 10.1007/BF02293051
, Lectures in Discrete Geometry, 2002.
DOI : 10.1007/978-1-4613-0039-7
, Finding small simple cycle separators for 2-connected planar graphs, J. Comput. Syst. Sci, vol.32, issue.3, pp.265-279, 1986.
, How to net a lot with little: small ??-nets for disks and halfspaces, Proceedings of the sixth annual symposium on Computational geometry , SCG '90, pp.16-22, 1990.
DOI : 10.1145/98524.98530
, New constructions of weak epsilon-nets, Discrete & Computational Geometry, vol.32, issue.2, pp.195-206, 2004.
, On Gromov???s Method of Selecting Heavily Covered Points, Manuscript, 2010.
DOI : 10.1007/s00454-014-9584-7
, An improved approximation factor for the unit disk covering problem, CCCG, 2006.
, Descriptive statistics for multivariate distributions, Statistics & Probability Letters, vol.1, issue.6, pp.327-332, 1983.
DOI : 10.1016/0167-7152(83)90054-8
, Combinatorial Geometry, 1995.
DOI : 10.1002/9781118033203
, New existence proofs for epsilon-nets, Proceedings of Symposium on Computational Geometry, pp.199-207, 2008.
, Tight lower bounds for the size of epsilon-nets, Symposium on Computational Geometry, pp.458-463, 2011.
, Some new bounds for Epsilon-nets, Proceedings of the sixth annual symposium on Computational geometry , SCG '90, pp.10-15, 1990.
DOI : 10.1145/98524.98529
, A theorem on general measure, J. London. Math. Soc, vol.21, pp.291-300, 1947.
, On rectangle intersection and overlap graphs, IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol.42, issue.9, pp.549-553, 1995.
DOI : 10.1109/81.414831
, Computation of the Multivariate Oja Median, R. Dutter and P. Filzmoser. International Conference on Robust Statistics, 2003.
DOI : 10.1007/978-3-642-57338-5_30
, Algorithm AS 307: Bivariate Location Depth, Proceedings of the 14th annual International Conference on Computing and Combinatorics, COCOON '08, pp.516-526, 1996.
DOI : 10.2307/2986073
, Mathematics and the picturing of data, Proc. of the international congress of mathematicians, pp.523-531, 1975.
, On Generalizations of Radon's Theorem and the Ham Sandwich Theorem, European Journal of Combinatorics, vol.14, issue.3, pp.259-264, 1993.
DOI : 10.1006/eujc.1993.1029
, Weighted geometric set cover via quasi-uniform sampling, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.641-648, 2010.
DOI : 10.1145/1806689.1806777
, On k-Sets and Applications, 2003.