NM
Nabil Mustafa
41
Documents
Presentation
[Homepage of Nabil Mustafa.](http://www.esiee.fr/~mustafan)
[Homepage of Nabil Mustafa.](http://www.esiee.fr/~mustafan)
Publications
- 28
- 3
- 2
- 1
- 9
- 4
- 7
- 6
- 7
- 3
- 1
- 1
- 4
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 9
- 5
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
Escaping the Curse of Spatial Partitioning: Matchings With Low Crossing Numbers and Their Applications.37th ACM Symposium on Computational Geometry (SoCG '21), Jul 2021, Buffalo, United States
Conference papers
hal-03219907v1
|
|
Maximizing Covered Area in the Euclidean Plane with Connectivity ConstraintApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Sep 2019, Cambridge, United States
Conference papers
hal-02391779v1
|
|
Theorems of Carathéodory, Helly, and Tverberg without dimensionProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), Jan 2019, San Diego, United States. ⟨10.1137/1.9781611975482.143⟩
Conference papers
hal-02316991v1
|
|
Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set46th International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2019, Patras, Greece
Conference papers
hal-02316988v1
|
|
|
On a problem of Danzer26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. pp.64:1-64:8, ⟨10.4230/LIPIcs.ESA.2018.64⟩
Conference papers
hal-01890699v1
|
|
Visibility based WSPD for Global Illumination13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2018), Jan 2018, Funchal, Portugal. pp.81-90
Conference papers
hal-01698656v1
|
|
Optimality of Geometric Local Search34th International Symposium on Computational Geometry (SoCG 2018), Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs.SoCG.2018.48⟩
Conference papers
hal-01797822v1
|
|
Shallow packings, semialgebraic set systems, Macbeath regions and polynomial partitioning33rd International Symposium on Computational Geometry (SoCG 2017), Jul 2017, Brisbane, Australia
Conference papers
hal-01360443v1
|
|
Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs25th Annual European Symposium on Algorithms (ESA 2017), Sep 2017, Vienna, Austria. ⟨10.4230/LIPIcs.ESA.2017.8⟩
Conference papers
hal-01740357v1
|
|
New Lower Bounds for ϵ-nets32nd Annual International Symposium on Computational Geometry (SoCG 2016), Jun 2016, Boston, MA, United States. pp.54, ⟨10.4230/LIPIcs.SoCG.2016.54⟩
Conference papers
hal-01345861v1
|
|
On the Zarankiewicz Problem for Intersection HypergraphsProc. of the 23rd International Symposium on Graph Drawing and Network Visualization (GD '15), Sep 2015, Los Angeles, United States
Conference papers
hal-01188986v1
|
|
Improved Local Search for Geometric Hitting SetProc. of the 32st International Symposium on Theoretical Aspects of Computer Science (STACS), 2015, Munich, Germany
Conference papers
hal-01188990v1
|
|
Geometric Hitting Sets for Disks: Theory and Practice23rd European Symposium on Algorithms (ESA 2015), 2015, Patras, Greece
Conference papers
hal-01188987v1
|
|
IlluminationCutEurographics, 2015, Zurich, Switzerland
Conference papers
hal-01188989v1
|
|
Settling the APX-Hardness Status for Geometric Set CoverProc. of the 55th Annual Symposium on Foundations of Computer Science (FOCS), 2014, Philadelphia, United States. ⟨10.1109/FOCS.2014.64⟩
Conference papers
hal-01188991v1
|
|
Near-Optimal Generalisations of a Theorem of MacbeathProc. of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS '14), 2014., Mar 2014, France. pp.578-589
Conference papers
hal-01026333v1
|
|
A Theorem of Barany Revisited and Extended2012 Symposium on Computational Geometry, Jun 2012, United States. pp.333--338
Conference papers
hal-00761355v1
|
Tverberg theorems over discrete sets of pointsPolytopes and Discrete Geometry, 2021, Contemporary Mathematics, 978-1-4704-4897-4. ⟨10.1090/conm/764⟩
Book sections
hal-03219903v1
|
|
|
Epsilon-approximations and epsilon-netsHandbook of Discrete and Computational Geometry, 2017
Book sections
hal-01468664v1
|
|
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
Book sections
hal-01468669v1
|
|
A new asymmetric correlation inequality for Gaussian measure2016
Preprints, Working Papers, ...
hal-01360457v1
|
|
Approximations of Points: Combinatorics and AlgorithmsComputational Geometry [cs.CG]. Université Paris-Est, 2013
Habilitation à diriger des recherches
tel-01062825v1
|