Nabil H. Mustafa

According to our database, Nabil H. Mustafa authored at least 70 papers between 2001 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

Optimal approximations made easy.

Mónika Csikós, Nabil H. Mustafa

Inf. Process. Lett., 2022

A Tight Analysis of Geometric Local Search.

Bruno Jartoux, Nabil H. Mustafa

Discret. Comput. Geom., 2022

Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple, and Practical.

Mónika Csikós, Nabil H. Mustafa

CoRR, 2022

2021

Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications.

Mónika Csikós, Nabil H. Mustafa

Proceedings of the 37th International Symposium on Computational Geometry, 2021

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

A Simple Proof of Optimal Approximations.

Mónika Csikós, Nabil H. Mustafa

CoRR, 2020

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

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

Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning.

Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa

Discret. Comput. Geom., 2019

On a Problem of Danzer.

Nabil H. Mustafa, Saurabh Ray

Comb. Probab. Comput., 2019

Bounding the Size of an Almost-Equidistant Set in Euclidean Space.

Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel

Comb. Probab. Comput., 2019

Theorems of Carathéodory, Helly, and Tverberg without dimension.

Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set.

Nabil H. Mustafa

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint.

Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa

Proceedings of the Approximation, 2019

2018

Practical and efficient algorithms for the geometric hitting set problem.

Norbert Bus, Nabil H. Mustafa, Saurabh Ray

Discret. Appl. Math., 2018

Optimal Bounds on the VC-dimension.

Mónika Csikós, Andrey Kupavskii, Nabil H. Mustafa

CoRR, 2018

Integer and Mixed Integer Tverberg Numbers.

Jesús A. De Loera, Thomas A. Hogan, Frédéric Meunier, Nabil H. Mustafa

CoRR, 2018

A Simple Proof of Optimal Epsilon Nets.

Nabil H. Mustafa, Kunal Dutta, Arijit Ghosh

Comb., 2018

Visibility based WSPD for Global Illumination.

Maxime Maria, Nabil H. Mustafa, Thomas Bardoux, Jérémie Defaye, Venceslas Biri

Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2018), 2018

Optimality of Geometric Local Search.

Bruno Jartoux, Nabil H. Mustafa

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

ε -Mnets: Hitting Geometric Set Systems with Subsets.

Nabil H. Mustafa, Saurabh Ray

Discret. Comput. Geom., 2017

Limits of Local Search: Quality and Efficiency.

Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray

Discret. Comput. Geom., 2017

Epsilon-approximations and epsilon-nets.

Nabil H. Mustafa, Kasturi R. Varadarajan

CoRR, 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

Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs.

Daniel Antunes, Claire Mathieu, Nabil H. Mustafa

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

On the Zarankiewicz problem for intersection hypergraphs.

Nabil H. Mustafa, János Pach

J. Comb. Theory, Ser. A, 2016

An optimal generalization of the Colorful Carathéodory theorem.

Nabil H. Mustafa, Saurabh Ray

Discret. Math., 2016

A Simple Proof of the Shallow Packing Lemma.

Nabil H. Mustafa

Discret. Comput. Geom., 2016

Tighter estimates for ϵ-nets for disks.

Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray

Comput. Geom., 2016

New Lower Bounds for epsilon-Nets.

Andrey Kupavskii, Nabil H. Mustafa, János Pach

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces.

Nabil H. Mustafa, Rajiv Raman, Saurabh Ray

SIAM J. Comput., 2015

k-Centerpoints Conjectures for Pointsets in ℝd.

Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir

Int. J. Comput. Geom. Appl., 2015

A Note on the Size-Sensitive Packing Lemma.

Nabil H. Mustafa

CoRR, 2015

Tighter Estimates for epsilon-nets for Disks.

Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray

CoRR, 2015

Global Illumination Using Well-Separated Pair Decomposition.

Norbert Bus, Nabil H. Mustafa, Venceslas Biri

Comput. Graph. Forum, 2015

IlluminationCut.

