NM
Nabil Mustafa
29
Documents
Présentation
[Homepage of Nabil Mustafa.](http://www.esiee.fr/~mustafan)
[Homepage of Nabil Mustafa.](http://www.esiee.fr/~mustafan)
Publications
- 29
- 1
- 1
- 7
- 3
- 7
- 6
- 5
- 5
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 8
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set46th International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2019, Patras, Greece
Communication dans un congrès
hal-02316988v1
|
|
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⟩
Communication dans un congrès
hal-02316991v1
|
|
Maximizing Covered Area in the Euclidean Plane with Connectivity ConstraintApproximation, 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
|
|
|
Optimality of Geometric Local Search34th International Symposium on Computational Geometry (SoCG 2018), Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs.SoCG.2018.48⟩
Communication dans un congrès
hal-01797822v1
|
|
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⟩
Communication dans un congrès
hal-01890699v1
|
|
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⟩
Communication dans un congrès
hal-01740357v1
|
|
Shallow packings, semialgebraic set systems, Macbeath regions and polynomial partitioning33rd International Symposium on Computational Geometry (SoCG 2017), Jul 2017, Brisbane, Australia
Communication dans un congrès
hal-01360443v1
|
|
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⟩
Communication dans un congrès
hal-01345861v1
|
|
Improved Local Search for Geometric Hitting SetProc. of the 32st International Symposium on Theoretical Aspects of Computer Science (STACS), 2015, Munich, Germany
Communication dans un congrès
hal-01188990v1
|
|
Geometric Hitting Sets for Disks: Theory and Practice23rd European Symposium on Algorithms (ESA 2015), 2015, Patras, Greece. ⟨10.1007/978-3-662-48350-3_75⟩
Communication dans un congrès
hal-01188987v1
|
|
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
Communication dans un congrès
hal-01188986v1
|
|
Epsilon-approximations and epsilon-netsHandbook of Discrete and Computational Geometry, 2017
Chapitre d'ouvrage
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
Chapitre d'ouvrage
hal-01468669v1
|
|
A new asymmetric correlation inequality for Gaussian measure2016
Pré-publication, Document de travail
hal-01360457v1
|