Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Nabil H. Mustafa
@article{DBLP:journals/dcg/JartouxM22,
author = {Bruno Jartoux and
Nabil H. Mustafa},
title = {A Tight Analysis of Geometric Local Search},
journal = {Discret. Comput. Geom.},
volume = {67},
number = {2},
pages = {361--379},
year = {2022},
url = {https://doi.org/10.1007/s00454-021-00343-y},
doi = {10.1007/S00454-021-00343-Y},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/JartouxM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CsikosM22,
author = {M{\'{o}}nika Csik{\'{o}}s and
Nabil H. Mustafa},
title = {Optimal approximations made easy},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106250},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106250},
doi = {10.1016/J.IPL.2022.106250},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CsikosM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-01147,
author = {M{\'{o}}nika Csik{\'{o}}s and
Nabil H. Mustafa},
title = {Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple,
and Practical},
journal = {CoRR},
volume = {abs/2209.01147},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.01147},
doi = {10.48550/ARXIV.2209.01147},
eprinttype = {arXiv},
eprint = {2209.01147},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-01147.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CsikosM21,
author = {M{\'{o}}nika Csik{\'{o}}s and
Nabil H. Mustafa},
editor = {Kevin Buchin and
{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing
Numbers and Their Applications},
booktitle = {37th International Symposium on Computational Geometry, SoCG 2021,
June 7-11, 2021, Buffalo, NY, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {189},
pages = {28:1--28:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2021.28},
doi = {10.4230/LIPICS.SOCG.2021.28},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/CsikosM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BaranyM20,
author = {Imre B{\'{a}}r{\'{a}}ny and
Nabil H. Mustafa},
title = {An application of the universality theorem for Tverberg partitions
to data depth and hitting convex sets},
journal = {Comput. Geom.},
volume = {90},
pages = {101649},
year = {2020},
url = {https://doi.org/10.1016/j.comgeo.2020.101649},
doi = {10.1016/J.COMGEO.2020.101649},
timestamp = {Thu, 16 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/BaranyM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AdiprasitoBMT20,
author = {Karim A. Adiprasito and
Imre B{\'{a}}r{\'{a}}ny and
Nabil H. Mustafa and
Tam{\'{a}}s Terpai},
title = {Theorems of Carath{\'{e}}odory, Helly, and Tverberg Without Dimension},
journal = {Discret. Comput. Geom.},
volume = {64},
number = {2},
pages = {233--258},
year = {2020},
url = {https://doi.org/10.1007/s00454-020-00172-5},
doi = {10.1007/S00454-020-00172-5},
timestamp = {Tue, 11 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/AdiprasitoBMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-08970,
author = {M{\'{o}}nika Csik{\'{o}}s and
Nabil H. Mustafa},
title = {A Simple Proof of Optimal Approximations},
journal = {CoRR},
volume = {abs/2008.08970},
year = {2020},
url = {https://arxiv.org/abs/2008.08970},
eprinttype = {arXiv},
eprint = {2008.08970},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-08970.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KupavskiiMS19,
author = {Andrey Kupavskii and
Nabil H. Mustafa and
Konrad J. Swanepoel},
title = {Bounding the Size of an Almost-Equidistant Set in Euclidean Space},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {2},
pages = {280--286},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000287},
doi = {10.1017/S0963548318000287},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/KupavskiiMS19.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/dcg/DuttaGJM19,
author = {Kunal Dutta and
Arijit Ghosh and
Bruno Jartoux and
Nabil H. Mustafa},
title = {Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and
Polynomial Partitioning},
journal = {Discret. Comput. Geom.},
volume = {61},
number = {4},
pages = {756--777},
year = {2019},
url = {https://doi.org/10.1007/s00454-019-00075-0},
doi = {10.1007/S00454-019-00075-0},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/DuttaGJM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/CsikosMK19,
author = {M{\'{o}}nika Csik{\'{o}}s and
Nabil H. Mustafa and
Andrey Kupavskii},
title = {Tight Lower Bounds on the VC-dimension of Geometric Set Systems},
journal = {J. Mach. Learn. Res.},
volume = {20},
pages = {81:1--81:8},
year = {2019},
url = {http://jmlr.org/papers/v20/18-719.html},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/CsikosMK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HuangMMMM19,
author = {Chien{-}Chung Huang and
Mathieu Mari and
Claire Mathieu and
Joseph S. B. Mitchell and
Nabil H. Mustafa},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {32:1--32:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.32},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.32},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/HuangMMMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Mustafa19,
author = {Nabil H. Mustafa},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {87:1--87:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.87},
doi = {10.4230/LIPICS.ICALP.2019.87},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Mustafa19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AdiprasitoBM19,
author = {Karim A. Adiprasito and
Imre B{\'{a}}r{\'{a}}ny and
Nabil H. Mustafa},
editor = {Timothy M. Chan},
title = {Theorems of Carath{\'{e}}odory, Helly, and Tverberg without dimension},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {2350--2360},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.143},
doi = {10.1137/1.9781611975482.143},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/AdiprasitoBM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dgci/2019,
editor = {Michel Couprie and
Jean Cousty and
Yukiko Kenmochi and
Nabil H. Mustafa},
title = {Discrete Geometry for Computer Imagery - 21st {IAPR} International
Conference, {DGCI} 2019, Marne-la-Vall{\'{e}}e, France, March
26-28, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11414},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-14085-4},
doi = {10.1007/978-3-030-14085-4},
isbn = {978-3-030-14084-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dgci/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/MustafaDG18,
author = {Nabil H. Mustafa and
Kunal Dutta and
Arijit Ghosh},
title = {A Simple Proof of Optimal Epsilon Nets},
journal = {Comb.},
volume = {38},
number = {5},
pages = {1269--1277},
year = {2018},
url = {https://doi.org/10.1007/s00493-017-3564-5},
doi = {10.1007/S00493-017-3564-5},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/MustafaDG18.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}
}
@inproceedings{DBLP:conf/compgeom/JartouxM18,
author = {Bruno Jartoux and
Nabil H. Mustafa},
editor = {Bettina Speckmann and
Csaba D. T{\'{o}}th},
title = {Optimality of Geometric Local Search},
booktitle = {34th International Symposium on Computational Geometry, SoCG 2018,
June 11-14, 2018, Budapest, Hungary},
series = {LIPIcs},
volume = {99},
pages = {48:1--48:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.48},
doi = {10.4230/LIPICS.SOCG.2018.48},
timestamp = {Wed, 16 Jun 2021 12:03:35 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/JartouxM18.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/grapp/MariaMBDB18,
author = {Maxime Maria and
Nabil H. Mustafa and
Thomas Bardoux and
J{\'{e}}r{\'{e}}mie Defaye and
Venceslas Biri},
editor = {Dominique Bechmann and
Ana Paula Cl{\'{a}}udio and
Jos{\'{e}} Braz},
title = {Visibility based {WSPD} for Global Illumination},
booktitle = {Proceedings of the 13th International Joint Conference on Computer
Vision, Imaging and Computer Graphics Theory and Applications {(VISIGRAPP}
2018) - Volume 1: GRAPP, Funchal, Madeira, Portugal, January 27-29,
2018},
pages = {81--90},
publisher = {SciTePress},
year = {2018},
timestamp = {Tue, 27 Mar 2018 13:24:54 +0200},
biburl = {https://dblp.org/rec/conf/grapp/MariaMBDB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-01816,
author = {Jes{\'{u}}s A. De Loera and
Thomas A. Hogan and
Fr{\'{e}}d{\'{e}}ric Meunier and
Nabil H. Mustafa},
title = {Integer and Mixed Integer Tverberg Numbers},
journal = {CoRR},
volume = {abs/1803.01816},
year = {2018},
url = {http://arxiv.org/abs/1803.01816},
eprinttype = {arXiv},
eprint = {1803.01816},
timestamp = {Thu, 30 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-01816.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-08725,
author = {Karim A. Adiprasito and
Imre B{\'{a}}r{\'{a}}ny and
Nabil H. Mustafa},
title = {Theorems of Carath{\'{e}}odory, Helly, and Tverberg without dimension},
journal = {CoRR},
volume = {abs/1806.08725},
year = {2018},
url = {http://arxiv.org/abs/1806.08725},
eprinttype = {arXiv},
eprint = {1806.08725},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-08725.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-07924,
author = {M{\'{o}}nika Csik{\'{o}}s and
Andrey Kupavskii and
Nabil H. Mustafa},
title = {Optimal Bounds on the VC-dimension},
journal = {CoRR},
volume = {abs/1807.07924},
year = {2018},
url = {http://arxiv.org/abs/1807.07924},
eprinttype = {arXiv},
eprint = {1807.07924},
timestamp = {Wed, 08 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-07924.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}
}
@inproceedings{DBLP:conf/compgeom/DuttaGJM17,
author = {Kunal Dutta and
Arijit Ghosh and
Bruno Jartoux and
Nabil H. Mustafa},
editor = {Boris Aronov and
Matthew J. Katz},
title = {Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and
Polynomial Partitioning},
booktitle = {33rd International Symposium on Computational Geometry, SoCG 2017,
July 4-7, 2017, Brisbane, Australia},
series = {LIPIcs},
volume = {77},
pages = {38:1--38:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2017.38},
doi = {10.4230/LIPICS.SOCG.2017.38},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/DuttaGJM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AntunesMM17,
author = {Daniel Antunes and
Claire Mathieu and
Nabil H. Mustafa},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for
Planar Graphs},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {8:1--8:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.8},
doi = {10.4230/LIPICS.ESA.2017.8},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/AntunesMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MustafaV17,
author = {Nabil H. Mustafa and
Kasturi R. Varadarajan},
title = {Epsilon-approximations and epsilon-nets},
journal = {CoRR},
volume = {abs/1702.03676},
year = {2017},
url = {http://arxiv.org/abs/1702.03676},
eprinttype = {arXiv},
eprint = {1702.03676},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MustafaV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LoeraGMM17,
author = {Jes{\'{u}}s A. De Loera and
Xavier Goaoc and
Fr{\'{e}}d{\'{e}}ric Meunier and
Nabil H. Mustafa},
title = {The discrete yet ubiquitous theorems of Carath{\'{e}}odory, Helly,
Sperner, Tucker, and Tverberg},
journal = {CoRR},
volume = {abs/1706.05975},
year = {2017},
url = {http://arxiv.org/abs/1706.05975},
eprinttype = {arXiv},
eprint = {1706.05975},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LoeraGMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-01590,
author = {Andrey Kupavskii and
Nabil H. Mustafa and
Konrad J. Swanepoel},
title = {Bounding the size of an almost-equidistant set in Euclidean space},
journal = {CoRR},
volume = {abs/1708.01590},
year = {2017},
url = {http://arxiv.org/abs/1708.01590},
eprinttype = {arXiv},
eprint = {1708.01590},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-01590.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/dcg/Mustafa16,
author = {Nabil H. Mustafa},
title = {A Simple Proof of the Shallow Packing Lemma},
journal = {Discret. Comput. Geom.},
volume = {55},
number = {3},
pages = {739--743},
year = {2016},
url = {https://doi.org/10.1007/s00454-016-9767-5},
doi = {10.1007/S00454-016-9767-5},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Mustafa16.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/jct/MustafaP16,
author = {Nabil H. Mustafa and
J{\'{a}}nos Pach},
title = {On the Zarankiewicz problem for intersection hypergraphs},
journal = {J. Comb. Theory, Ser. {A}},
volume = {141},
pages = {1--7},
year = {2016},
url = {https://doi.org/10.1016/j.jcta.2016.02.001},
doi = {10.1016/J.JCTA.2016.02.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/MustafaP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/KupavskiiMP16,
author = {Andrey Kupavskii and
Nabil H. Mustafa and
J{\'{a}}nos Pach},
editor = {S{\'{a}}ndor P. Fekete and
Anna Lubiw},
title = {New Lower Bounds for epsilon-Nets},
booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
June 14-18, 2016, Boston, MA, {USA}},
series = {LIPIcs},
volume = {51},
pages = {54:1--54:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.54},
doi = {10.4230/LIPICS.SOCG.2016.54},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/KupavskiiMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cgf/BusMB15,
author = {Norbert Bus and
Nabil H. Mustafa and
Venceslas Biri},
title = {IlluminationCut},
journal = {Comput. Graph. Forum},
volume = {34},
number = {2},
pages = {561--573},
year = {2015},
url = {https://doi.org/10.1111/cgf.12584},
doi = {10.1111/CGF.12584},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cgf/BusMB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cgf/BusMB15a,
author = {Norbert Bus and
Nabil H. Mustafa and
Venceslas Biri},
title = {Global Illumination Using Well-Separated Pair Decomposition},
journal = {Comput. Graph. Forum},
volume = {34},
number = {8},
pages = {88--103},
year = {2015},
url = {https://doi.org/10.1111/cgf.12610},
doi = {10.1111/CGF.12610},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cgf/BusMB15a.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/gd/MustafaP15,
author = {Nabil H. Mustafa and
J{\'{a}}nos Pach},
editor = {Emilio Di Giacomo and
Anna Lubiw},
title = {On the Zarankiewicz Problem for Intersection Hypergraphs},
booktitle = {Graph Drawing and Network Visualization - 23rd International Symposium,
{GD} 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9411},
pages = {207--216},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-27261-0\_18},
doi = {10.1007/978-3-319-27261-0\_18},
timestamp = {Sun, 13 Nov 2022 09:57:26 +0100},
biburl = {https://dblp.org/rec/conf/gd/MustafaP15.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/corr/Mustafa15,
author = {Nabil H. Mustafa},
title = {A Note on the Size-Sensitive Packing Lemma},
journal = {CoRR},
volume = {abs/1509.04020},
year = {2015},
url = {http://arxiv.org/abs/1509.04020},
eprinttype = {arXiv},
eprint = {1509.04020},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Mustafa15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/MustafaTW14,
author = {Nabil H. Mustafa and
Hans Raj Tiwary and
Daniel Werner},
title = {A proof of the Oja depth conjecture in the plane},
journal = {Comput. Geom.},
volume = {47},
number = {6},
pages = {668--674},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2013.12.006},
doi = {10.1016/J.COMGEO.2013.12.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/MustafaTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/MustafaR14,
author = {Nabil H. Mustafa and
Rajiv Raman},
title = {A Separator Theorem for Intersecting Objects in the Plane},
booktitle = {Proceedings of the 26th Canadian Conference on Computational Geometry,
{CCCG} 2014, Halifax, Nova Scotia, Canada, 2014},
publisher = {Carleton University, Ottawa, Canada},
year = {2014},
url = {http://www.cccg.ca/proceedings/2014/papers/paper55.pdf},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cccg/MustafaR14.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/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}
}
@book{DBLP:books/hal/Mustafa13,
author = {Nabil H. Mustafa},
title = {Approximations of Points: Combinatorics and Algorithms},
year = {2013},
url = {https://tel.archives-ouvertes.fr/tel-01062825},
timestamp = {Sat, 30 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/hal/Mustafa13.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 16:50:55 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/MustafaR12.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}
}
@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}
}
@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}
}
@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}
}
@article{DBLP:journals/jcb/AgarwalMW07,
author = {Pankaj K. Agarwal and
Nabil H. Mustafa and
Yusu Wang},
title = {Fast Molecular Shape Matching Using Contact Maps},
journal = {J. Comput. Biol.},
volume = {14},
number = {2},
pages = {131--143},
year = {2007},
url = {https://doi.org/10.1089/cmb.2007.0004},
doi = {10.1089/CMB.2007.0004},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/AgarwalMW07.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}
}
@article{DBLP:journals/comgeo/AgarwalM06,
author = {Pankaj K. Agarwal and
Nabil H. Mustafa},
title = {Independent set of intersection graphs of convex objects in 2D},
journal = {Comput. Geom.},
volume = {34},
number = {2},
pages = {83--95},
year = {2006},
url = {https://doi.org/10.1016/j.comgeo.2005.12.001},
doi = {10.1016/J.COMGEO.2005.12.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AgarwalM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gis/MustafaKVV06,
author = {Nabil H. Mustafa and
Shankar Krishnan and
Gokul Varadhan and
Suresh Venkatasubramanian},
title = {Dynamic simplification and visualization of large maps},
journal = {Int. J. Geogr. Inf. Sci.},
volume = {20},
number = {3},
pages = {273--302},
year = {2006},
url = {https://doi.org/10.1080/13658810500390794},
doi = {10.1080/13658810500390794},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gis/MustafaKVV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ElbassioniM06,
author = {Khaled M. Elbassioni and
Nabil H. Mustafa},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {Conflict-Free Colorings of Rectangles Ranges},
booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
Science, Marseille, France, February 23-25, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3884},
pages = {254--263},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_20},
doi = {10.1007/11672142\_20},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ElbassioniM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgarwalHMW05,
author = {Pankaj K. Agarwal and
Sariel Har{-}Peled and
Nabil H. Mustafa and
Yusu Wang},
title = {Near-Linear Time Approximation Algorithms for Curve Simplification},
journal = {Algorithmica},
volume = {42},
number = {3-4},
pages = {203--219},
year = {2005},
url = {https://doi.org/10.1007/s00453-005-1165-y},
doi = {10.1007/S00453-005-1165-Y},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AgarwalHMW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ElbassioniFMS05,
author = {Khaled M. Elbassioni and
Aleksei V. Fishkin and
Nabil H. Mustafa and
Ren{\'{e}} Sitters},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Approximation Algorithms for Euclidean Group {TSP}},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {1115--1126},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_90},
doi = {10.1007/11523468\_90},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ElbassioniFMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BanBM04,
author = {Yih{-}En Andrew Ban and
Sergey Bereg and
Nabil H. Mustafa},
title = {A Conjecture on Wiener Indices in Combinatorial Chemistry},
journal = {Algorithmica},
volume = {40},
number = {2},
pages = {99--117},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1097-y},
doi = {10.1007/S00453-004-1097-Y},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BanBM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MustafaP04,
author = {Nabil H. Mustafa and
Aleksandar Pekec},
title = {Listen to Your Neighbors: How (Not) to Reach a Consensus},
journal = {{SIAM} J. Discret. Math.},
volume = {17},
number = {4},
pages = {634--660},
year = {2004},
url = {https://doi.org/10.1137/S0895480102408213},
doi = {10.1137/S0895480102408213},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MustafaP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/AgarwalM04,
author = {Pankaj K. Agarwal and
Nabil H. Mustafa},
editor = {Catriel Beeri and
Alin Deutsch},
title = {k-Means Projective Clustering},
booktitle = {Proceedings of the Twenty-third {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, June 14-16, 2004, Paris, France},
pages = {155--165},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1055558.1055581},
doi = {10.1145/1055558.1055581},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/AgarwalM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgarwalM04,
author = {Pankaj K. Agarwal and
Nabil H. Mustafa},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Independent Set of Intersection Graphs of Convex Objects in 2D},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {127--137},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_12},
doi = {10.1007/978-3-540-27810-8\_12},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AgarwalM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BanBM03,
author = {Yih{-}En Andrew Ban and
Sergei Bespamyatnikh and
Nabil H. Mustafa},
editor = {Tandy J. Warnow and
Binhai Zhu},
title = {On a Conjecture on Wiener Indices in Combinatorial Chemistry},
booktitle = {Computing and Combinatorics, 9th Annual International Conference,
{COCOON} 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2697},
pages = {509--518},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45071-8\_51},
doi = {10.1007/3-540-45071-8\_51},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BanBM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/KrishnanMV03,
author = {Suresh Krishnan and
Nabil H. Mustafa and
Suresh Venkatasubramanian},
editor = {Regina Y. Liu and
Robert Serfling and
Diane L. Souvaine},
title = {Statistical data depth and the graphics hardware},
booktitle = {Data Depth: Robust Multivariate Analysis, Computational Geometry and
Applications, Proceedings of a {DIMACS} Workshop, New Brunswick, New
Jersey, USA, May 14-16, 2003},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {72},
pages = {223--246},
publisher = {{DIMACS/AMS}},
year = {2003},
url = {https://doi.org/10.1090/dimacs/072/15},
doi = {10.1090/DIMACS/072/15},
timestamp = {Mon, 22 May 2023 16:07:34 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/KrishnanMV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AgarwalKMV03,
author = {Pankaj K. Agarwal and
Shankar Krishnan and
Nabil H. Mustafa and
Suresh Venkatasubramanian},
editor = {Giuseppe Di Battista and
Uri Zwick},
title = {Streaming Geometric Optimization Using Graphics Hardware},
booktitle = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest,
Hungary, September 16-19, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2832},
pages = {544--555},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39658-1\_50},
doi = {10.1007/978-3-540-39658-1\_50},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/AgarwalKMV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AgarwalHMW02,
author = {Pankaj K. Agarwal and
Sariel Har{-}Peled and
Nabil H. Mustafa and
Yusu Wang},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {Near-Linear Time Approximation Algorithms for Curve Simplification},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {29--41},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_7},
doi = {10.1007/3-540-45749-6\_7},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/AgarwalHMW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KrishnanMV02,
author = {Shankar Krishnan and
Nabil H. Mustafa and
Suresh Venkatasubramanian},
editor = {David Eppstein},
title = {Hardware-assisted computation of depth contours},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {558--567},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545456},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/KrishnanMV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/MustafaKKV01,
author = {Nabil H. Mustafa and
Eleftherios Koutsofios and
Shankar Krishnan and
Suresh Venkatasubramanian},
editor = {Diane L. Souvaine},
title = {Hardware-assisted view-dependent map simplification},
booktitle = {Proceedings of the Seventeenth Annual Symposium on Computational Geometry,
Medford, MA, USA, June 3-5, 2001},
pages = {50--59},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/378583.378614},
doi = {10.1145/378583.378614},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/MustafaKKV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MustafaP01,
author = {Nabil H. Mustafa and
Aleksandar Pekec},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {Majority Consensus and the Local Majority Rule},
booktitle = {Automata, Languages and Programming, 28th International Colloquium,
{ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2076},
pages = {530--542},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_44},
doi = {10.1007/3-540-48224-5\_44},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MustafaP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 17:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
