Nabil Mustafa
Présentation
Publications
Publications
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 |
|
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⟩ |
|
|
|
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⟩ |
Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set46th International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2019, Patras, Greece |
|
|
|
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⟩ |
|
|
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 |
|
|
Optimality of Geometric Local Search34th International Symposium on Computational Geometry (SoCG 2018), Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs.SoCG.2018.48⟩ |
|
|
Shallow packings, semialgebraic set systems, Macbeath regions and polynomial partitioning33rd International Symposium on Computational Geometry (SoCG 2017), Jul 2017, Brisbane, Australia. ⟨10.1007/s00454-019-00075-0⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
Improved Local Search for Geometric Hitting SetProc. of the 32st International Symposium on Theoretical Aspects of Computer Science (STACS), 2015, Munich, Germany |
|
|
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 |
|
|
IlluminationCutEurographics, 2015, Zurich, Switzerland. ⟨10.1111/cgf.12584⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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 |
|
|
A Theorem of Barany Revisited and Extended2012 Symposium on Computational Geometry, Jun 2012, United States. pp.333--338 |
Tverberg theorems over discrete sets of pointsPolytopes and Discrete Geometry, 2021, Contemporary Mathematics, 978-1-4704-4897-4. ⟨10.1090/conm/764⟩ |
|
|
|
Near-Optimal Lower Bounds for Epsilon-nets for Half-spaces and Low Complexity Set SystemsA Journey Through Discrete Mathematics: A Tribute to Jirí Matousek, 2017, 978-3-319-44479-6 |
|
|
Epsilon-approximations and epsilon-netsHandbook of Discrete and Computational Geometry, 2017 |
|
|
A new asymmetric correlation inequality for Gaussian measure2016 |
|
|
Approximations of Points: Combinatorics and AlgorithmsComputational Geometry [cs.CG]. Université Paris-Est, 2013 |