Nombre de documents

22

Nabil H. Mustafa


Homepage of Nabil Mustafa.


41194   

Article dans une revue11 documents

  • Nabil Mustafa, Saurabh Ray. On a Problem of Danzer. Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2018, pp.1 - 10. 〈10.1017/S0963548318000445〉. 〈hal-01895934〉
  • Norbert Bus, Nabil Mustafa, Saurabh Ray. Practical and efficient algorithms for the geometric hitting set problem. Discrete Applied Mathematics, Elsevier, 2018, 240, pp.25 - 32. 〈10.1016/j.dam.2017.12.018〉. 〈hal-01797815〉
  • Nabil Mustafa, Kunal Dutta, Arijit Ghosh. A Simple Proof of Optimal Epsilon Nets. Combinatorica, Springer Verlag, 2017. 〈hal-01360452〉
  • Nabil Mustafa, Saurabh Ray. Epsilon-Mnets: Hitting Geometric Set Systems with Subsets. Discrete and Computational Geometry, Springer Verlag, 2017, 〈10.1007/s00454-016-9845-8〉. 〈hal-01468731〉
  • Norbert Bus, Shashwat Garg, Nabil Mustafa, Saurabh Ray. Limits of Local Search: Quality and Efficiency. Discrete and Computational Geometry, Springer Verlag, 2017, 〈10.1007/s00454-016-9819-x〉. 〈hal-01468685〉
  • Norbert Bus, Shashwat Garg, Nabil Mustafa, Saurabh Ray. Tighter Estimates for ϵ-nets for Disks. Computational Geometry: Theory and Applications Computational Geometry @ ScienceDirect, 2016, 53, pp.27-35. 〈10.1016/j.comgeo.2015.12.002〉. 〈hal-01345860〉
  • Nabil Mustafa. A Simple Proof of the Shallow Packing Lemma. Discrete and Computational Geometry, Springer Verlag, 2016, 55 (3), pp.739-743. 〈10.1007/s00454-016-9767-5〉. 〈hal-01345858〉
  • Nabil Mustafa, Saurabh Ray. An Optimal Generalization of the Colorful Carathéodory Theorem. Discrete Mathematics, Elsevier, 2016. 〈hal-01233467〉
  • Nabil Mustafa, János Pach. On the Zarankiewicz Problem for the Intersection Hypergraphs. Journal of Combinatorial Theory, Series A, Elsevier, 2016, 141, pp.1-7. 〈10.1016/j.jcta.2016.02.001〉. 〈hal-01345859〉
  • Nabil Mustafa, Rajiv Raman, Saurabh Ray. QPTAS for Weighted Geometric Set Cover on Pseudodisks and Halfspaces. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2015. 〈hal-01188992〉
  • Nabil Mustafa, Saurabh Ray, Mudassir Shabbir. K-Centerpoints Conjectures for Pointsets in R^d . International Journal of Computational Geometry and Applications, World Scientific Publishing, 2015, 23 (3), pp.23. 〈hal-01188994〉

Communication dans un congrès8 documents

  • Nabil Mustafa, Saurabh Ray. On a problem of Danzer. 26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. 〈10.4230/LIPIcs.ESA.2018.64〉. 〈hal-01890699〉
  • Bruno Jartoux, Nabil Mustafa. Optimality of Geometric Local Search. 34th International Symposium on Computational Geometry (SoCG 2018), Jun 2018, Budapest, Hungary. 2018, 〈10.4230/LIPIcs.SoCG.2018.48〉. 〈hal-01797822〉
  • Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil Mustafa. Shallow packings, semialgebraic set systems, Macbeath regions and polynomial partitioning. 33rd International Symposium on Computational Geometry (SoCG 2017), Jul 2017, Brisbane, Australia. LIPICS Vol. 77, 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). 〈hal-01360443〉
  • Daniel Antunes, Claire Mathieu, Nabil Mustafa. Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. 25th Annual European Symposium on Algorithms (ESA 2017), Sep 2017, Vienna, Austria. Leibniz International Proceedings in Informatics (LIPIcs), 25th Annual European Symposium on Algorithms (ESA 2017). 〈10.4230/LIPIcs.ESA.2017.8〉. 〈hal-01740357〉
  • Andrey Kupavskii, Nabil Mustafa, János Pach. New Lower Bounds for ϵ-nets. 32nd Annual International Symposium on Computational Geometry (SoCG 2016), Jun 2016, Boston, MA, United States. 32nd International Symposium on Computational Geometry (SoCG 2016), pp.54, 2016, 〈10.4230/LIPIcs.SoCG.2016.54〉. 〈hal-01345861〉
  • Norbert Bus, Nabil Mustafa, Saurabh Ray. Geometric Hitting Sets for Disks: Theory and Practice. 23rd European Symposium on Algorithms (ESA 2015), 2015, Patras, Greece. 〈hal-01188987〉
  • Norbert Bus, Shashwat Garg, Nabil Mustafa, Saurabh Ray. Improved Local Search for Geometric Hitting Set. Proc. of the 32st International Symposium on Theoretical Aspects of Computer Science (STACS), 2015, Munich, Germany. 〈hal-01188990〉
  • Nabil Mustafa, Janos Pach. On the Zarankiewicz Problem for Intersection Hypergraphs. Proc. of the 23rd International Symposium on Graph Drawing and Network Visualization (GD '15), Sep 2015, Los Angeles, United States. 〈hal-01188986〉

Chapitre d'ouvrage2 documents

  • Andrey Kupavskii, Nabil Mustafa, János Pach. Near-Optimal Lower Bounds for Epsilon-nets for Half-spaces and Low Complexity Set Systems. A Journey Through Discrete Mathematics: A Tribute to Jirí Matousek, 2017, 978-3-319-44479-6. 〈hal-01468669〉
  • Nabil Mustafa, Kasturi Varadarajan. Epsilon-approximations and epsilon-nets. Handbook of Discrete and Computational Geometry, 2017. 〈hal-01468664〉

Pré-publication, Document de travail1 document

  • Kunal Dutta, Arijit Ghosh, Nabil Mustafa. A new asymmetric correlation inequality for Gaussian measure. 2016. 〈hal-01360457〉