Hardware-assisted view-dependent map simplification. - Nabil H. Mustafa; Eleftherios Koutsofios; Shankar Krishnan; Suresh Venkatasubramanian (SCG, 2001)

Majority Consensus and the Local Majority Rule. - Nabil H. Mustafa; Aleksandar Sasa Pekec (ICALP, 2001)

Near-Linear Time Approximation Algorithms for Curve Simplification. - Pankaj K. Agarwal; Sariel Har-Peled; Nabil H. Mustafa; Yusu Wang 001 (ESA, 2002)

Hardware-assisted computation of depth contours. - Shankar Krishnan; Nabil H. Mustafa; Suresh Venkatasubramanian (SODA, 2002)

On a Conjecture on Wiener Indices in Combinatorial Chemistry. - Yih-En Andrew Ban; Sergei Bespamyatnikh; Nabil H. Mustafa (COCOON, 2003)

Statistical data depth and the graphics hardware. - Suresh Krishnan; Nabil H. Mustafa; Suresh Venkatasubramanian (Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications, 2003)

Streaming Geometric Optimization Using Graphics Hardware. - Pankaj K. Agarwal; Shankar Krishnan; Nabil H. Mustafa; Suresh Venkatasubramanian (ESA, 2003)

k-Means Projective Clustering. - Pankaj K. Agarwal; Nabil H. Mustafa (PODS, 2004)

Independent Set of Intersection Graphs of Convex Objects in 2D. - Pankaj K. Agarwal; Nabil H. Mustafa (SWAT, 2004)

Listen to Your Neighbors: How (Not) to Reach a Consensus. - Nabil H. Mustafa; Aleksandar Sasa Pekec (SIAM J. Discret. Math., 2004)

Approximation Algorithms for Euclidean Group TSP. - Khaled M. Elbassioni; Aleksei V. Fishkin; Nabil H. Mustafa; René Sitters (ICALP, 2005)

Conflict-Free Colorings of Rectangles Ranges. - Khaled M. Elbassioni; Nabil H. Mustafa (STACS, 2006)

Dynamic simplification and visualization of large maps. - Nabil H. Mustafa; Shankar Krishnan; Gokul Varadhan; Suresh Venkatasubramanian (Int. J. Geogr. Inf. Sci., 2006)

An optimal generalization of the centerpoint theorem, and its extensions. - Saurabh Ray; Nabil H. Mustafa (SCG, 2007)

Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension. - Saurabh Ray; Nabil H. Mustafa (SCG, 2007)

Fast Molecular Shape Matching Using Contact Maps. - Pankaj K. Agarwal; Nabil H. Mustafa; Yusu Wang 001 (J. Comput. Biol., 2007)

Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. - Nabil H. Mustafa; Saurabh Ray (Comput. Geom., 2008)

PTAS for geometric hitting set problems via local search. - Nabil H. Mustafa; Saurabh Ray (SCG, 2009)

An optimal extension of the centerpoint theorem. - Nabil H. Mustafa; Saurabh Ray (Comput. Geom., 2009)

Improving the first selection lemma in R3. - Abdul Basit 001; Nabil H. Mustafa; Saurabh Ray; Sarfraz Raza (SCG, 2010)

Centerpoints and Tverberg's technique. - Abdul Basit 001; Nabil H. Mustafa; Saurabh Ray; Sarfraz Raza (Comput. Geom., 2010)

Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. - Nabil H. Mustafa; Saurabh Ray (Comput. Geom., 2010)

Hitting Simplices with Points in R3. - Abdul Basit 001; Nabil H. Mustafa; Saurabh Ray; Sarfraz Raza (Discret. Comput. Geom., 2010)

Improved Results on Geometric Hitting Set Problems. - Nabil H. Mustafa; Saurabh Ray (Discret. Comput. Geom., 2010)

Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane. - Nabil H. Mustafa; Saurabh Ray; Mudassir Shabbir (ESA, 2011)

A theorem of bárány revisited and extended. - Nabil H. Mustafa; Saurabh Ray (SCG, 2012)

Approximations of Points: Combinatorics and Algorithms. - Nabil H. Mustafa (2013)

A Separator Theorem for Intersecting Objects in the Plane. - Nabil H. Mustafa; Rajiv Raman 001 (CCCG, 2014)

Settling the APX-Hardness Status for Geometric Set Cover. - Nabil H. Mustafa; Rajiv Raman 001; Saurabh Ray (FOCS, 2014)

Near-Optimal Generalisations of a Theorem of Macbeath. - Nabil H. Mustafa; Saurabh Ray (STACS, 2014)

A proof of the Oja depth conjecture in the plane. - Nabil H. Mustafa; Hans Raj Tiwary; Daniel Werner (Comput. Geom., 2014)

QPTAS for Geometric Set-Cover Problems via Optimal Separators. - Nabil H. Mustafa; Rajiv Raman 001; Saurabh Ray (CoRR, 2014)

Geometric Hitting Sets for Disks: Theory and Practice. - Norbert Bus; Nabil H. Mustafa; Saurabh Ray (ESA, 2015)

On the Zarankiewicz Problem for Intersection Hypergraphs. - Nabil H. Mustafa; János Pach (GD, 2015)

Improved Local Search for Geometric Hitting Set. - Norbert Bus; Shashwat Garg; Nabil H. Mustafa; Saurabh Ray (STACS, 2015)

IlluminationCut. - Norbert Bus; Nabil H. Mustafa; Venceslas Biri (Comput. Graph. Forum, 2015)

