Nabil Mustafa

Présentation

Homepage of Nabil Mustafa.

Publications

Article dans une revue (20)

Optimal approximations made easy Mónika Csikós,Nabil H Mustafa Information Processing Letters, 2022, 176, pp.106250. ⟨10.1016/j.ipl.2022.106250⟩ Article dans une revue hal-04501852v1
A Tight Analysis of Geometric Local Search Bruno Jartoux,Nabil H Mustafa Discrete and Computational Geometry, 2022, 67 (2), pp.361-379. ⟨10.1007/s00454-021-00343-y⟩ Article dans une revue hal-04325383v1
An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets Imre Barany,Nabil Mustafa Computational Geometry, 2020, 90, pp.101649. ⟨10.1016/j.comgeo.2020.101649⟩ Article dans une revue hal-02768998v1
On a Problem of Danzer Nabil Mustafa,Saurabh Ray Combinatorics, Probability and Computing, 2019, pp.1 - 10. ⟨10.1017/S0963548318000445⟩ Article dans une revue hal-01895934v1
Bounding the Size of an Almost-Equidistant Set in Euclidean Space Andrey Kupavskii,Nabil Mustafa,Konrad Swanepoel Combinatorics, Probability and Computing, 2019, pp.1 - 7. ⟨10.1017/S0963548318000287⟩ Article dans une revue hal-01816048v1
The discrete yet ubiquitous theorems of Caratheodory, Helly, Sperner, Tucker, and Tverberg Jesús A. de Loera,Xavier Goaoc,Frédéric Meunier,Nabil Mustafa Bulletin of the American Mathematical Society, 2019, 56, pp.415-511. ⟨10.1090/bull/1653⟩ Article dans une revue hal-02050466v1
Tight Lower Bounds on the VC-dimension of Geometric Set Systems Mónika Csikós,Nabil Mustafa,Andrey Kupavskii Journal of Machine Learning Research, 2019, 20 (81), pp.1-8 Article dans une revue hal-02316979v1
Shallow packings, semialgebraic set systems, Macbeath regions, and polynomial partitioning Kunal Dutta,Arijit Ghosh,Bruno Jartoux,Nabil Mustafa Discrete and Computational Geometry, 2019, 61 (4), pp.756-777. ⟨10.1007/s00454-019-00075-0⟩ Article dans une revue hal-02316975v1
Practical and efficient algorithms for the geometric hitting set problem Norbert Bus,Nabil Mustafa,Saurabh Ray Discrete Applied Mathematics, 2018, 240, pp.25 - 32. ⟨10.1016/j.dam.2017.12.018⟩ Article dans une revue hal-01797815v1
Epsilon-Mnets: Hitting Geometric Set Systems with Subsets Nabil Mustafa,Saurabh Ray Discrete and Computational Geometry, 2017, ⟨10.1007/s00454-016-9845-8⟩ Article dans une revue hal-01468731v1
A Simple Proof of Optimal Epsilon Nets Nabil Mustafa,Kunal Dutta,Arijit Ghosh Combinatorica, 2017, ⟨10.1007/s00493-017-3564-5⟩ Article dans une revue hal-01360452v1
Limits of Local Search: Quality and Efficiency Norbert Bus,Shashwat Garg,Nabil Mustafa,Saurabh Ray Discrete and Computational Geometry, 2017, ⟨10.1007/s00454-016-9819-x⟩ Article dans une revue hal-01468685v1
On the Zarankiewicz Problem for the Intersection Hypergraphs Nabil Mustafa,János Pach Journal of Combinatorial Theory, Series A, 2016, 141, pp.1-7. ⟨10.1016/j.jcta.2016.02.001⟩ Article dans une revue hal-01345859v1
A Simple Proof of the Shallow Packing Lemma Nabil Mustafa Discrete and Computational Geometry, 2016, 55 (3), pp.739-743. ⟨10.1007/s00454-016-9767-5⟩ Article dans une revue hal-01345858v1
An Optimal Generalization of the Colorful Carathéodory Theorem Nabil Mustafa,Saurabh Ray Discrete Mathematics, 2016, ⟨10.1016/j.disc.2015.11.019⟩ Article dans une revue hal-01233467v1
Tighter Estimates for ϵ-nets for Disks Norbert Bus,Shashwat Garg,Nabil Mustafa,Saurabh Ray Computational Geometry: Theory and Applications Computational Geometry @ ScienceDirect, 2016, 53, pp.27-35. ⟨10.1016/j.comgeo.2015.12.002⟩ Article dans une revue hal-01345860v1
QPTAS for Weighted Geometric Set Cover on Pseudodisks and Halfspaces Nabil Mustafa,Rajiv Raman,Saurabh Ray SIAM Journal on Computing, 2015 Article dans une revue hal-01188992v1
Global Illumination Using Well-Separated Pair Decomposition N. Bus,Nabil Mustafa,Venceslas Biri Computer Graphics Forum, 2015, 34 (8), pp.88 - 103. ⟨10.1111/cgf.12610⟩ Article dans une revue hal-01188993v2
K-Centerpoints Conjectures for Pointsets in R^d Nabil Mustafa,Saurabh Ray,Mudassir Shabbir International Journal of Computational Geometry and Applications, 2015, 23 (3), pp.23. ⟨10.1142/S0218195915500107⟩ Article dans une revue hal-01188994v1
A Proof of the Oja Depth Conjecture in the Plane Nabil Mustafa,Hans Raj Tiwary,Daniel Werner Computational Geometry: Theory and Applications Computational Geometry @ ScienceDirect, 2014, 47 (6), pp.668-674 Article dans une revue hal-01026341v1

