Nombre de documents

20

Nabil H. Mustafa


Homepage of Nabil Mustafa.


Article dans une revue8 documents

  • Nabil Mustafa, Saurabh Ray. An Optimal Generalization of the Colorful Carathéodory Theorem. Discrete Mathematics, Elsevier, 2016. <hal-01233467>
  • Norbert Bus, Shashwat Garg, Nabil Mustafa, Saurabh Ray. Tighter Estimates for ϵ-nets for Disks. Computational Geometry, Elsevier, 2016, 53, pp.27-35. <10.1016/j.comgeo.2015.12.002>. <hal-01345860>
  • 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. 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, 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>
  • Norbert Bus, Nabil Mustafa, Venceslas Biri. Global Illumination Using Well-Separated Pair Decomposition. Computer Graphics Forum, Wiley, 2015, pp.16. <10.1111/cgf.12610>. <hal-01188993>
  • 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>
  • Nabil Mustafa, Hans Raj Tiwary, Daniel Werner. A Proof of the Oja Depth Conjecture in the Plane. Computational Geometry: Theory and Applications Computational Geometry @ ScienceDirect, 2014, 47 (6), pp.668-674. <hal-01026341>

Communication dans un congrès8 documents

  • 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>
  • 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, 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>
  • Norbert Bus, Nabil Mustafa, Venceslas Biri. IlluminationCut. Eurographics, 2015, Zurich, Switzerland. 2015. <hal-01188989>
  • Nabil Mustafa, Rajiv Raman, Saurabh Ray. Settling the APX-Hardness Status for Geometric Set Cover. Proc. of the 55th Annual Symposium on Foundations of Computer Science (FOCS), 2014, Philadelphia, United States. 2014, <10.1109/FOCS.2014.64>. <hal-01188991>
  • Nabil Mustafa, Saurabh Ray. Near-Optimal Generalisations of a Theorem of Macbeath. Proc. of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS '14), 2014., Mar 2014, France. pp.578-589, 2014. <hal-01026333>
  • Nabil Mustafa, Ray Saurabh. A Theorem of Barany Revisited and Extended. 2012 Symposium on Computational Geometry, Jun 2012, United States. pp.333--338, 2012. <hal-00761355>

Pré-publication, Document de travail3 documents

  • Kunal Dutta, Arijit Ghosh, Nabil Mustafa. A new asymmetric correlation inequality for Gaussian measure. 2016. <hal-01360457>
  • Nabil Mustafa, Kunal Dutta, Arijit Ghosh. A Simple Proof of Optimal Epsilon Nets. 2016. <hal-01360452>
  • Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil Mustafa. Combinatorics of Set Systems with Small Shallow Cell Complexity: Optimal Bounds via Packings. 2016. <hal-01360443>

HDR1 document

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