Global Illumination Using Well-Separated Pair Decomposition. - Norbert Bus; Nabil H. Mustafa; Venceslas Biri (Comput. Graph. Forum, 2015)

Tighter Estimates for epsilon-nets for Disks. - Norbert Bus; Shashwat Garg; Nabil H. Mustafa; Saurabh Ray (CoRR, 2015)

A Note on the Size-Sensitive Packing Lemma. - Nabil H. Mustafa (CoRR, 2015)

k-Centerpoints Conjectures for Pointsets in ℝd. - Nabil H. Mustafa; Saurabh Ray; Mudassir Shabbir (Int. J. Comput. Geom. Appl., 2015)

Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces. - Nabil H. Mustafa; Rajiv Raman 001; Saurabh Ray (SIAM J. Comput., 2015)

New Lower Bounds for epsilon-Nets. - Andrey Kupavskii; Nabil H. Mustafa; János Pach (SoCG, 2016)

Tighter estimates for ϵ-nets for disks. - Norbert Bus; Shashwat Garg; Nabil H. Mustafa; Saurabh Ray (Comput. Geom., 2016)

A Simple Proof of the Shallow Packing Lemma. - Nabil H. Mustafa (Discret. Comput. Geom., 2016)

An optimal generalization of the Colorful Carathéodory theorem. - Nabil H. Mustafa; Saurabh Ray (Discret. Math., 2016)

Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. - Kunal Dutta; Arijit Ghosh; Bruno Jartoux; Nabil H. Mustafa (SoCG, 2017)

Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. - Daniel Antunes; Claire Mathieu; Nabil H. Mustafa (ESA, 2017)

The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg. - Jesús A. De Loera; Xavier Goaoc; Frédéric Meunier; Nabil H. Mustafa (CoRR, 2017)

Epsilon-approximations and epsilon-nets. - Nabil H. Mustafa; Kasturi R. Varadarajan (CoRR, 2017)

Limits of Local Search: Quality and Efficiency. - Norbert Bus; Shashwat Garg; Nabil H. Mustafa; Saurabh Ray (Discret. Comput. Geom., 2017)

ε -Mnets: Hitting Geometric Set Systems with Subsets. - Nabil H. Mustafa; Saurabh Ray (Discret. Comput. Geom., 2017)

Optimality of Geometric Local Search. - Bruno Jartoux; Nabil H. Mustafa (SoCG, 2018)

On a Problem of Danzer. - Nabil H. Mustafa; Saurabh Ray (ESA, 2018)

Visibility based WSPD for Global Illumination. - Maxime Maria; Nabil H. Mustafa; Thomas Bardoux; Jérémie Defaye; Venceslas Biri (VISIGRAPP (1: GRAPP), 2018)

A Simple Proof of Optimal Epsilon Nets. - Nabil H. Mustafa; Kunal Dutta; Arijit Ghosh (Comb., 2018)

Integer and Mixed Integer Tverberg Numbers. - Jesús A. De Loera; Thomas A. Hogan; Frédéric Meunier; Nabil H. Mustafa (CoRR, 2018)

Optimal Bounds on the VC-dimension. - Mónika Csikós; Andrey Kupavskii; Nabil H. Mustafa (CoRR, 2018)

Practical and efficient algorithms for the geometric hitting set problem. - Norbert Bus; Nabil H. Mustafa; Saurabh Ray (Discret. Appl. Math., 2018)

Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint. - Chien-Chung Huang 001; Mathieu Mari; Claire Mathieu; Joseph S. B. Mitchell; Nabil H. Mustafa (APPROX-RANDOM, 2019)

Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set. - Nabil H. Mustafa (ICALP, 2019)

Theorems of Carathéodory, Helly, and Tverberg without dimension. - Karim A. Adiprasito; Imre Bárány; Nabil H. Mustafa (SODA, 2019)

Bounding the Size of an Almost-Equidistant Set in Euclidean Space. - Andrey Kupavskii; Nabil H. Mustafa; Konrad J. Swanepoel (Comb. Probab. Comput., 2019)

Tight Lower Bounds on the VC-dimension of Geometric Set Systems. - Mónika Csikós; Nabil H. Mustafa; Andrey Kupavskii (J. Mach. Learn. Res., 2019)

An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets. - Imre Bárány; Nabil H. Mustafa (Comput. Geom., 2020)

A Simple Proof of Optimal Approximations. - Mónika Csikós; Nabil H. Mustafa (CoRR, 2020)

Theorems of Carathéodory, Helly, and Tverberg Without Dimension. - Karim A. Adiprasito; Imre Bárány; Nabil H. Mustafa; Tamás Terpai (Discret. Comput. Geom., 2020)

Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications. - Mónika Csikós; Nabil H. Mustafa (SoCG, 2021)

Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple, and Practical. - Mónika Csikós; Nabil H. Mustafa (CoRR, 2022)

A Tight Analysis of Geometric Local Search. - Bruno Jartoux; Nabil H. Mustafa (Discret. Comput. Geom., 2022)

Optimal approximations made easy. - Mónika Csikós; Nabil H. Mustafa (Inf. Process. Lett., 2022)

An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations. - Mónika Csikós; Nabil H. Mustafa (ICALP, 2024)

A Greedy Algorithm for Low-Crossing Partitions for General Set Systems. - Mónika Csikós; Alexandre Louvet; Nabil H. Mustafa (CoRR, 2025)