default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNabil H. Mustafa
Person information
- affiliation: ESIEE Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c34]Mónika Csikós, Nabil H. Mustafa:
An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations. ICALP 2024: 49:1-49:18- 2022
- [j33]Bruno Jartoux
, Nabil H. Mustafa:
A Tight Analysis of Geometric Local Search. Discret. Comput. Geom. 67(2): 361-379 (2022) - [j32]Mónika Csikós, Nabil H. Mustafa:
Optimal approximations made easy. Inf. Process. Lett. 176: 106250 (2022) - [i11]Mónika Csikós, Nabil H. Mustafa:
Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple, and Practical. CoRR abs/2209.01147 (2022) - 2021
- [c33]Mónika Csikós, Nabil H. Mustafa:
Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications. SoCG 2021: 28:1-28:17 - 2020
- [j31]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: 101649 (2020) - [j30]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): 233-258 (2020) - [i10]Mónika Csikós, Nabil H. Mustafa:
A Simple Proof of Optimal Approximations. CoRR abs/2008.08970 (2020)
2010 – 2019
- 2019
- [j29]Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel:
Bounding the Size of an Almost-Equidistant Set in Euclidean Space. Comb. Probab. Comput. 28(2): 280-286 (2019) - [j28]Nabil H. Mustafa, Saurabh Ray:
On a Problem of Danzer. Comb. Probab. Comput. 28(3): 473-482 (2019) - [j27]Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa:
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. Discret. Comput. Geom. 61(4): 756-777 (2019) - [j26]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: 81:1-81:8 (2019) - [c32]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: 32:1-32:21 - [c31]Nabil H. Mustafa:
Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set. ICALP 2019: 87:1-87:12 - [c30]Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa:
Theorems of Carathéodory, Helly, and Tverberg without dimension. SODA 2019: 2350-2360 - [e1]Michel Couprie, Jean Cousty, Yukiko Kenmochi, Nabil H. Mustafa:
Discrete Geometry for Computer Imagery - 21st IAPR International Conference, DGCI 2019, Marne-la-Vallée, France, March 26-28, 2019, Proceedings. Lecture Notes in Computer Science 11414, Springer 2019, ISBN 978-3-030-14084-7 [contents] - 2018
- [j25]Nabil H. Mustafa, Kunal Dutta, Arijit Ghosh:
A Simple Proof of Optimal Epsilon Nets. Comb. 38(5): 1269-1277 (2018) - [j24]Norbert Bus, Nabil H. Mustafa, Saurabh Ray:
Practical and efficient algorithms for the geometric hitting set problem. Discret. Appl. Math. 240: 25-32 (2018) - [c29]Bruno Jartoux, Nabil H. Mustafa:
Optimality of Geometric Local Search. SoCG 2018: 48:1-48:15 - [c28]Nabil H. Mustafa, Saurabh Ray:
On a Problem of Danzer. ESA 2018: 64:1-64:8 - [c27]Maxime Maria, Nabil H. Mustafa, Thomas Bardoux, Jérémie Defaye, Venceslas Biri:
Visibility based WSPD for Global Illumination. VISIGRAPP (1: GRAPP) 2018: 81-90 - [i9]Jesús A. De Loera, Thomas A. Hogan, Frédéric Meunier, Nabil H. Mustafa:
Integer and Mixed Integer Tverberg Numbers. CoRR abs/1803.01816 (2018) - [i8]Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa:
Theorems of Carathéodory, Helly, and Tverberg without dimension. CoRR abs/1806.08725 (2018) - [i7]Mónika Csikós, Andrey Kupavskii, Nabil H. Mustafa:
Optimal Bounds on the VC-dimension. CoRR abs/1807.07924 (2018) - 2017
- [j23]Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray:
Limits of Local Search: Quality and Efficiency. Discret. Comput. Geom. 57(3): 607-624 (2017) - [j22]Nabil H. Mustafa, Saurabh Ray:
ε -Mnets: Hitting Geometric Set Systems with Subsets. Discret. Comput. Geom. 57(3): 625-640 (2017) - [c26]Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa:
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. SoCG 2017: 38:1-38:15 - [c25]Daniel Antunes, Claire Mathieu, Nabil H. Mustafa:
Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. ESA 2017: 8:1-8:13 - [i6]Nabil H. Mustafa, Kasturi R. Varadarajan:
Epsilon-approximations and epsilon-nets. CoRR abs/1702.03676 (2017) - [i5]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 abs/1706.05975 (2017) - [i4]Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel:
Bounding the size of an almost-equidistant set in Euclidean space. CoRR abs/1708.01590 (2017) - 2016
- [j21]Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray:
Tighter estimates for ϵ-nets for disks. Comput. Geom. 53: 27-35 (2016) - [j20]Nabil H. Mustafa:
A Simple Proof of the Shallow Packing Lemma. Discret. Comput. Geom. 55(3): 739-743 (2016) - [j19]Nabil H. Mustafa, Saurabh Ray:
An optimal generalization of the Colorful Carathéodory theorem. Discret. Math. 339(4): 1300-1305 (2016) - [j18]Nabil H. Mustafa, János Pach:
On the Zarankiewicz problem for intersection hypergraphs. J. Comb. Theory A 141: 1-7 (2016) - [c24]Andrey Kupavskii, Nabil H. Mustafa, János Pach:
New Lower Bounds for epsilon-Nets. SoCG 2016: 54:1-54:16 - 2015
- [j17]Norbert Bus, Nabil H. Mustafa, Venceslas Biri:
IlluminationCut. Comput. Graph. Forum 34(2): 561-573 (2015) - [j16]Norbert Bus, Nabil H. Mustafa, Venceslas Biri:
Global Illumination Using Well-Separated Pair Decomposition. Comput. Graph. Forum 34(8): 88-103 (2015) - [j15]Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir:
k-Centerpoints Conjectures for Pointsets in ℝd. Int. J. Comput. Geom. Appl. 25(3): 163-186 (2015) - [j14]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): 1650-1669 (2015) - [c23]Norbert Bus, Nabil H. Mustafa, Saurabh Ray:
Geometric Hitting Sets for Disks: Theory and Practice. ESA 2015: 903-914 - [c22]Nabil H. Mustafa, János Pach:
On the Zarankiewicz Problem for Intersection Hypergraphs. GD 2015: 207-216 - [c21]Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray:
Improved Local Search for Geometric Hitting Set. STACS 2015: 184-196 - [i3]Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray:
Tighter Estimates for epsilon-nets for Disks. CoRR abs/1501.03246 (2015) - [i2]Nabil H. Mustafa:
A Note on the Size-Sensitive Packing Lemma. CoRR abs/1509.04020 (2015) - 2014
- [j13]Nabil H. Mustafa, Hans Raj Tiwary, Daniel Werner:
A proof of the Oja depth conjecture in the plane. Comput. Geom. 47(6): 668-674 (2014) - [c20]Nabil H. Mustafa, Rajiv Raman:
A Separator Theorem for Intersecting Objects in the Plane. CCCG 2014 - [c19]Nabil H. Mustafa, Rajiv Raman, Saurabh Ray:
Settling the APX-Hardness Status for Geometric Set Cover. FOCS 2014: 541-550 - [c18]Nabil H. Mustafa, Saurabh Ray:
Near-Optimal Generalisations of a Theorem of Macbeath. STACS 2014: 578-589 - [i1]Nabil H. Mustafa, Rajiv Raman, Saurabh Ray:
QPTAS for Geometric Set-Cover Problems via Optimal Separators. CoRR abs/1403.0835 (2014) - 2013
- [b1]Nabil H. Mustafa:
Approximations of Points: Combinatorics and Algorithms. University of Paris-Est, France, 2013 - 2012
- [c17]Nabil H. Mustafa, Saurabh Ray:
A theorem of bárány revisited and extended. SCG 2012: 333-338 - 2011
- [c16]Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir:
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane. ESA 2011: 506-517 - 2010
- [j12]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): 565-571 (2010) - [j11]Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza:
Centerpoints and Tverberg's technique. Comput. Geom. 43(6-7): 593-600 (2010) - [j10]Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza:
Hitting Simplices with Points in R3. Discret. Comput. Geom. 44(3): 637-644 (2010) - [j9]Nabil H. Mustafa, Saurabh Ray:
Improved Results on Geometric Hitting Set Problems. Discret. Comput. Geom. 44(4): 883-895 (2010) - [c15]Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza:
Improving the first selection lemma in R3. SCG 2010: 354-357
2000 – 2009
- 2009
- [j8]Nabil H. Mustafa, Saurabh Ray:
An optimal extension of the centerpoint theorem. Comput. Geom. 42(6-7): 505-510 (2009) - [c14]Nabil H. Mustafa, Saurabh Ray:
PTAS for geometric hitting set problems via local search. SCG 2009: 17-22 - 2008
- [j7]Nabil H. Mustafa, Saurabh Ray:
Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. Comput. Geom. 40(1): 84-91 (2008) - 2007
- [j6]Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang:
Fast Molecular Shape Matching Using Contact Maps. J. Comput. Biol. 14(2): 131-143 (2007) - [c13]Saurabh Ray, Nabil H. Mustafa:
An optimal generalization of the centerpoint theorem, and its extensions. SCG 2007: 138-141 - [c12]Saurabh Ray, Nabil H. Mustafa:
Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension. SCG 2007: 239-244 - 2006
- [j5]Pankaj K. Agarwal, Nabil H. Mustafa:
Independent set of intersection graphs of convex objects in 2D. Comput. Geom. 34(2): 83-95 (2006) - [j4]Nabil H. Mustafa, Shankar Krishnan, Gokul Varadhan, Suresh Venkatasubramanian:
Dynamic simplification and visualization of large maps. Int. J. Geogr. Inf. Sci. 20(3): 273-302 (2006) - [c11]Khaled M. Elbassioni, Nabil H. Mustafa:
Conflict-Free Colorings of Rectangles Ranges. STACS 2006: 254-263 - 2005
- [j3]Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang:
Near-Linear Time Approximation Algorithms for Curve Simplification. Algorithmica 42(3-4): 203-219 (2005) - [c10]Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters:
Approximation Algorithms for Euclidean Group TSP. ICALP 2005: 1115-1126 - 2004
- [j2]Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa:
A Conjecture on Wiener Indices in Combinatorial Chemistry. Algorithmica 40(2): 99-117 (2004) - [j1]Nabil H. Mustafa, Aleksandar Pekec:
Listen to Your Neighbors: How (Not) to Reach a Consensus. SIAM J. Discret. Math. 17(4): 634-660 (2004) - [c9]Pankaj K. Agarwal, Nabil H. Mustafa:
k-Means Projective Clustering. PODS 2004: 155-165 - [c8]Pankaj K. Agarwal, Nabil H. Mustafa:
Independent Set of Intersection Graphs of Convex Objects in 2D. SWAT 2004: 127-137 - 2003
- [c7]Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa:
On a Conjecture on Wiener Indices in Combinatorial Chemistry. COCOON 2003: 509-518 - [c6]Suresh Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian:
Statistical data depth and the graphics hardware. Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications 2003: 223-246 - [c5]Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian:
Streaming Geometric Optimization Using Graphics Hardware. ESA 2003: 544-555 - 2002
- [c4]Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang:
Near-Linear Time Approximation Algorithms for Curve Simplification. ESA 2002: 29-41 - [c3]Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian:
Hardware-assisted computation of depth contours. SODA 2002: 558-567 - 2001
- [c2]Nabil H. Mustafa, Eleftherios Koutsofios, Shankar Krishnan, Suresh Venkatasubramanian:
Hardware-assisted view-dependent map simplification. SCG 2001: 50-59 - [c1]Nabil H. Mustafa, Aleksandar Pekec:
Majority Consensus and the Local Majority Rule. ICALP 2001: 530-542
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
