Nabil H. Mustafa

PROFILE

Homepage
No homepage is listed.
ORCID
No ORCID is listed.
Affiliations
No affiliations are listed.
Aliases
Nabil H. Mustafa, Nabil Mustafa
Publication record
96 papers · 1,934 citations · H-index 23

PAPERS

A Greedy Algorithm for Low-Crossing Partitions for General Set Systems
20250 citationsauthor #3
An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations
20241 citationsauthor #2
Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple, and Practical
20220 citationsauthor #2
A Tight Analysis of Geometric Local Search
20221 citationsauthor #2
Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications
20213 citationsauthor #2
A Simple Proof of Optimal Approximations
20200 citationsauthor #2
Optimal approximations made easy
20205 citationsauthor #2
An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets
20201 citationsauthor #2
Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set
20199 citationsauthor #1
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint
20199 citationsauthor #5
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning
20192 citationsauthor #4
2 Improved Local Search for Geometric Hitting Set
20190 citationsauthor #3
Discrete Geometry for Computer Imagery
20192 citationsauthor #4
Tight Lower Bounds on the VC-dimension of Geometric Set Systems
201920 citationsauthor #2
Theorems of Carathéodory, Helly, and Tverberg Without Dimension
201818 citationsauthor #3
Practical and efficient algorithms for the geometric hitting set problem
201824 citationsauthor #2
On a Problem of Danzer
20184 citationsauthor #1
Optimality of Geometric Local Search
20187 citationsauthor #2
Optimal Bounds on the VC-dimension
201810 citationsauthor #3
Visibility based WSPD for Global Illumination
20182 citationsauthor #2
A Simple Proof of Optimal Epsilon Nets
201829 citationsauthor #1
Integer and Mixed Integer Tverberg Numbers
20181 citationsauthor #4
Tverberg theorems over discrete sets of points
20183 citationsauthor #4
Epsilon-approximations and epsilon-nets
201725 citationsauthor #1
A Simple Proof of Optimal Epsilon Nets
20171 citationsauthor #1
Near-Optimal Lower Bounds for Epsilon-nets for Half-spaces and Low Complexity Set Systems
20173 citationsauthor #2
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning
201716 citationsauthor #4
Epsilon-Approximations & Epsilon-Nets
201738 citationsauthor #1
2 01 7 47 EPSILON-APPROXIMATIONS & EPSILON-NETS
20170 citationsauthor #1
Bounding the Size of an Almost-Equidistant Set in Euclidean Space
20178 citationsauthor #2
Near-Optimal Lower Bounds for -nets for Half-spaces and Low Complexity Set Systems
20175 citationsauthor #2
Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs
201711 citationsauthor #3
The VC-dimension of Unions : Learning , Geometry and Combinatorics
20170 citationsauthor #3
Fe b 20 17 47 EPSILON-APPROXIMATIONS & EPSILON-NETS
20170 citationsauthor #1
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
201793 citationsauthor #4
New Lower Bounds for �-nets
20163 citationsauthor #2
New Lower Bounds for epsilon-Nets
201616 citationsauthor #2
47 EPSILON-APPROXIMATIONS & EPSILON-NETS
20160 citationsauthor #1
Limits of Local Search: Quality and Efficiency
201614 citationsauthor #3
An optimal generalization of the Colorful Carathéodory theorem
20168 citationsauthor #1
ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document}-Mnets: Hitting Geometric Set Systems wit
201610 citationsauthor #1
A new asymmetric correlation inequality for Gaussian measure
20161 citationsauthor #3
A Simple Proof of the Shallow Packing Lemma
201621 citationsauthor #1
Tighter Estimates for epsilon-nets for Disks
201510 citationsauthor #3
A Note on the Size-Sensitive Packing Lemma
20150 citationsauthor #1
Tighter Estimates for epsilon-nets for Disks
201510 citationsauthor #3
Geometric Hitting Sets for Disks: Theory and Practice
20159 citationsauthor #2
IlluminationCut
201511 citationsauthor #2
QPTAS for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
20151 citationsauthor #1
On the Zarankiewicz problem for intersection hypergraphs
201515 citationsauthor #1
Global Illumination Using Well‐Separated Pair Decomposition
20155 citationsauthor #2
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
201535 citationsauthor #1
k-Centerpoints Conjectures for Pointsets in ℝd
20156 citationsauthor #1
New Lower Bounds for (cid:15) -nets
20150 citationsauthor #2
A Brief Remark on the Size-Sensitive Packing Lemma
20150 citationsauthor #1
Improved Local Search for Geometric Hitting Set
20159 citationsauthor #3
Near-Optimal Generalisations of a Theorem of Macbeath
201419 citationsauthor #1
A Separator Theorem for Intersecting Objects in the Plane
20142 citationsauthor #1
QPTAS for Geometric Set-Cover Problems via Optimal Separators
201417 citationsauthor #1
A proof of the Oja depth conjecture in the plane
20145 citationsauthor #1
Settling the APX-Hardness Status for Geometric Set Cover
201433 citationsauthor #1
Approximations of Points: Combinatorics and Algorithms
20134 citationsauthor #1
A theorem of bárány revisited and extended
20121 citationsauthor #1
Streaming Geometri Optimization usingGraphi s Hardware ?
20110 citationsauthor #3
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
20116 citationsauthor #1
Improved Results on Geometric Hitting Set Problems
2010248 citationsauthor #1
Improving the first selection lemma in R3
20109 citationsauthor #2
- Means Projective Clustering �
20101 citationsauthor #2
Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension
20102 citationsauthor #1
Hitting Simplices with Points in ℝ3
20109 citationsauthor #2
Centerpoints and Tverberg's technique
20104 citationsauthor #2
An optimal extension of the centerpoint theorem
200925 citationsauthor #1
PTAS for geometric hitting set problems via local search
200994 citationsauthor #1
Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension
200810 citationsauthor #1
Fast Molecular Shape Matching Using Contact Maps
200725 citationsauthor #2
Weak ε-nets have basis of size o(1/ε log (1/ε)) in any dimension
20077 citationsauthor #2
Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension
20071 citationsauthor #2
An optimal generalization of the centerpoint theorem, and its extensions
20078 citationsauthor #2
Conflict-Free Colorings of Rectangles Ranges
200634 citationsauthor #2
Dynamic simplification and visualization of large maps
200647 citationsauthor #1
Approximation Algorithms for Euclidean Group TSP
200562 citationsauthor #3
A Conjecture on Wiener Indices in Combinatorial Chemistry
200415 citationsauthor #3
k-means projective clustering
2004226 citationsauthor #2
Independent set of intersection graphs of convex objects in 2D
200467 citationsauthor #2
Listen to Your Neighbors: How (Not) to Reach a Consensus
200424 citationsauthor #1
Simplification, estimation and classification of geometric objects
20044 citationsauthor #1
Streaming Geometric Optimization Using Graphics Hardware
200363 citationsauthor #3
On a Conjecture on Wiener Indices in Combinatorial Chemistry
20030 citationsauthor #3
Hardware-assisted computation of depth contours
200237 citationsauthor #2
Near-Linear Time Approximation Algorithms for Curve Simplification ∗
200247 citationsauthor #3
Near-Linear Time Approximation Algorithms for Curve Simplification
2002167 citationsauthor #3
Hardware-Assisted View-Dependent Planar Map Simplification
20013 citationsauthor #1
Majority Consensus and the Local Majority Rule
200130 citationsauthor #1
Hardware-assisted view-dependent map simplification
200131 citationsauthor #1
Democratic Consensus and the Local Majority Rule
20001 citationsauthor #1
Democratic Consensus and the Local Majority Rule
year unknown12 citationsauthor #1

TIMELINE

2000 1 citations

2001 64 citations

2002 251 citations

2003 63 citations

2004 336 citations

2005 62 citations

2006 81 citations

2007 41 citations

2008 10 citations

2009 119 citations

2010 273 citations

2011 6 citations

2012 1 citations

2013 4 citations

2014 76 citations

2015 111 citations

2016 73 citations

2017 200 citations

2018 98 citations

2019 42 citations

2020 6 citations

2021 3 citations

2022 1 citations

2024 1 citations

2025 0 citations

Unknown 12 citations

Nabil H. Mustafa

PROFILE

PAPERS

TIMELINE

COAUTHOR MAP

CONCEPT FOOTPRINT