Dan Ismailescu, Ph.D.
Affiliations: | 2001 | New York University, New York, NY, United States |
Area:
MathematicsGoogle:
"Dan Ismailescu"Parents
Sign in to add mentor| Janos Pach | grad student | 2001 | NYU | |
| (Efficient packing and covering and other extremal problems in geometry.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Exoo G, Ismailescu D. (2020) The chromatic number of the plane is at least 5 - a new proof Discrete and Computational Geometry. 64: 216-226 |
| Ismailescu D, Jones L, Phillips T. (2017) Primefree shifted Lucas sequences of the second kind Journal of Number Theory. 173: 87-99 |
| Ismailescu D, Park J. (2014) Improved upper bounds for the Steiner ratio Discrete Optimization. 11: 22-30 |
| Exoo G, Ismailescu D, Lim M. (2014) On the Chromatic Number of ℝ4 Discrete and Computational Geometry. 52: 416-423 |
| Ismailescu D, Kim B. (2014) Packing and Covering with Centrally Symmetric Convex Disks Discrete and Computational Geometry. 51: 495-508 |
| Ismailescu D. (2008) Illuminating a convex polygon with vertex lights Periodica Mathematica Hungarica. 57: 177-184 |
| Ismailescu D, Radoičić R. (2004) A dense planar point set from iterated line intersections Computational Geometry: Theory and Applications. 27: 257-267 |
| Ismailescu D. (2003) Slicing the Pie Discrete and Computational Geometry. 30: 263-276 |
| Ismailescu D, Stefanica D. (2002) Minimizer graphs for a class of extremal problems Journal of Graph Theory. 39: 230-240 |
| Ismailescu D. (2001) Inequalities between lattice packing and covering densities of centrally symmetric plane convex bodies Discrete and Computational Geometry. 25: 365-388 |