Norbert Bus, Nabil H. Mustafa, Venceslas Biri

Comput. Graph. Forum, 2015

Improved Local Search for Geometric Hitting Set.

Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Geometric Hitting Sets for Disks: Theory and Practice.

Norbert Bus, Nabil H. Mustafa, Saurabh Ray

Proceedings of the Algorithms - ESA 2015, 2015

2014

QPTAS for Geometric Set-Cover Problems via Optimal Separators.

Nabil H. Mustafa, Rajiv Raman, Saurabh Ray

CoRR, 2014

A proof of the Oja depth conjecture in the plane.

Nabil H. Mustafa, Hans Raj Tiwary, Daniel Werner

Comput. Geom., 2014

Near-Optimal Generalisations of a Theorem of Macbeath.

Nabil H. Mustafa, Saurabh Ray

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Settling the APX-Hardness Status for Geometric Set Cover.

Nabil H. Mustafa, Rajiv Raman, Saurabh Ray

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

A Separator Theorem for Intersecting Objects in the Plane.

Nabil H. Mustafa, Rajiv Raman

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Approximations of Points: Combinatorics and Algorithms.

Nabil H. Mustafa

, 2013

2012

A theorem of bárány revisited and extended.

Nabil H. Mustafa, Saurabh Ray

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane.

Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir

Proceedings of the Algorithms - ESA 2011, 2011

2010

Improved Results on Geometric Hitting Set Problems.

Nabil H. Mustafa, Saurabh Ray

Discret. Comput. Geom., 2010

Hitting Simplices with Points in R³.

Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza

Discret. 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

Centerpoints and Tverberg's technique.

Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza

Comput. Geom., 2010

Improving the first selection lemma in R³.

Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

An optimal extension of the centerpoint theorem.

Nabil H. Mustafa, Saurabh Ray

Comput. Geom., 2009

PTAS for geometric hitting set problems via local search.

Nabil H. Mustafa, Saurabh Ray

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension.

Nabil H. Mustafa, Saurabh Ray

Comput. Geom., 2008

2007

Fast Molecular Shape Matching Using Contact Maps.

Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang

J. Comput. Biol., 2007

Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension.

Saurabh Ray, Nabil H. Mustafa

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

An optimal generalization of the centerpoint theorem, and its extensions.

Saurabh Ray, Nabil H. Mustafa

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Dynamic simplification and visualization of large maps.

Nabil H. Mustafa, Shankar Krishnan, Gokul Varadhan, Suresh Venkatasubramanian

Int. J. Geogr. Inf. Sci., 2006

Independent set of intersection graphs of convex objects in 2D.

Pankaj K. Agarwal, Nabil H. Mustafa

Comput. Geom., 2006

Conflict-Free Colorings of Rectangles Ranges.

Khaled M. Elbassioni, Nabil H. Mustafa

Proceedings of the STACS 2006, 2006

2005

Near-Linear Time Approximation Algorithms for Curve Simplification.

Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang

Algorithmica, 2005

Approximation Algorithms for Euclidean Group TSP.

Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Listen to Your Neighbors: How (Not) to Reach a Consensus.

Nabil H. Mustafa, Aleksandar Pekec

SIAM J. Discret. Math., 2004

A Conjecture on Wiener Indices in Combinatorial Chemistry.

Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa

Algorithmica, 2004

k-Means Projective Clustering.

Pankaj K. Agarwal, Nabil H. Mustafa

Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

2003

Streaming Geometric Optimization Using Graphics Hardware.

Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian

Proceedings of the Algorithms, 2003

Statistical data depth and the graphics hardware.

Suresh Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian

Proceedings of the Data Depth: Robust Multivariate Analysis, 2003

2002

Hardware-assisted computation of depth contours.

Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Majority Consensus and the Local Majority Rule.

Nabil H. Mustafa, Aleksandar Pekec

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Hardware-assisted view-dependent map simplification.

Nabil H. Mustafa, Eleftherios Koutsofios, Shankar Krishnan, Suresh Venkatasubramanian

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001