Nabil H. Mustafa

82 papers A* 12A 11Misc 1Journal 45Unranked 11

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	A Greedy Algorithm for Low-Crossing Partitions for General Set Systems. ALENEX Mónika Csikós, Alexandre Louvet, Nabil H. Mustafa
2025	J	`jnl`	A Greedy Algorithm for Low-Crossing Partitions for General Set Systems. CoRR Mónika Csikós, Alexandre Louvet, Nabil H. Mustafa
2024	A*	`conf`	An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations. ICALP Mónika Csikós, Nabil H. Mustafa
2022	J	`jnl`	A Tight Analysis of Geometric Local Search. Discret. Comput. Geom. Bruno Jartoux, Nabil H. Mustafa
2022	J	`jnl`	Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple, and Practical. CoRR Mónika Csikós, Nabil H. Mustafa
2022	J	`jnl`	Optimal approximations made easy. Inf. Process. Lett. Mónika Csikós, Nabil H. Mustafa
2021	A*	`conf`	Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications. SoCG Mónika Csikós, Nabil H. Mustafa
2020	J	`jnl`	A Simple Proof of Optimal Approximations. CoRR Mónika Csikós, Nabil H. Mustafa
2020	J	`jnl`	An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets. Comput. Geom. Imre Bárány, Nabil H. Mustafa
2020	J	`jnl`	Theorems of Carathéodory, Helly, and Tverberg Without Dimension. Discret. Comput. Geom. Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa, Tamás Terpai
2019	J	`jnl`	Bounding the Size of an Almost-Equidistant Set in Euclidean Space. Comb. Probab. Comput. Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel
2019	A*	`conf`	Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set. ICALP Nabil H. Mustafa
2019	—	`ed.`	Discrete Geometry for Computer Imagery - 21st IAPR International Conference, DGCI 2019, Marne-la-Vallée, France, March 26-28, 2019, Proceedings DGCI Michel Couprie, Jean Cousty, Yukiko Kenmochi, Nabil H. Mustafa
2019	—	`conf`	Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint. APPROX-RANDOM Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa
2019	J	`jnl`	On a Problem of Danzer. Comb. Probab. Comput. Nabil H. Mustafa, Saurabh Ray
2019	J	`jnl`	Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. Discret. Comput. Geom. Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa
2019	A*	`conf`	Theorems of Carathéodory, Helly, and Tverberg without dimension. SODA Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa
2019	J	`jnl`	Tight Lower Bounds on the VC-dimension of Geometric Set Systems. J. Mach. Learn. Res. Mónika Csikós, Nabil H. Mustafa, Andrey Kupavskii
2018	J	`jnl`	A Simple Proof of Optimal Epsilon Nets. Comb. Nabil H. Mustafa, Kunal Dutta, Arijit Ghosh
2018	J	`jnl`	Integer and Mixed Integer Tverberg Numbers. CoRR Jesús A. De Loera, Thomas A. Hogan, Frédéric Meunier, Nabil H. Mustafa
2018	A	`conf`	On a Problem of Danzer. ESA Nabil H. Mustafa, Saurabh Ray
2018	J	`jnl`	Optimal Bounds on the VC-dimension. CoRR Mónika Csikós, Andrey Kupavskii, Nabil H. Mustafa
2018	A*	`conf`	Optimality of Geometric Local Search. SoCG Bruno Jartoux, Nabil H. Mustafa
2018	J	`jnl`	Practical and efficient algorithms for the geometric hitting set problem. Discret. Appl. Math. Norbert Bus, Nabil H. Mustafa, Saurabh Ray
2018	J	`jnl`	Theorems of Carathéodory, Helly, and Tverberg without dimension. CoRR Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa
2018	—	`conf`	Visibility based WSPD for Global Illumination. VISIGRAPP (1: GRAPP) Maxime Maria, Nabil H. Mustafa, Thomas Bardoux, Jérémie Defaye, Venceslas Biri
2017	J	`jnl`	Bounding the size of an almost-equidistant set in Euclidean space. CoRR Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel
2017	A	`conf`	Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. ESA Daniel Antunes, Claire Mathieu, Nabil H. Mustafa
2017	J	`jnl`	Epsilon-approximations and epsilon-nets. CoRR Nabil H. Mustafa, Kasturi R. Varadarajan
2017	J	`jnl`	Limits of Local Search: Quality and Efficiency. Discret. Comput. Geom. Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
2017	A*	`conf`	Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. SoCG Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa
2017	J	`jnl`	The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg. CoRR Jesús A. De Loera, Xavier Goaoc, Frédéric Meunier, Nabil H. Mustafa
2017	J	`jnl`	ε -Mnets: Hitting Geometric Set Systems with Subsets. Discret. Comput. Geom. Nabil H. Mustafa, Saurabh Ray
2016	J	`jnl`	A Simple Proof of the Shallow Packing Lemma. Discret. Comput. Geom. Nabil H. Mustafa
2016	J	`jnl`	An optimal generalization of the Colorful Carathéodory theorem. Discret. Math. Nabil H. Mustafa, Saurabh Ray
2016	A*	`conf`	New Lower Bounds for epsilon-Nets. SoCG Andrey Kupavskii, Nabil H. Mustafa, János Pach
2016	J	`jnl`	On the Zarankiewicz problem for intersection hypergraphs. J. Comb. Theory A Nabil H. Mustafa, János Pach
2016	J	`jnl`	Tighter estimates for ϵ-nets for disks. Comput. Geom. Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
2015	J	`jnl`	A Note on the Size-Sensitive Packing Lemma. CoRR Nabil H. Mustafa
2015	A	`conf`	Geometric Hitting Sets for Disks: Theory and Practice. ESA Norbert Bus, Nabil H. Mustafa, Saurabh Ray
2015	J	`jnl`	Global Illumination Using Well-Separated Pair Decomposition. Comput. Graph. Forum Norbert Bus, Nabil H. Mustafa, Venceslas Biri
2015	J	`jnl`	IlluminationCut. Comput. Graph. Forum Norbert Bus, Nabil H. Mustafa, Venceslas Biri
2015	A	`conf`	Improved Local Search for Geometric Hitting Set. STACS Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
2015	A	`conf`	On the Zarankiewicz Problem for Intersection Hypergraphs. GD Nabil H. Mustafa, János Pach
2015	J	`jnl`	Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces. SIAM J. Comput. Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
2015	J	`jnl`	Tighter Estimates for epsilon-nets for Disks. CoRR Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
2015	J	`jnl`	k-Centerpoints Conjectures for Pointsets in ℝd. Int. J. Comput. Geom. Appl. Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
2014	—	`conf`	A Separator Theorem for Intersecting Objects in the Plane. CCCG Nabil H. Mustafa, Rajiv Raman
2014	J	`jnl`	A proof of the Oja depth conjecture in the plane. Comput. Geom. Nabil H. Mustafa, Hans Raj Tiwary, Daniel Werner
2014	A	`conf`	Near-Optimal Generalisations of a Theorem of Macbeath. STACS Nabil H. Mustafa, Saurabh Ray
2014	J	`jnl`	QPTAS for Geometric Set-Cover Problems via Optimal Separators. CoRR Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
2014	A*	`conf`	Settling the APX-Hardness Status for Geometric Set Cover. FOCS Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
2013	—	`book`	Approximations of Points: Combinatorics and Algorithms. Nabil H. Mustafa
2012	—	`conf`	A theorem of bárány revisited and extended. SCG Nabil H. Mustafa, Saurabh Ray
2011	A	`conf`	Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane. ESA Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
2010	J	`jnl`	Centerpoints and Tverberg's technique. Comput. Geom. Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza
2010	J	`jnl`	Hitting Simplices with Points in R Discret. Comput. Geom. Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza
2010	J	`jnl`	Improved Results on Geometric Hitting Set Problems. Discret. Comput. Geom. Nabil H. Mustafa, Saurabh Ray
2010	—	`conf`	Improving the first selection lemma in R SCG Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza
2010	J	`jnl`	Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. Comput. Geom. Nabil H. Mustafa, Saurabh Ray
2009	J	`jnl`	An optimal extension of the centerpoint theorem. Comput. Geom. Nabil H. Mustafa, Saurabh Ray
2009	—	`conf`	PTAS for geometric hitting set problems via local search. SCG Nabil H. Mustafa, Saurabh Ray
2008	J	`jnl`	Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. Comput. Geom. Nabil H. Mustafa, Saurabh Ray
2007	—	`conf`	An optimal generalization of the centerpoint theorem, and its extensions. SCG Saurabh Ray, Nabil H. Mustafa
2007	J	`jnl`	Fast Molecular Shape Matching Using Contact Maps. J. Comput. Biol. Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
2007	—	`conf`	Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension. SCG Saurabh Ray, Nabil H. Mustafa
2006	A	`conf`	Conflict-Free Colorings of Rectangles Ranges. STACS Khaled M. Elbassioni, Nabil H. Mustafa
2006	J	`jnl`	Dynamic simplification and visualization of large maps. Int. J. Geogr. Inf. Sci. Nabil H. Mustafa, Shankar Krishnan, Gokul Varadhan, Suresh Venkatasubramanian
2006	J	`jnl`	Independent set of intersection graphs of convex objects in 2D. Comput. Geom. Pankaj K. Agarwal, Nabil H. Mustafa
2005	A*	`conf`	Approximation Algorithms for Euclidean Group TSP. ICALP Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters
2005	J	`jnl`	Near-Linear Time Approximation Algorithms for Curve Simplification. Algorithmica Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang
2004	J	`jnl`	A Conjecture on Wiener Indices in Combinatorial Chemistry. Algorithmica Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa
2004	—	`conf`	Independent Set of Intersection Graphs of Convex Objects in 2D. SWAT Pankaj K. Agarwal, Nabil H. Mustafa
2004	J	`jnl`	Listen to Your Neighbors: How (Not) to Reach a Consensus. SIAM J. Discret. Math. Nabil H. Mustafa, Aleksandar Sasa Pekec
2004	A*	`conf`	k-Means Projective Clustering. PODS Pankaj K. Agarwal, Nabil H. Mustafa
2003	Misc	`conf`	On a Conjecture on Wiener Indices in Combinatorial Chemistry. COCOON Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa
2003	—	`conf`	Statistical data depth and the graphics hardware. Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications Suresh Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian
2003	A	`conf`	Streaming Geometric Optimization Using Graphics Hardware. ESA Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian
2002	A*	`conf`	Hardware-assisted computation of depth contours. SODA Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian
2002	A	`conf`	Near-Linear Time Approximation Algorithms for Curve Simplification. ESA Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang
2001	—	`conf`	Hardware-assisted view-dependent map simplification. SCG Nabil H. Mustafa, Eleftherios Koutsofios, Shankar Krishnan, Suresh Venkatasubramanian
2001	A*	`conf`	Majority Consensus and the Local Majority Rule. ICALP Nabil H. Mustafa, Aleksandar Sasa Pekec