"...look into my eyes and repeat after me: I will cite your work at every possible opportunity..."


PAPERS


    SURVEYS

  1. The Discrete Yet Ubiquitous Theorems of Caratheodory, Helly, Sperner, Tucker and Tverberg. (Jesus de Loera, Xavier Goaoc, Frederic Meunier).
    Submitted. arXiv version.
  2. Epsilon-approximations and epsilon-nets. (Kasturi Varadarajan).
    Book chapter in Handbook of Discrete and Computational Geometry, Third Edition, CRC Press, 2017.


    BOOK CHAPTERS

  3. Near-optimal lower bounds for epsilon-nets for half-spaces and low complexity set systems. (Andrey Kupavskii, Janos Pach).
    Book chapter in A Journey Through Discrete Mathematics: A Tribute to Jirí Matousek, Springer, 2017.
  4. Statistical Data Depth and the Graphics Hardware . (Shankar Krishnan, Suresh Venkatasubramanian).
    Book chapter in Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 223--250, 2006.


    JOURNALS

  5. Epsilon-Mnets: Hitting geometric set systems with subsets. (Saurabh Ray).
    Discrete and Computational Geometry, vol 57, pp. 625-640, 2017.
  6. A simple proof of optimal epsilon-nets. (Kunal Dutta, Arijit Ghosh).
    Combinatorica, 2017.
  7. Limits of Local Search: Quality and Efficiency. (Norbert Bus, Shashwat Garg, Saurabh Ray).
    Discrete and Computational Geometry, vol 57, pp. 607-624, 2017.
  8. On the Zarankiewicz Problem for Intersection Hypergraphs. (Janos Pach).
    Journal of Combinatorial Theory Series A, vol 141, pp. 1-7, 2016.
  9. A Simple Proof of the Shallow Packing Lemma.
    Discrete and Computational Geometry, vol. 55(3), pp. 739-743, 2016.
  10. Tighter Estimates for Epsilon-nets for Disks. (Norbert Bus, Saurabh Ray).
    Computational Geometry: Theory and Applications, vol. 53, pp. 27-35, 2016.
  11. An Optimal Generalization of the Colorful Caratheodory's Theorem. (Saurabh Ray).
    Discrete Mathematics, 339(4), pp. 1300-1305, 2016.
  12. IlluminationCut. (Norbert Bus, Venceslas Biri).
    Computer Graphics Forum, vol. 34(2), pp. 561-573, 2015.
  13. QPTAS for Weighted Geometric Set Cover on Pseudodisks and Halfspaces. (Rajiv Raman, Saurabh Ray).
    SIAM Journal on Computing, 44(6), pp. 1650-1669, 2015.
  14. K-Centerpoints Conjectures for Pointsets in R^d. (Saurabh Ray, Mudassir Shabbir).
    International Journal of Computational Geometry and Applications, vol. 25(3), pp. 163-185, 2015.
  15. Global Illumination Using Well-Separated Pair Decomposition. (Norbert Bus, Venceslas Biri).
    Computer Graphics Forum, 34(8), pp. 88-103, 2015.
  16. A Proof of the Oja-Depth Conjecture in the Plane. (Hans Raj Tiwary, Daniel Werner).
    Computational Geometry: Theory and Applications, vol. 47(6), pp. 668-674, 2014.
  17. Improved Results on Geometric Hitting Set Problems . (Saurabh Ray).
    Discrete and Computational Geometry, vol. 44(4), pp. 883-895, 2010.
  18. Hitting Simplices with Points in 3D . (Abdul Basit, Saurabh Ray, Sarfraz Raza).
    Discrete and Computational Geometry, vol. 44(3), pp. 637-644, 2010.
  19. Centerpoints and Tverberg's Technique . (Abdul Basit, Saurabh Ray, Sarfraz Raza).
    Computational Geometry: Theory and Applications, vol. 43(7), pp. 593-600, 2010.
  20. An Optimal Extension of the Centerpoint Theorem . (Saurabh Ray).
    Computational Geometry: Theory and Applications, vol. 42(7), pp. 505-510, 2009.
  21. Weak eps-nets have a Basis of size O(1/eps log 1/eps) . (Saurabh Ray). Best Paper Award.
    Computational Geometry: Theory and Applications, vol. 40(1), pp. 84-91, 2008.
  22. Fast Molecular Shape Matching Using Contact Maps . (Pankaj Agarwal, Yusu Wang).
    Journal of Computational Biology, vol. 14(2), pp. 131-143, 2007.
  23. Independent Set of Intersection Graphs of Convex Objects in 2D . (Pankaj Agarwal).
    Computational Geometry: Theory and Applications, vol. 34(2), pp. 83-95, 2006.
  24. Dynamic Simplification and Visualization of Large Maps . (Shankar Krishnan, Gokul Varadhan, Suresh Venkatasubramanian).
    International Journal of Geographical Information Science, vol. 20(3), pp. 273-302, 2006.
  25. Near-Linear Time Approximation Algorithms for Curve Simplification. (Pankaj Agarwal, Sariel Har-Peled, Yusu Wang).
    Algorithmica, vol. 42(3), pp. 203-219, 2005.
  26. On a Conjecture of Wiener Indices in Combinatorial Chemistry . (Sergei Bespamyatnikh, Andrew Ban).
    Algorithmica, vol. 40(2), pp. 99-118, 2004.
  27. Listen to Your Neighbors: How (Not) to Reach a Consensus . (Aleksandar Pekec)
    SIAM Journal on Discrete Mathematics, vol. 17(4), pp. 634-660, 2004.



    REFEREED CONFERENCES

  28. Combinatorics of Local Search: A 4-Local Hall's Theorem for Planar Graphs. (Daniel Antunes, Claire Mathieu).
    Proc. of the 25th Annual Symposium on Algorithms (ESA '17), 2017.
  29. Shallow Packings, Semialgebraic Set Systems, Macbeath Regions and Polynomial Partitioning. (Kunal Dutta, Arijit Ghosh, Bruno Jartoux).
    Proc. of the 33rd ACM Symposium on Computational Geometry (SoCG '17), 2017.
  30. Global Illumination Using Well-Separated Pair Decomposition. (Norbert Bus, Venceslas Biri).
    Proc. of the 37th Annual Conference of the European Association for Computer Graphics (Eurographics '16), 2016.
  31. New Lower Bounds for Epsilon-nets. (Andrey Kupavskii, Janos Pach).
    Proc. of the 32nd ACM Symposium on Computational Geometry (SoCG '16), 2016.
  32. On the Zarankiewicz Problem for Intersection Hypergraphs. (Janos Pach).
    Proc. of the 23rd International Symposium on Graph Drawing and Network Visualization (GD '15), 2015.
  33. IlluminationCut. (Norbert Bus, Venceslas Biri).
    Proc. of the 36th Annual Conference of the European Association for Computer Graphics (Eurographics '15), 2015.
  34. Geometric Hitting Sets for Disks: Theory and Practice. (Norbert Bus, Saurabh Ray).
    Proc. of the 23rd European Symposium on Algorithms (ESA '15), 2015.
  35. Improved Local-Search for Geometric Hitting Set. (Norbert Bus, Shashwat Garg, Saurabh Ray).
    Proc. of the 32st International Symposium on Theoretical Aspects of Computer Science (STACS '15), 2015.
  36. Settling the APX-hardness for Geometric Set-Cover. (Rajiv Raman, Saurabh Ray).
    Proc. of the 55th Annual Symposium on Foundations of Computer Science (FOCS '14), 2014.
  37. Near-Optimal Generalizations of a Theorem of Macbeath. (Saurabh Ray).
    Proc. of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS '14), 2014.
  38. A Separator Theorem for Intersecting Objects in the Plane. (Saurabh Ray, Rajiv Raman).
    Proc. of the 26th Canadian Conference on Computational Geometry (CCCG '14), 2014.
  39. A Theorem of Barany Revisited and Extended. (Saurabh Ray).
    Proc. of the 28th ACM Symposium on Computational Geometry (SoCG '12), 2012.
  40. Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane. (Saurabh Ray, Mudassir Shabbir).
    Proc. of the 19th European Symposium on Algorithms (ESA '11), 2011.
  41. Improving the First Selection Lemma in R3. (Abdul Basit, Saurabh Ray, Sarfraz Raza).
    Proc. of the 26th ACM Symposium on Computational Geometry (SoCG '10), 2010.
  42. PTAS for Geometric Hitting Set Problems via Local Search. (Saurabh Ray).
    Proc. of the 25th ACM Symposium on Computational Geometry (SoCG '09), 2009.
  43. Weak eps-nets have a Basis of size O(1/eps log 1/eps). (Saurabh Ray).
    Proc. of the 23rd ACM Symposium on Computational Geometry (SoCG '07), 2007.
  44. An Optimal Generalization of the Centerpoint Theorem, and its Extensions. (Saurabh Ray).
    Proc. of the 23rd ACM Symposium on Computational Geometry (SoCG '07), 2007.
  45. Conflict-Free Colorings of Rectangle Ranges . ( Khaled Elbassioni ).
    Proc. of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS '06), 2006.
  46. Approximation Algorithms for Euclidean Group TSP . ( Khaled Elbassioni , Alex Fishkin , Rene Sitters ).
    Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP '05), 2005.
  47. Independent Set of Intersection Graphs of Convex Objects in 2D . ( Pankaj Agarwal ).
    Proc. of the 7th Scandinavian Workshop on Algorithm Theory (SWAT '04), 2004.
  48. k-Means Projective Clustering . ( Pankaj Agarwal ).
    Proc. of the 23rd Symposium on Principles of Database Systems (PODS '04), 2004.
  49. Streaming Geometric Optimization Using Graphics Hardware . ( Pankaj Agarwal, Shankar Krishnan, Suresh Venkatasubramanian).
    Proc. of the 11th European Symposium on Algorithms (ESA '03), 2003.
  50. On a Conjecture on Wiener Indices in Combinatorial Chemistry . (Sergei Bespamyatnikh, Andrew Ban).
    Proc. of the 9th International Computing and Combinatorics Conference '03 , 2003.
  51. Near-Linear Time Approximation Algorithms for Curve Simplification in Two and Three dimensions . (Pankaj Agarwal, Sariel Har-Peled, Yusu Wang).
    Proc. of the 10th European Symposium on Algorithms (ESA '02), 2002.
  52. Hardware Assisted Depth Contours. (Shankar Krishnan, Suresh Venkatasubramanian).
    Proc. of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), 2002.
  53. Hardware Assisted View-Dependent Planar Map Simplification. (Shankar Krishnan, Suresh Venkatasubramanian).
    Proc. of the 17th ACM Symposium on Computational Geometry (SoCG '01), 2001.
  54. Majority Consensus and the Local Majority Rule. (Aleksandar Pekec)
    Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP '01), 2001.