The following pages link to Nabil H. Mustafa (Q265721):
Displaying 50 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- On the Zarankiewicz problem for intersection hypergraphs (Q272311) (← links)
- A simple proof of the shallow packing lemma (Q282762) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets (Q527442) (← links)
- Hitting simplices with points in \(\mathbb R^{3}\) (Q603863) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- Near-linear time approximation algorithms for curve simplification (Q818650) (← links)
- An optimal generalization of the colorful Carathéodory theorem (Q906475) (← links)
- An optimal extension of the centerpoint theorem (Q924064) (← links)
- Reprint of: Weak \(\varepsilon\)-nets have basis of size \(O(1/{\epsilon}\log (1/\epsilon))\) in any dimension (Q982945) (← links)
- Centerpoints and Tverberg's technique (Q982949) (← links)
- Practical and efficient algorithms for the geometric hitting set problem (Q1707909) (← links)
- A simple proof of optimal epsilon nets (Q1715082) (← links)
- A conjecture on Wiener indices in combinatorial chemistry (Q1882529) (← links)
- A tight analysis of geometric local search (Q2117344) (← links)
- Optimal approximations made easy (Q2122796) (← links)
- Theorems of Carathéodory, Helly, and Tverberg without dimension (Q2197682) (← links)
- An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets (Q2206734) (← links)
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning (Q2415378) (← links)
- A proof of the Oja depth conjecture in the plane (Q2450202) (← links)
- Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension (Q2479477) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- A theorem of bárány revisited and extended (Q2874594) (← links)
- (Q2954994) (← links)
- On the Zarankiewicz Problem for Intersection Hypergraphs (Q2959758) (← links)
- (Q2965518) (← links)
- On a Conjecture on Wiener Indices in Combinatorial Chemistry (Q3082958) (← links)
- Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane (Q3092256) (← links)
- New Lower Bounds for ϵ-nets (Q3132890) (← links)
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
- Geometric Hitting Sets for Disks: Theory and Practice (Q3452850) (← links)
- k-Centerpoints Conjectures for Pointsets in ℝd (Q3459046) (← links)
- An optimal generalization of the centerpoint theorem, and its extensions (Q3602869) (← links)
- Weak ε-nets have basis of size o(1/ε log (1/ε)) in any dimension (Q3602880) (← links)
- (Q4411343) (← links)
- (Q4535045) (← links)
- (Q4580113) (← links)
- Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems (Q4604388) (← links)
- Listen to Your Neighbors: How (Not) to Reach a Consensus (Q4652613) (← links)
- (Q4828983) (← links)
- Tverberg theorems over discrete sets of points (Q4998740) (← links)
- On a problem of Danzer (Q5009631) (← links)
- Sampling in Combinatorial and Geometric Set Systems (Q5033061) (← links)
- (Q5091247) (← links)
- (Q5111691) (← links)
- (Q5115816) (← links)
- Bounding the Size of an Almost-Equidistant Set in Euclidean Space (Q5219320) (← links)
- On a Problem of Danzer (Q5222544) (← links)
- Theorems of Carathéodory, Helly, and Tverberg without dimension (Q5236330) (← links)
