Personal information

Other IDs

Scopus Author ID: 7003451891

Activities

Collapse all

Works (50 of 56)

Items per page:
Page 1 of 2

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

Combinatorics Probability and Computing
2018 | Journal article
DOI: 10.1017/S0963548318000287
EID:

2-s2.0-85048766369
Contributors: KUPAVSKII, A.; MUSTAFA, N.H.; SWANEPOEL, K.J.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

On a problem of danzer

Leibniz International Proceedings in Informatics, LIPIcs
2018 | Conference paper
DOI: 10.4230/LIPIcs.ESA.2018.64
EID:

2-s2.0-85052516253
Contributors: Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Optimality of geometric local search

Leibniz International Proceedings in Informatics, LIPIcs
2018 | Conference paper
DOI: 10.4230/LIPIcs.SoCG.2018.48
EID:

2-s2.0-85048985203
Contributors: Jartoux, B.; Mustafa, N.H.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Practical and efficient algorithms for the geometric hitting set problem

Discrete Applied Mathematics
2018 | Journal article
DOI: 10.1016/j.dam.2017.12.018
EID:

2-s2.0-85040735765
Contributors: Bus, N.; Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Visibility based WSPD for global illumination

VISIGRAPP 2018 - Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications
2018 | Conference paper
EID:

2-s2.0-85047755936
Contributors: Maria, M.; Mustafa, N.; Bardoux, T.; Defaye, J.; Biri, V.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

A simple proof of optimal epsilon nets

Combinatorica
2017 | Journal article
DOI: 10.1007/s00493-017-3564-5
EID:

2-s2.0-85020694670
Contributors: Mustafa, N.H.; Dutta, K.; Ghosh, A.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Combinatorics of local search: An optimal 4-local hall's theorem for planar graphs

Leibniz International Proceedings in Informatics, LIPIcs
2017 | Conference paper
DOI: 10.4230/LIPIcs.ESA.2017.8
EID:

2-s2.0-85030533083
Contributors: Antunes, D.; Mathieu, C.; Mustafa, N.H.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Epsilon-approximations & epsilon-nets

Handbook of Discrete and Computational Geometry, Third Edition
2017 | Book
Part of DOI: 10.1201/9781315119601
EID:

2-s2.0-85052719087
Contributors: Mustafa, N.H.; Varadarajan, K.R.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Limits of Local Search: Quality and Efficiency

Discrete and Computational Geometry
2017 | Journal article
DOI: 10.1007/s00454-016-9819-x
EID:

2-s2.0-84992188268
Contributors: Bus, N.; Garg, S.; Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Near-optimal lower bounds for ε-nets for half-spaces and low complexity set systems

A Journey through Discrete Mathematics: A Tribute to Jiri Matousek
2017 | Book
Part of DOI: 10.1007/978-3-319-44479-6_21
EID:

2-s2.0-85029924331
Contributors: Kupavskii, A.; Mustafa, N.H.; Pach, J.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning

Leibniz International Proceedings in Informatics, LIPIcs
2017 | Conference paper
DOI: 10.4230/LIPIcs.SoCG.2017.38
EID:

2-s2.0-85029947864
Contributors: Dutta, K.; Ghosh, A.; Jartoux, B.; Mustafa, N.H.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

ε -Mnets: Hitting Geometric Set Systems with Subsets

Discrete and Computational Geometry
2017 | Journal article
DOI: 10.1007/s00454-016-9845-8
EID:

2-s2.0-85001755145
Contributors: Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

A Simple Proof of the Shallow Packing Lemma

Discrete and Computational Geometry
2016 | Journal article
DOI: 10.1007/s00454-016-9767-5
EID:

2-s2.0-84961062173
Contributors: Mustafa, N.H.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

An optimal generalization of the Colorful Carathéodory theorem

Discrete Mathematics
2016 | Journal article
DOI: 10.1016/j.disc.2015.11.019
EID:

2-s2.0-84949964704
Contributors: Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

New lower bounds for ε-nets

Leibniz International Proceedings in Informatics, LIPIcs
2016 | Conference paper
DOI: 10.4230/LIPIcs.SoCG.2016.54
EID:

2-s2.0-84976872367
Contributors: Kupavskii, A.; Mustafa, N.H.; Pach, J.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

On the Zarankiewicz problem for intersection hypergraphs

Journal of Combinatorial Theory. Series A
2016 | Journal article
DOI: 10.1016/j.jcta.2016.02.001
EID:

