Number of documents


Nabil H. Mustafa

Homepage of Nabil Mustafa.


Journal articles11 documents

Conference papers8 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. ⟨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. ⟨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. ⟨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. pp.54, ⟨10.4230/LIPIcs.SoCG.2016.54⟩. ⟨hal-01345861⟩
  • 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⟩
  • 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⟩

Book sections2 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⟩

Preprints, Working Papers, ...1 document

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