default search action
BibTeX records: Saurabh Ray
@article{DBLP:journals/dcg/ElbassioniR24, author = {Khaled Elbassioni and Saurabh Ray}, title = {Geometric Stabbing via Threshold Rounding and Factor Revealing LPs}, journal = {Discret. Comput. Geom.}, volume = {71}, number = {3}, pages = {787--822}, year = {2024}, url = {https://doi.org/10.1007/s00454-023-00608-8}, doi = {10.1007/S00454-023-00608-8}, timestamp = {Thu, 21 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/ElbassioniR24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/DalalG0R24, author = {Suryendu Dalal and Rahul Gangopadhyay and Rajiv Raman and Saurabh Ray}, editor = {Wolfgang Mulzer and Jeff M. Phillips}, title = {Sweeping Arrangements of Non-Piercing Regions in the Plane}, booktitle = {40th International Symposium on Computational Geometry, SoCG 2024, June 11-14, 2024, Athens, Greece}, series = {LIPIcs}, volume = {293}, pages = {45:1--45:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2024}, url = {https://doi.org/10.4230/LIPIcs.SoCG.2024.45}, doi = {10.4230/LIPICS.SOCG.2024.45}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/DalalG0R24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/inoc/0013TRA24, author = {Jiwei Zhang and Dena Tayebi and Saurabh Ray and Deepak Ajwani}, editor = {Paula Carroll and Deepak Ajwani}, title = {Learning to Prune Instances of Steiner Tree Problem in Graphs}, booktitle = {Proceedings of the 11th International Network Optimization Conference, {INOC} 2024, Dublin, Ireland, March 11-23, 2024}, pages = {40--45}, publisher = {OpenProceedings.org}, year = {2024}, url = {https://doi.org/10.48786/inoc.2024.08}, doi = {10.48786/INOC.2024.08}, timestamp = {Tue, 16 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/inoc/0013TRA24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2403-16474, author = {Suryendu Dalal and Rahul Gangopadhyay and Rajiv Raman and Saurabh Ray}, title = {Sweeping Arrangements of Non-Piercing Curves in Plane}, journal = {CoRR}, volume = {abs/2403.16474}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2403.16474}, doi = {10.48550/ARXIV.2403.16474}, eprinttype = {arXiv}, eprint = {2403.16474}, timestamp = {Tue, 09 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2403-16474.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/BanikRR23, author = {Aritra Banik and Rajiv Raman and Saurabh Ray}, title = {On the geometric priority set cover problem}, journal = {Comput. Geom.}, volume = {112}, pages = {101984}, year = {2023}, url = {https://doi.org/10.1016/j.comgeo.2023.101984}, doi = {10.1016/J.COMGEO.2023.101984}, timestamp = {Tue, 28 Mar 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/comgeo/BanikRR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/RamanR22, author = {Rajiv Raman and Saurabh Ray}, title = {On the Geometric Set Multicover Problem}, journal = {Discret. Comput. Geom.}, volume = {68}, number = {2}, pages = {566--591}, year = {2022}, url = {https://doi.org/10.1007/s00454-022-00402-y}, doi = {10.1007/S00454-022-00402-Y}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcg/RamanR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/TayebiRA22, author = {Dena Tayebi and Saurabh Ray and Deepak Ajwani}, editor = {Cynthia A. Phillips and Bettina Speckmann}, title = {Learning to Prune Instances of \emph{k}-median and Related Problems}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2022, Alexandria, VA, USA, January 9-10, 2022}, pages = {184--194}, publisher = {{SIAM}}, year = {2022}, url = {https://doi.org/10.1137/1.9781611977042.15}, doi = {10.1137/1.9781611977042.15}, timestamp = {Mon, 11 Apr 2022 13:24:23 +0200}, biburl = {https://dblp.org/rec/conf/alenex/TayebiRA22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Banik0R21, author = {Aritra Banik and Rajiv Raman and Saurabh Ray}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {On Geometric Priority Set Cover Problems}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {12:1--12:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.12}, doi = {10.4230/LIPICS.ISAAC.2021.12}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Banik0R21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-12385, author = {Khaled M. Elbassioni and Saurabh Ray}, title = {Threshold Rounding for the Standard {LP} Relaxation of some Geometric Stabbing Problems}, journal = {CoRR}, volume = {abs/2106.12385}, year = {2021}, url = {https://arxiv.org/abs/2106.12385}, eprinttype = {arXiv}, eprint = {2106.12385}, timestamp = {Wed, 30 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-12385.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/RamanR20, author = {Rajiv Raman and Saurabh Ray}, title = {Constructing Planar Support for Non-Piercing Regions}, journal = {Discret. Comput. Geom.}, volume = {64}, number = {3}, pages = {1098--1122}, year = {2020}, url = {https://doi.org/10.1007/s00454-020-00216-w}, doi = {10.1007/S00454-020-00216-W}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcg/RamanR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/JensenJR20, author = {Frederik Brinck Jensen and Aadi Joshi and Saurabh Ray}, editor = {J. Mark Keil and Debajyoti Mondal}, title = {Discrete Helly type theorems}, booktitle = {Proceedings of the 32nd Canadian Conference on Computational Geometry, {CCCG} 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon, Saskatchewan, Canada}, pages = {332--335}, year = {2020}, timestamp = {Mon, 03 May 2021 21:50:39 +0200}, biburl = {https://dblp.org/rec/conf/cccg/JensenJR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/0001R20, author = {Rajiv Raman and Saurabh Ray}, editor = {Fabrizio Grandoni and Grzegorz Herman and Peter Sanders}, title = {Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions}, booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)}, series = {LIPIcs}, volume = {173}, pages = {78:1--78:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ESA.2020.78}, doi = {10.4230/LIPICS.ESA.2020.78}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/0001R20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/MustafaR19, author = {Nabil H. Mustafa and Saurabh Ray}, title = {On a Problem of Danzer}, journal = {Comb. Probab. Comput.}, volume = {28}, number = {3}, pages = {473--482}, year = {2019}, url = {https://doi.org/10.1017/S0963548318000445}, doi = {10.1017/S0963548318000445}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/MustafaR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ElbassioniRR19, author = {Khaled M. Elbassioni and Imran Rauf and Saurabh Ray}, title = {A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs}, journal = {Theor. Comput. Sci.}, volume = {767}, pages = {26--33}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.09.027}, doi = {10.1016/J.TCS.2018.09.027}, timestamp = {Fri, 12 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ElbassioniRR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BusMR18, author = {Norbert Bus and Nabil H. Mustafa and Saurabh Ray}, title = {Practical and efficient algorithms for the geometric hitting set problem}, journal = {Discret. Appl. Math.}, volume = {240}, pages = {25--32}, year = {2018}, url = {https://doi.org/10.1016/j.dam.2017.12.018}, doi = {10.1016/J.DAM.2017.12.018}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BusMR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/RoyGRR18, author = {Aniket Basu Roy and Sathish Govindarajan and Rajiv Raman and Saurabh Ray}, title = {Packing and Covering with Non-Piercing Regions}, journal = {Discret. Comput. Geom.}, volume = {60}, number = {2}, pages = {471--492}, year = {2018}, url = {https://doi.org/10.1007/s00454-018-9983-2}, doi = {10.1007/S00454-018-9983-2}, timestamp = {Mon, 17 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcg/RoyGRR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsc/KoprowskiMR18, author = {Przemyslaw Koprowski and Kurt Mehlhorn and Saurabh Ray}, title = {Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" {[J.} Symb. Comput. 45 {(2010)} 677-683]}, journal = {J. Symb. Comput.}, volume = {87}, pages = {238--241}, year = {2018}, url = {https://doi.org/10.1016/j.jsc.2017.05.008}, doi = {10.1016/J.JSC.2017.05.008}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsc/KoprowskiMR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/MustafaR18, author = {Nabil H. Mustafa and Saurabh Ray}, editor = {Yossi Azar and Hannah Bast and Grzegorz Herman}, title = {On a Problem of Danzer}, booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22, 2018, Helsinki, Finland}, series = {LIPIcs}, volume = {112}, pages = {64:1--64:8}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ESA.2018.64}, doi = {10.4230/LIPICS.ESA.2018.64}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/esa/MustafaR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/RamanR18, author = {Rajiv Raman and Saurabh Ray}, editor = {Yossi Azar and Hannah Bast and Grzegorz Herman}, title = {Planar Support for Non-piercing Regions and Applications}, booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22, 2018, Helsinki, Finland}, series = {LIPIcs}, volume = {112}, pages = {69:1--69:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ESA.2018.69}, doi = {10.4230/LIPICS.ESA.2018.69}, timestamp = {Mon, 17 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/RamanR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/BusGMR17, author = {Norbert Bus and Shashwat Garg and Nabil H. Mustafa and Saurabh Ray}, title = {Limits of Local Search: Quality and Efficiency}, journal = {Discret. Comput. Geom.}, volume = {57}, number = {3}, pages = {607--624}, year = {2017}, url = {https://doi.org/10.1007/s00454-016-9819-x}, doi = {10.1007/S00454-016-9819-X}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/BusGMR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/MustafaR17, author = {Nabil H. Mustafa and Saurabh Ray}, title = {{\(\epsilon\)} -Mnets: Hitting Geometric Set Systems with Subsets}, journal = {Discret. Comput. Geom.}, volume = {57}, number = {3}, pages = {625--640}, year = {2017}, url = {https://doi.org/10.1007/s00454-016-9845-8}, doi = {10.1007/S00454-016-9845-8}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/MustafaR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/BusGMR16, author = {Norbert Bus and Shashwat Garg and Nabil H. Mustafa and Saurabh Ray}, title = {Tighter estimates for {\unicode{1013}}-nets for disks}, journal = {Comput. Geom.}, volume = {53}, pages = {27--35}, year = {2016}, url = {https://doi.org/10.1016/j.comgeo.2015.12.002}, doi = {10.1016/J.COMGEO.2015.12.002}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/BusGMR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/MustafaR16, author = {Nabil H. Mustafa and Saurabh Ray}, title = {An optimal generalization of the Colorful Carath{\'{e}}odory theorem}, journal = {Discret. Math.}, volume = {339}, number = {4}, pages = {1300--1305}, year = {2016}, url = {https://doi.org/10.1016/j.disc.2015.11.019}, doi = {10.1016/J.DISC.2015.11.019}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/MustafaR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/KratschPR16, author = {Stefan Kratsch and Geevarghese Philip and Saurabh Ray}, title = {Point Line Cover: The Easy Kernel is Essentially Tight}, journal = {{ACM} Trans. Algorithms}, volume = {12}, number = {3}, pages = {40:1--40:16}, year = {2016}, url = {https://doi.org/10.1145/2832912}, doi = {10.1145/2832912}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/KratschPR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/GovindarajanRRR16, author = {Sathish Govindarajan and Rajiv Raman and Saurabh Ray and Aniket Basu Roy}, editor = {Piotr Sankowski and Christos D. Zaroliagis}, title = {Packing and Covering with Non-Piercing Regions}, booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24, 2016, Aarhus, Denmark}, series = {LIPIcs}, volume = {57}, pages = {47:1--47:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ESA.2016.47}, doi = {10.4230/LIPICS.ESA.2016.47}, timestamp = {Mon, 17 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/GovindarajanRRR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/AlvarezBRS15, author = {Victor Alvarez and Karl Bringmann and Saurabh Ray and Raimund Seidel}, title = {Counting triangulations and other crossing-free structures approximately}, journal = {Comput. Geom.}, volume = {48}, number = {5}, pages = {386--397}, year = {2015}, url = {https://doi.org/10.1016/j.comgeo.2014.12.006}, doi = {10.1016/J.COMGEO.2014.12.006}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/AlvarezBRS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/AlvarezBCR15, author = {Victor Alvarez and Karl Bringmann and Radu Curticapean and Saurabh Ray}, title = {Counting Triangulations and Other Crossing-Free Structures via Onion Layers}, journal = {Discret. Comput. Geom.}, volume = {53}, number = {4}, pages = {675--690}, year = {2015}, url = {https://doi.org/10.1007/s00454-015-9672-3}, doi = {10.1007/S00454-015-9672-3}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/AlvarezBCR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijcga/MustafaRS15, author = {Nabil H. Mustafa and Saurabh Ray and Mudassir Shabbir}, title = {k-Centerpoints Conjectures for Pointsets in {\(\mathbb{R}\)}d}, journal = {Int. J. Comput. Geom. Appl.}, volume = {25}, number = {3}, pages = {163--186}, year = {2015}, url = {https://doi.org/10.1142/S0218195915500107}, doi = {10.1142/S0218195915500107}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijcga/MustafaRS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MustafaRR15, author = {Nabil H. Mustafa and Rajiv Raman and Saurabh Ray}, title = {Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces}, journal = {{SIAM} J. Comput.}, volume = {44}, number = {6}, pages = {1650--1669}, year = {2015}, url = {https://doi.org/10.1137/14099317X}, doi = {10.1137/14099317X}, timestamp = {Mon, 17 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/MustafaRR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BusMR15, author = {Norbert Bus and Nabil H. Mustafa and Saurabh Ray}, editor = {Nikhil Bansal and Irene Finocchi}, title = {Geometric Hitting Sets for Disks: Theory and Practice}, booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9294}, pages = {903--914}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48350-3\_75}, doi = {10.1007/978-3-662-48350-3\_75}, timestamp = {Tue, 15 Feb 2022 07:54:27 +0100}, biburl = {https://dblp.org/rec/conf/esa/BusMR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BusGMR15, author = {Norbert Bus and Shashwat Garg and Nabil H. Mustafa and Saurabh Ray}, editor = {Ernst W. Mayr and Nicolas Ollinger}, title = {Improved Local Search for Geometric Hitting Set}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science, {STACS} 2015, March 4-7, 2015, Garching, Germany}, series = {LIPIcs}, volume = {30}, pages = {184--196}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.STACS.2015.184}, doi = {10.4230/LIPICS.STACS.2015.184}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/BusGMR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BusGMR15, author = {Norbert Bus and Shashwat Garg and Nabil H. Mustafa and Saurabh Ray}, title = {Tighter Estimates for epsilon-nets for Disks}, journal = {CoRR}, volume = {abs/1501.03246}, year = {2015}, url = {http://arxiv.org/abs/1501.03246}, eprinttype = {arXiv}, eprint = {1501.03246}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BusGMR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/FarberRS14, author = {Miriam Farber and Saurabh Ray and Shakhar Smorodinsky}, title = {On totally positive matrices and geometric incidences}, journal = {J. Comb. Theory {A}}, volume = {128}, pages = {149--161}, year = {2014}, url = {https://doi.org/10.1016/j.jcta.2014.08.004}, doi = {10.1016/J.JCTA.2014.08.004}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/FarberRS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/MustafaRR14, author = {Nabil H. Mustafa and Rajiv Raman and Saurabh Ray}, title = {Settling the APX-Hardness Status for Geometric Set Cover}, booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2014, Philadelphia, PA, USA, October 18-21, 2014}, pages = {541--550}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/FOCS.2014.64}, doi = {10.1109/FOCS.2014.64}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/MustafaRR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KratschPR14, author = {Stefan Kratsch and Geevarghese Philip and Saurabh Ray}, editor = {Chandra Chekuri}, title = {Point Line Cover: The Easy Kernel is Essentially Tight}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014}, pages = {1596--1606}, publisher = {{SIAM}}, year = {2014}, url = {https://doi.org/10.1137/1.9781611973402.116}, doi = {10.1137/1.9781611973402.116}, timestamp = {Tue, 02 Feb 2021 17:07:40 +0100}, biburl = {https://dblp.org/rec/conf/soda/KratschPR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/MustafaR14, author = {Nabil H. Mustafa and Saurabh Ray}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Near-Optimal Generalisations of a Theorem of Macbeath}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {578--589}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.578}, doi = {10.4230/LIPICS.STACS.2014.578}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/stacs/MustafaR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/MustafaRR14, author = {Nabil H. Mustafa and Rajiv Raman and Saurabh Ray}, title = {{QPTAS} for Geometric Set-Cover Problems via Optimal Separators}, journal = {CoRR}, volume = {abs/1403.0835}, year = {2014}, url = {http://arxiv.org/abs/1403.0835}, eprinttype = {arXiv}, eprint = {1403.0835}, timestamp = {Mon, 17 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/MustafaRR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AlvarezBRS14, author = {Victor Alvarez and Karl Bringmann and Saurabh Ray and Raimund Seidel}, title = {Counting Triangulations and other Crossing-Free Structures Approximately}, journal = {CoRR}, volume = {abs/1404.0261}, year = {2014}, url = {http://arxiv.org/abs/1404.0261}, eprinttype = {arXiv}, eprint = {1404.0261}, timestamp = {Fri, 23 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AlvarezBRS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/AlvarezBRS13, author = {Victor Alvarez and Karl Bringmann and Saurabh Ray and Raimund Seidel}, title = {Counting Triangulations Approximately}, booktitle = {Proceedings of the 25th Canadian Conference on Computational Geometry, {CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013}, publisher = {Carleton University, Ottawa, Canada}, year = {2013}, url = {http://cccg.ca/proceedings/2013/papers/paper\_21.pdf}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cccg/AlvarezBRS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KratschPR13, author = {Stefan Kratsch and Geevarghese Philip and Saurabh Ray}, title = {Point Line Cover: The Easy Kernel is Essentially Tight}, journal = {CoRR}, volume = {abs/1307.2521}, year = {2013}, url = {http://arxiv.org/abs/1307.2521}, eprinttype = {arXiv}, eprint = {1307.2521}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KratschPR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AlvarezBR13, author = {Victor Alvarez and Karl Bringmann and Saurabh Ray}, title = {A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations}, journal = {CoRR}, volume = {abs/1312.3188}, year = {2013}, url = {http://arxiv.org/abs/1312.3188}, eprinttype = {arXiv}, eprint = {1312.3188}, timestamp = {Fri, 23 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AlvarezBR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AlvarezBCR13, author = {Victor Alvarez and Karl Bringmann and Radu Curticapean and Saurabh Ray}, title = {Counting Triangulations and other Crossing-free Structures via Onion Layers}, journal = {CoRR}, volume = {abs/1312.4628}, year = {2013}, url = {http://arxiv.org/abs/1312.4628}, eprinttype = {arXiv}, eprint = {1312.4628}, timestamp = {Fri, 23 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AlvarezBCR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/AjwaniEGR12, author = {Deepak Ajwani and Khaled M. Elbassioni and Sathish Govindarajan and Saurabh Ray}, title = {Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors}, journal = {Discret. Comput. Geom.}, volume = {48}, number = {1}, pages = {39--52}, year = {2012}, url = {https://doi.org/10.1007/s00454-012-9425-5}, doi = {10.1007/S00454-012-9425-5}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcg/AjwaniEGR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ElbassioniRRS12, author = {Khaled M. Elbassioni and Rajiv Raman and Saurabh Ray and Ren{\'{e}} Sitters}, title = {On the complexity of the highway problem}, journal = {Theor. Comput. Sci.}, volume = {460}, pages = {70--77}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.07.028}, doi = {10.1016/J.TCS.2012.07.028}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ElbassioniRRS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/AlvarezBCR12, author = {Victor Alvarez and Karl Bringmann and Radu Curticapean and Saurabh Ray}, editor = {Tamal K. Dey and Sue Whitesides}, title = {Counting crossing-free structures}, booktitle = {Proceedings of the 28th {ACM} Symposium on Computational Geometry, Chapel Hill, NC, USA, June 17-20, 2012}, pages = {61--68}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2261250.2261259}, doi = {10.1145/2261250.2261259}, timestamp = {Mon, 14 Jun 2021 16:50:55 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/AlvarezBCR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/MustafaR12, author = {Nabil H. Mustafa and Saurabh Ray}, editor = {Tamal K. Dey and Sue Whitesides}, title = {A theorem of b{\'{a}}r{\'{a}}ny revisited and extended}, booktitle = {Proceedings of the 28th {ACM} Symposium on Computational Geometry, Chapel Hill, NC, USA, June 17-20, 2012}, pages = {333--338}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2261250.2261300}, doi = {10.1145/2261250.2261300}, timestamp = {Mon, 14 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/MustafaR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/ElbassioniRR11, author = {Khaled M. Elbassioni and Imran Rauf and Saurabh Ray}, title = {Enumerating Minimal Transversals of Geometric Hypergraphs}, booktitle = {Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011}, year = {2011}, url = {http://www.cccg.ca/proceedings/2011/papers/paper65.pdf}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cccg/ElbassioniRR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/MustafaRS11, author = {Nabil H. Mustafa and Saurabh Ray and Mudassir Shabbir}, editor = {Camil Demetrescu and Magn{\'{u}}s M. Halld{\'{o}}rsson}, title = {Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane}, booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken, Germany, September 5-9, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6942}, pages = {506--517}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-23719-5\_43}, doi = {10.1007/978-3-642-23719-5\_43}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/MustafaRS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/MustafaR10, author = {Nabil H. Mustafa and Saurabh Ray}, title = {Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension}, journal = {Comput. Geom.}, volume = {43}, number = {6-7}, pages = {565--571}, year = {2010}, url = {https://doi.org/10.1016/j.comgeo.2007.02.007}, doi = {10.1016/J.COMGEO.2007.02.007}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/MustafaR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/BasitMRR10, author = {Abdul Basit and Nabil H. Mustafa and Saurabh Ray and Sarfraz Raza}, title = {Centerpoints and Tverberg's technique}, journal = {Comput. Geom.}, volume = {43}, number = {6-7}, pages = {593--600}, year = {2010}, url = {https://doi.org/10.1016/j.comgeo.2010.03.002}, doi = {10.1016/J.COMGEO.2010.03.002}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/BasitMRR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/BasitMRR10, author = {Abdul Basit and Nabil H. Mustafa and Saurabh Ray and Sarfraz Raza}, title = {Hitting Simplices with Points in R\({}^{\mbox{3}}\)}, journal = {Discret. Comput. Geom.}, volume = {44}, number = {3}, pages = {637--644}, year = {2010}, url = {https://doi.org/10.1007/s00454-010-9263-2}, doi = {10.1007/S00454-010-9263-2}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/BasitMRR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/MustafaR10, author = {Nabil H. Mustafa and Saurabh Ray}, title = {Improved Results on Geometric Hitting Set Problems}, journal = {Discret. Comput. Geom.}, volume = {44}, number = {4}, pages = {883--895}, year = {2010}, url = {https://doi.org/10.1007/s00454-010-9285-9}, doi = {10.1007/S00454-010-9285-9}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/MustafaR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsc/MehlhornR10, author = {Kurt Mehlhorn and Saurabh Ray}, title = {Faster algorithms for computing Hong's bound on absolute positiveness}, journal = {J. Symb. Comput.}, volume = {45}, number = {6}, pages = {677--683}, year = {2010}, url = {https://doi.org/10.1016/j.jsc.2010.02.002}, doi = {10.1016/J.JSC.2010.02.002}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jsc/MehlhornR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/BasitMRR10, author = {Abdul Basit and Nabil H. Mustafa and Saurabh Ray and Sarfraz Raza}, editor = {David G. Kirkpatrick and Joseph S. B. Mitchell}, title = {Improving the first selection lemma in R\({}^{\mbox{3}}\)}, booktitle = {Proceedings of the 26th {ACM} Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010}, pages = {354--357}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1810959.1811017}, doi = {10.1145/1810959.1811017}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/compgeom/BasitMRR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/dnb/Ray09, author = {Saurabh Ray}, title = {Weak and strong epsilon-nets for geometric range spaces}, school = {Saarland University, Saarbr{\"{u}}cken, Germany}, year = {2009}, url = {http://scidok.sulb.uni-saarland.de/volltexte/2009/2567/}, urn = {urn:nbn:de:bsz:291-scidok-25676}, timestamp = {Sat, 17 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/dnb/Ray09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/MustafaR09, author = {Nabil H. Mustafa and Saurabh Ray}, title = {An optimal extension of the centerpoint theorem}, journal = {Comput. Geom.}, volume = {42}, number = {6-7}, pages = {505--510}, year = {2009}, url = {https://doi.org/10.1016/j.comgeo.2007.10.004}, doi = {10.1016/J.COMGEO.2007.10.004}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/MustafaR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/MustafaR09, author = {Nabil H. Mustafa and Saurabh Ray}, editor = {John Hershberger and Efi Fogel}, title = {{PTAS} for geometric hitting set problems via local search}, booktitle = {Proceedings of the 25th {ACM} Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009}, pages = {17--22}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1542362.1542367}, doi = {10.1145/1542362.1542367}, timestamp = {Mon, 14 Jun 2021 16:24:56 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/MustafaR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sagt/ElbassioniRRS09, author = {Khaled M. Elbassioni and Rajiv Raman and Saurabh Ray and Ren{\'{e}} Sitters}, editor = {Marios Mavronicolas and Vicky G. Papadopoulou}, title = {On Profit-Maximizing Pricing for the Highway and Tollbooth Problems}, booktitle = {Algorithmic Game Theory, Second International Symposium, {SAGT} 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5814}, pages = {275--286}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-04645-2\_25}, doi = {10.1007/978-3-642-04645-2\_25}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sagt/ElbassioniRRS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ElbassioniRRS09, author = {Khaled M. Elbassioni and Rajiv Raman and Saurabh Ray and Ren{\'{e}} Sitters}, editor = {Claire Mathieu}, title = {On the approximability of the maximum feasible subsystem problem with 0/1-coefficients}, booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009}, pages = {1210--1219}, publisher = {{SIAM}}, year = {2009}, url = {https://doi.org/10.1137/1.9781611973068.131}, doi = {10.1137/1.9781611973068.131}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/ElbassioniRRS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0901-1140, author = {Khaled M. Elbassioni and Rajiv Raman and Saurabh Ray}, title = {On Profit-Maximizing Pricing for the Highway and Tollbooth Problems}, journal = {CoRR}, volume = {abs/0901.1140}, year = {2009}, url = {http://arxiv.org/abs/0901.1140}, eprinttype = {arXiv}, eprint = {0901.1140}, timestamp = {Mon, 17 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0901-1140.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/AichholzerAGHHHKRV08, author = {Oswin Aichholzer and Franz Aurenhammer and Paola Gonzalez{-}Nava and Thomas Hackl and Clemens Huemer and Ferran Hurtado and Hannes Krasser and Saurabh Ray and Birgit Vogtenhuber}, title = {Matching edges and faces in polygonal partitions}, journal = {Comput. Geom.}, volume = {39}, number = {2}, pages = {134--141}, year = {2008}, url = {https://doi.org/10.1016/j.comgeo.2007.07.002}, doi = {10.1016/J.COMGEO.2007.07.002}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/comgeo/AichholzerAGHHHKRV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/MustafaR08, author = {Nabil H. Mustafa and Saurabh Ray}, title = {Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension}, journal = {Comput. Geom.}, volume = {40}, number = {1}, pages = {84--91}, year = {2008}, url = {https://doi.org/10.1016/j.comgeo.2007.02.006}, doi = {10.1016/J.COMGEO.2007.02.006}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/MustafaR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/PyrgaR08, author = {Evangelia Pyrga and Saurabh Ray}, editor = {Monique Teillaud}, title = {New existence proofs epsilon-nets}, booktitle = {Proceedings of the 24th {ACM} Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008}, pages = {199--207}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1377676.1377708}, doi = {10.1145/1377676.1377708}, timestamp = {Mon, 14 Jun 2021 16:24:59 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/PyrgaR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/RayM07, author = {Saurabh Ray and Nabil H. Mustafa}, editor = {Jeff Erickson}, title = {An optimal generalization of the centerpoint theorem, and its extensions}, booktitle = {Proceedings of the 23rd {ACM} Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007}, pages = {138--141}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1247069.1247097}, doi = {10.1145/1247069.1247097}, timestamp = {Mon, 14 Jun 2021 16:25:02 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/RayM07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/RayM07a, author = {Saurabh Ray and Nabil H. Mustafa}, editor = {Jeff Erickson}, title = {Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension}, booktitle = {Proceedings of the 23rd {ACM} Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007}, pages = {239--244}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1247069.1247113}, doi = {10.1145/1247069.1247113}, timestamp = {Mon, 14 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/RayM07a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/AjwaniEGR07, author = {Deepak Ajwani and Khaled M. Elbassioni and Sathish Govindarajan and Saurabh Ray}, editor = {Phillip B. Gibbons and Christian Scheideler}, title = {Conflict-free coloring for rectangle ranges using \emph{O}(\emph{n}\({}^{\mbox{.382}}\)) colors}, booktitle = {{SPAA} 2007: Proceedings of the 19th Annual {ACM} Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007}, pages = {181--187}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1248377.1248406}, doi = {10.1145/1248377.1248406}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spaa/AjwaniEGR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/AjwaniRST07, author = {Deepak Ajwani and Saurabh Ray and Raimund Seidel and Hans Raj Tiwary}, editor = {Frank K. H. A. Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Norbert Zeh}, title = {On Computing the Centroid of the Vertices of an Arrangement and Related Problems}, booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS} 2007, Halifax, Canada, August 15-17, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4619}, pages = {519--528}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-73951-7\_45}, doi = {10.1007/978-3-540-73951-7\_45}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/AjwaniRST07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/AichholzerAGHHHKRV05, author = {Oswin Aichholzer and Franz Aurenhammer and Paola Gonzalez{-}Nava and Thomas Hackl and Clemens Huemer and Ferran Hurtado and Hannes Krasser and Saurabh Ray and Birgit Vogtenhuber}, title = {Matching Edges and Faces in Polygonal Partitions}, booktitle = {Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG'05, University of Windsor, Ontario, Canada, August 10-12, 2005}, pages = {126--129}, year = {2005}, url = {http://www.cccg.ca/proceedings/2005/5.pdf}, timestamp = {Wed, 12 May 2021 14:19:37 +0200}, biburl = {https://dblp.org/rec/conf/cccg/AichholzerAGHHHKRV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.