Communication dans un congrès (17)

Escaping the Curse of Spatial Partitioning: Matchings With Low Crossing Numbers and Their Applications. Nabil Mustafa,Mónika Csikós 37th ACM Symposium on Computational Geometry (SoCG '21), Jul 2021, Buffalo, United States Communication dans un congrès hal-03219907v1
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint Chien-Chung Huang,Mathieu Mari,Claire Mathieu,Joseph Mitchell,Nabil Mustafa Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Sep 2019, Cambridge, United States. ⟨10.4230/LIPIcs.APPROX-RANDOM.2019.32⟩ Communication dans un congrès hal-02391779v1
Theorems of Carathéodory, Helly, and Tverberg without dimension Karim Adiprasito,Imre Barany,Nabil Mustafa Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), Jan 2019, San Diego, United States. ⟨10.1137/1.9781611975482.143⟩ Communication dans un congrès hal-02316991v1
Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set Nabil Mustafa 46th International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2019, Patras, Greece Communication dans un congrès hal-02316988v1
On a problem of Danzer Nabil Mustafa,Saurabh Ray 26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. pp.64:1-64:8, ⟨10.4230/LIPIcs.ESA.2018.64⟩ Communication dans un congrès hal-01890699v1
Visibility based WSPD for Global Illumination Maxime Maria,Nabil Mustafa,Thomas Bardoux,Jérémie Defaye,Venceslas Biri 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2018), Jan 2018, Funchal, Portugal. pp.81-90 Communication dans un congrès hal-01698656v1
Optimality of Geometric Local Search Bruno Jartoux,Nabil Mustafa 34th International Symposium on Computational Geometry (SoCG 2018), Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs.SoCG.2018.48⟩ Communication dans un congrès hal-01797822v1
Shallow packings, semialgebraic set systems, Macbeath regions and polynomial partitioning Kunal Dutta,Arijit Ghosh,Bruno Jartoux,Nabil Mustafa 33rd International Symposium on Computational Geometry (SoCG 2017), Jul 2017, Brisbane, Australia. ⟨10.1007/s00454-019-00075-0⟩ Communication dans un congrès hal-01360443v1
Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs Daniel Antunes,Claire Mathieu,Nabil Mustafa 25th Annual European Symposium on Algorithms (ESA 2017), Sep 2017, Vienna, Austria. ⟨10.4230/LIPIcs.ESA.2017.8⟩ Communication dans un congrès hal-01740357v1
New Lower Bounds for ϵ-nets Andrey Kupavskii,Nabil Mustafa,János Pach 32nd Annual International Symposium on Computational Geometry (SoCG 2016), Jun 2016, Boston, MA, United States. pp.54, ⟨10.4230/LIPIcs.SoCG.2016.54⟩ Communication dans un congrès hal-01345861v1
Improved Local Search for Geometric Hitting Set Norbert Bus,Shashwat Garg,Nabil Mustafa,Saurabh Ray Proc. of the 32st International Symposium on Theoretical Aspects of Computer Science (STACS), 2015, Munich, Germany Communication dans un congrès hal-01188990v1
On the Zarankiewicz Problem for Intersection Hypergraphs Nabil Mustafa,Janos Pach Proc. of the 23rd International Symposium on Graph Drawing and Network Visualization (GD '15), Sep 2015, Los Angeles, United States Communication dans un congrès hal-01188986v1
IlluminationCut Norbert Bus,Nabil Mustafa,Venceslas Biri Eurographics, 2015, Zurich, Switzerland. ⟨10.1111/cgf.12584⟩ Communication dans un congrès istex hal-01188989v1
Geometric Hitting Sets for Disks: Theory and Practice Norbert Bus,Nabil Mustafa,Saurabh Ray 23rd European Symposium on Algorithms (ESA 2015), 2015, Patras, Greece. ⟨10.1007/978-3-662-48350-3_75⟩ Communication dans un congrès hal-01188987v1
Settling the APX-Hardness Status for Geometric Set Cover Nabil Mustafa,Rajiv Raman,Saurabh Ray Proc. of the 55th Annual Symposium on Foundations of Computer Science (FOCS), 2014, Philadelphia, United States. ⟨10.1109/FOCS.2014.64⟩ Communication dans un congrès hal-01188991v1
Near-Optimal Generalisations of a Theorem of Macbeath Nabil Mustafa,Saurabh Ray Proc. of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS '14), 2014., Mar 2014, France. pp.578-589 Communication dans un congrès hal-01026333v1
A Theorem of Barany Revisited and Extended Nabil Mustafa,Ray Saurabh 2012 Symposium on Computational Geometry, Jun 2012, United States. pp.333--338 Communication dans un congrès hal-00761355v1

Ouvrages (1)

Discrete Geometry for Computer Imagery, 21st IAPR International Conference, DGCI 2019, Marne-la-Vallée, France, March 26–28, 2019, Proceedings Michel Couprie,Jean Cousty,Yukiko Kenmochi,Nabil Mustafa 2019, ⟨10.1007/978-3-030-14085-4⟩ Ouvrages hal-02405904v1

Chapitre d'ouvrage (3)

Tverberg theorems over discrete sets of points Jesus de Loera,Frédéric Meunier,Nabil Mustafa,Thomas Hogan Polytopes and Discrete Geometry, 2021, Contemporary Mathematics, 978-1-4704-4897-4. ⟨10.1090/conm/764⟩ Chapitre d'ouvrage hal-03219903v1
Near-Optimal Lower Bounds for Epsilon-nets for Half-spaces and Low Complexity Set Systems Andrey Kupavskii,Nabil Mustafa,János Pach A Journey Through Discrete Mathematics: A Tribute to Jirí Matousek, 2017, 978-3-319-44479-6 Chapitre d'ouvrage hal-01468669v1
Epsilon-approximations and epsilon-nets Nabil Mustafa,Kasturi Varadarajan Handbook of Discrete and Computational Geometry, 2017 Chapitre d'ouvrage hal-01468664v1

Pré-publication, Document de travail (1)

A new asymmetric correlation inequality for Gaussian measure Kunal Dutta,Arijit Ghosh,Nabil Mustafa 2016 Pré-publication, Document de travail hal-01360457v1

HDR (1)

Approximations of Points: Combinatorics and Algorithms Nabil Mustafa Computational Geometry [cs.CG]. Université Paris-Est, 2013 HDR tel-01062825v1