Nabil H. Mustafa

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 35

Top Topics

Top Venues

Discret. Comput. Geom.

Publications

Mónika Csikós, Nabil H. Mustafa
An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations. ICALP (2024)
Bruno Jartoux, Nabil H. Mustafa
A Tight Analysis of Geometric Local Search. Discret. Comput. Geom. 67 (2) (2022)
Mónika Csikós, Nabil H. Mustafa
Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple, and Practical. CoRR (2022)
Mónika Csikós, Nabil H. Mustafa
Optimal approximations made easy. Inf. Process. Lett. 176 (2022)
Mónika Csikós, Nabil H. Mustafa
Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications. SoCG (2021)
Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa, Tamás Terpai
Theorems of Carathéodory, Helly, and Tverberg Without Dimension. Discret. Comput. Geom. 64 (2) (2020)
Imre Bárány, Nabil H. Mustafa
An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets. Comput. Geom. 90 (2020)
Mónika Csikós, Nabil H. Mustafa
A Simple Proof of Optimal Approximations. CoRR (2020)
Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint. APPROX-RANDOM (2019)
Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa
Theorems of Carathéodory, Helly, and Tverberg without dimension. SODA (2019)
Mónika Csikós, Nabil H. Mustafa, Andrey Kupavskii
Tight Lower Bounds on the VC-dimension of Geometric Set Systems. J. Mach. Learn. Res. 20 (2019)
Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel
Bounding the Size of an Almost-Equidistant Set in Euclidean Space. Comb. Probab. Comput. 28 (2) (2019)
Nabil H. Mustafa, Saurabh Ray
On a Problem of Danzer. Comb. Probab. Comput. 28 (3) (2019)
Nabil H. Mustafa
Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set. ICALP (2019)
Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. Discret. Comput. Geom. 61 (4) (2019)
Jesús A. De Loera, Thomas A. Hogan, Frédéric Meunier, Nabil H. Mustafa
Integer and Mixed Integer Tverberg Numbers. CoRR (2018)
Nabil H. Mustafa, Kunal Dutta, Arijit Ghosh
A Simple Proof of Optimal Epsilon Nets. Comb. 38 (5) (2018)
Bruno Jartoux, Nabil H. Mustafa
Optimality of Geometric Local Search. SoCG (2018)
Mónika Csikós, Andrey Kupavskii, Nabil H. Mustafa
Optimal Bounds on the VC-dimension. CoRR (2018)
Maxime Maria, Nabil H. Mustafa, Thomas Bardoux, Jérémie Defaye, Venceslas Biri
Visibility based WSPD for Global Illumination. VISIGRAPP (1: GRAPP) (2018)
Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa
Theorems of Carathéodory, Helly, and Tverberg without dimension. CoRR (2018)
Nabil H. Mustafa, Saurabh Ray
On a Problem of Danzer. ESA (2018)
Norbert Bus, Nabil H. Mustafa, Saurabh Ray
Practical and efficient algorithms for the geometric hitting set problem. Discret. Appl. Math. 240 (2018)
Nabil H. Mustafa, Saurabh Ray
ε -Mnets: Hitting Geometric Set Systems with Subsets. Discret. Comput. Geom. 57 (3) (2017)
Nabil H. Mustafa, Kasturi R. Varadarajan
Epsilon-approximations and epsilon-nets. CoRR (2017)
Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel
Bounding the size of an almost-equidistant set in Euclidean space. CoRR (2017)
Jesús A. De Loera, Xavier Goaoc, Frédéric Meunier, Nabil H. Mustafa
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg. CoRR (2017)
Daniel Antunes, Claire Mathieu, Nabil H. Mustafa
Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. ESA (2017)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
Limits of Local Search: Quality and Efficiency. Discret. Comput. Geom. 57 (3) (2017)
Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. SoCG (2017)
Nabil H. Mustafa
A Simple Proof of the Shallow Packing Lemma. Discret. Comput. Geom. 55 (3) (2016)
Andrey Kupavskii, Nabil H. Mustafa, János Pach
New Lower Bounds for epsilon-Nets. SoCG (2016)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
Tighter estimates for ϵ-nets for disks. Comput. Geom. 53 (2016)
Nabil H. Mustafa, Saurabh Ray
An optimal generalization of the Colorful Carathéodory theorem. Discret. Math. 339 (4) (2016)
Nabil H. Mustafa, János Pach
On the Zarankiewicz problem for intersection hypergraphs. J. Comb. Theory, Ser. A 141 (2016)
Nabil H. Mustafa
A Note on the Size-Sensitive Packing Lemma. CoRR (2015)
Norbert Bus, Nabil H. Mustafa, Venceslas Biri
IlluminationCut. Comput. Graph. Forum 34 (2) (2015)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
Improved Local Search for Geometric Hitting Set. STACS (2015)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
Tighter Estimates for epsilon-nets for Disks. CoRR (2015)
Nabil H. Mustafa, János Pach
On the Zarankiewicz Problem for Intersection Hypergraphs. Graph Drawing (2015)
Norbert Bus, Nabil H. Mustafa, Venceslas Biri
Global Illumination Using Well-Separated Pair Decomposition. Comput. Graph. Forum 34 (8) (2015)
Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces. SIAM J. Comput. 44 (6) (2015)
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
k-Centerpoints Conjectures for Pointsets in ℝd. Int. J. Comput. Geom. Appl. 25 (3) (2015)
Norbert Bus, Nabil H. Mustafa, Saurabh Ray
Geometric Hitting Sets for Disks: Theory and Practice. ESA (2015)
Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
Settling the APX-Hardness Status for Geometric Set Cover. FOCS (2014)
Nabil H. Mustafa, Rajiv Raman
A Separator Theorem for Intersecting Objects in the Plane. CCCG (2014)
Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
QPTAS for Geometric Set-Cover Problems via Optimal Separators. CoRR (2014)
Nabil H. Mustafa, Hans Raj Tiwary, Daniel Werner
A proof of the Oja depth conjecture in the plane. Comput. Geom. 47 (6) (2014)
Nabil H. Mustafa, Saurabh Ray
Near-Optimal Generalisations of a Theorem of Macbeath. STACS (2014)
Nabil H. Mustafa, Saurabh Ray
A theorem of bárány revisited and extended. SCG (2012)
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane. ESA (2011)
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza
Centerpoints and Tverberg's technique. Comput. Geom. 43 (6-7) (2010)
Nabil H. Mustafa, Saurabh Ray
Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. Comput. Geom. 43 (6-7) (2010)
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza
. SCG (2010)
Nabil H. Mustafa, Saurabh Ray
Improved Results on Geometric Hitting Set Problems. Discret. Comput. Geom. 44 (4) (2010)
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza
. Discret. Comput. Geom. 44 (3) (2010)
Nabil H. Mustafa, Saurabh Ray
PTAS for geometric hitting set problems via local search. SCG (2009)
Nabil H. Mustafa, Saurabh Ray
An optimal extension of the centerpoint theorem. Comput. Geom. 42 (6-7) (2009)
Nabil H. Mustafa, Saurabh Ray
Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. Comput. Geom. 40 (1) (2008)
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
Fast Molecular Shape Matching Using Contact Maps. J. Comput. Biol. 14 (2) (2007)
Saurabh Ray, Nabil H. Mustafa
Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension. SCG (2007)
Saurabh Ray, Nabil H. Mustafa
An optimal generalization of the centerpoint theorem, and its extensions. SCG (2007)
Khaled M. Elbassioni, Nabil H. Mustafa
Conflict-Free Colorings of Rectangles Ranges. STACS (2006)
Pankaj K. Agarwal, Nabil H. Mustafa
Independent set of intersection graphs of convex objects in 2D. Comput. Geom. 34 (2) (2006)
Nabil H. Mustafa, Shankar Krishnan, Gokul Varadhan, Suresh Venkatasubramanian
Dynamic simplification and visualization of large maps. Int. J. Geogr. Inf. Sci. 20 (3) (2006)
Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters
Approximation Algorithms for Euclidean Group TSP. ICALP (2005)
Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang
Near-Linear Time Approximation Algorithms for Curve Simplification. Algorithmica 42 (3-4) (2005)
Pankaj K. Agarwal, Nabil H. Mustafa
Independent Set of Intersection Graphs of Convex Objects in 2D. SWAT (2004)
Pankaj K. Agarwal, Nabil H. Mustafa
k-Means Projective Clustering. PODS (2004)
Nabil H. Mustafa, Aleksandar Pekec
Listen to Your Neighbors: How (Not) to Reach a Consensus. SIAM J. Discret. Math. 17 (4) (2004)
Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa
A Conjecture on Wiener Indices in Combinatorial Chemistry. Algorithmica 40 (2) (2004)
Suresh Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian
Statistical data depth and the graphics hardware. Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications (2003)
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa
On a Conjecture on Wiener Indices in Combinatorial Chemistry. COCOON (2003)
Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian
Streaming Geometric Optimization Using Graphics Hardware. ESA (2003)
Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian
Hardware-assisted computation of depth contours. SODA (2002)
Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang
Near-Linear Time Approximation Algorithms for Curve Simplification. ESA (2002)
Nabil H. Mustafa, Aleksandar Pekec
Majority Consensus and the Local Majority Rule. ICALP (2001)
Nabil H. Mustafa, Eleftherios Koutsofios, Shankar Krishnan, Suresh Venkatasubramanian
Hardware-assisted view-dependent map simplification. SCG (2001)