2-s2.0-84957887235
Contributors: Mustafa, N.H.; Pach, J.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Tighter estimates for ∈-nets for disks

Computational Geometry: Theory and Applications
2016 | Journal article
DOI: 10.1016/j.comgeo.2015.12.002
EID:

2-s2.0-84961301995
Contributors: Bus, N.; Garg, S.; Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Geometric hitting sets for disks: Theory and practice

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2015 | Book
DOI: 10.1007/978-3-662-48350-3_75
EID:

2-s2.0-84945581174
Contributors: Bus, N.; Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Global Illumination Using Well-Separated Pair Decomposition

Computer Graphics Forum
2015 | Journal article
DOI: 10.1111/cgf.12610
EID:

2-s2.0-84955192851
Contributors: Bus, N.; Mustafa, N.H.; Biri, V.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

IlluminationCut

Computer Graphics Forum
2015 | Journal article
DOI: 10.1111/cgf.12584
EID:

2-s2.0-84932106195
Contributors: Bus, N.; Mustafa, N.H.; Biri, V.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Improved local search for geometric hitting set

Leibniz International Proceedings in Informatics, LIPIcs
2015 | Conference paper
DOI: 10.4230/LIPIcs.STACS.2015.184
EID:

2-s2.0-84923868175
Contributors: Bus, N.; Garg, S.; Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

K-Centerpoints Conjectures for Pointsets in R<sup>d</sup>

International Journal of Computational Geometry and Applications
2015 | Journal article
DOI: 10.1142/S0218195915500107
EID:

2-s2.0-84944329043
Contributors: Mustafa, N.H.; Ray, S.; Shabbir, M.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

On the Zarankiewicz problem for intersection hypergraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2015 | Book
DOI: 10.1007/978-3-319-27261-0_18
EID:

2-s2.0-84952024605
Contributors: Mustafa, N.H.; Pach, J.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Quasi-polynomial time approxim ation scheme for weighted geometric set cover on pseudodisks and halfspaces

SIAM Journal on Computing
2015 | Journal article
DOI: 10.1137/14099317X
EID:

2-s2.0-84971668377
Contributors: Mustafa, N.H.; Raman, R.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

A proof of the Oja depth conjecture in the plane

Computational Geometry: Theory and Applications
2014 | Journal article
DOI: 10.1016/j.comgeo.2013.12.006
EID:

2-s2.0-84897674013
Contributors: Mustafa, N.H.; Tiwary, H.R.; Werner, D.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

A separator theorem for intersecting objects in the plane

26th Canadian Conference on Computational Geometry, CCCG 2014
2014 | Conference paper
EID:

2-s2.0-84961354977
Contributors: Mustafa, N.H.; Raman, R.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Near-optimal generalisations of a theorem of Macbeath

Leibniz International Proceedings in Informatics, LIPIcs
2014 | Book
Part of DOI: 10.4230/LIPIcs.STACS.2014.578
EID:

2-s2.0-84907854355
Contributors: Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Settling the APX-hardness status for geometric set cover

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
2014 | Conference paper
DOI: 10.1109/FOCS.2014.64
EID:

2-s2.0-84920025974
Contributors: Mustafa, N.H.; Raman, R.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

A theorem of bárány revisited and extended

Proceedings of the Annual Symposium on Computational Geometry
2012 | Conference paper
DOI: 10.1145/2261250.2261300
EID:

2-s2.0-84863891780
Contributors: Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Ray-shooting depth: Computing statistical data depth of point sets in the plane

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2011 | Book
DOI: 10.1007/978-3-642-23719-5_43
EID:

2-s2.0-80052797167
Contributors: Mustafa, N.H.; Ray, S.; Shabbir, M.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Centerpoints and tverberg's technique

Computational Geometry: Theory and Applications
2010 | Journal article
DOI: 10.1016/j.comgeo.2010.03.002
EID:

2-s2.0-77951880661
Contributors: Basit, A.; Mustafa, N.H.; Ray, S.; Raza, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Hitting Simplices with Points in ℝ<sup>3</sup>

Discrete and Computational Geometry
2010 | Journal article
DOI: 10.1007/s00454-010-9263-2
EID:

2-s2.0-77955771874
Contributors: Basit, A.; Mustafa, N.H.; Ray, S.; Raza, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Improved results on geometric hitting set problems

Discrete and Computational Geometry
2010 | Journal article
DOI: 10.1007/s00454-010-9285-9
EID:

2-s2.0-77957980032
Contributors: Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Improving the first selection lemma in ℝ<sup>3</sup>

Proceedings of the Annual Symposium on Computational Geometry
2010 | Conference paper
DOI: 10.1145/1810959.1811017
EID:

2-s2.0-77954933484
Contributors: Basit, A.; Mustafa, N.H.; Ray, S.; Raza, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Reprint of: Weak ε-nets have basis of size

Computational Geometry: Theory and Applications
2010 | Journal article
DOI: 10.1016/j.comgeo.2007.02.007
EID:

2-s2.0-77951879621
Contributors: Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

An optimal extension of the centerpoint theorem

Computational Geometry: Theory and Applications
2009 | Journal article
DOI: 10.1016/j.comgeo.2007.10.004
EID:

2-s2.0-84867956198
Contributors: Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

PTAS for geometric hitting set problems via local search

Proceedings of the Annual Symposium on Computational Geometry
2009 | Conference paper
DOI: 10.1145/1542362.1542367
EID:

2-s2.0-70849098296
Contributors: Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Weak ε-nets have basis of size O (1 /ε log (1 / ε)) in any dimension

Computational Geometry: Theory and Applications
2008 | Journal article
DOI: 10.1016/j.comgeo.2007.02.006
EID:

2-s2.0-84867924611
Contributors: Mustafa, N.H.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

An optimal generalization of the centerpoint theorem, and its extensions

Proceedings of the Annual Symposium on Computational Geometry
2007 | Conference paper
DOI: 10.1145/1247069.1247097
EID:

2-s2.0-35348923507
Contributors: Mustafa, N.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Fast molecular shape matching using contact maps

Journal of Computational Biology
2007 | Journal article
DOI: 10.1089/cmb.2007.0004
EID:

2-s2.0-34248229363
Contributors: Agarwal, P.K.; Mustafa, N.H.; Wang, Y.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

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

Proceedings of the Annual Symposium on Computational Geometry
2007 | Conference paper
DOI: 10.1145/1247069.1247113
EID:

2-s2.0-35348925348
Contributors: Mustafa, N.; Ray, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Conflict-free colorings of rectangles ranges

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2006 | Book
DOI: 10.1007/11672142_20
EID:

2-s2.0-33745626102
Contributors: Elbassioni, K.; Mustafa, N.H.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Dynamic simplification and visualization of large maps

International Journal of Geographical Information Science
2006 | Journal article
DOI: 10.1080/13658810500390794
EID:

2-s2.0-33644806932
Contributors: Mustafa, N.; Krishnan, S.; Varadhan, G.; Venkatasubramanian, S.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Independent set of intersection graphs of convex objects in 2D

Computational Geometry: Theory and Applications
2006 | Journal article
DOI: 10.1016/j.comgeo.2005.12.001
EID:

2-s2.0-84867921245
Contributors: Agarwal, P.K.; Mustafa, N.H.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Approximation algorithms for Euclidean group TSP

Lecture Notes in Computer Science
2005 | Conference paper
EID:

2-s2.0-26444564642
Contributors: Elbassioni, K.; Fishkin, A.V.; Mustafa, N.H.; Sitters, R.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Near-linear time approximation algorithms for curve simplification

Algorithmica (New York)
2005 | Journal article
DOI: 10.1007/s00453-005-1165-y
EID:

2-s2.0-22344432453
Contributors: Agarwal, P.K.; Har-Peled, S.; Mustafa, N.H.; Wang, Y.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

A conjecture on Wiener indices in combinatorial chemistry

Algorithmica (New York)
2004 | Journal article
DOI: 10.1007/s00453-004-1097-y
EID:

2-s2.0-21044436618
Contributors: Ban, Y.-E.A.; Bereg, S.; Mustafa, N.H.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Independent set of intersection graphs of convex objects in 2D

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2004 | Book
EID:

2-s2.0-35048893384
Contributors: Agarwal, P.K.; Mustafa, N.H.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

K-means projective clustering

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
2004 | Conference paper
EID:

2-s2.0-3142682233
Contributors: Agarwal, P.K.; Mustafa, N.H.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier

Listen to your neighbors: How (not) to reach a consensus

SIAM Journal on Discrete Mathematics
2004 | Journal article
DOI: 10.1137/S0895480102408213
EID:

2-s2.0-9744234359
Contributors: Mustafa, N.H.; Pekeč, A.
Source: Self-asserted source
Nabil Mustafa via Scopus - Elsevier
Items per page:
Page 1 of 2
How many people are using ORCID?