Dan Ismailescu

According to our database, Dan Ismailescu authored at least 18 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the smallest area (n-1)-gon containing a convex n-gon.

David E. Hong, Dan Ismailescu, Alex Kwak, Grace Y. Park

Period. Math. Hung., December, 2023

2020

The Chromatic Number of the Plane is At Least 5: A New Proof.

Geoffrey Exoo, Dan Ismailescu

Discret. Comput. Geom., 2020

2019

On Second-Order Linear Sequences of Composite Numbers.

Dan Ismailescu, Adrienne Ko, Celine Lee, Jae Yong Park

J. Integer Seq., 2019

2014

A New Kind of Fibonacci-Like Sequence of Composite Numbers.

Dan Ismailescu, Jaesung Son

J. Integer Seq., 2014

On Numbers That Cannot be Expressed as a Plus-Minus Weighted Sum of a Fibonacci Number and a Prime.

Dan Ismailescu, Peter C. Shim

Integers, 2014

Improved upper bounds for the Steiner ratio.

Dan Ismailescu, Joseph Park

Discret. Optim., 2014

Packing and Covering with Centrally Symmetric Convex Disks.

Dan Ismailescu, Brian Kim

Discret. Comput. Geom., 2014

On the Chromatic Number of ℝ⁴.

Geoffrey Exoo, Dan Ismailescu, Michael Lim

Discret. Comput. Geom., 2014

2009

Circumscribed Polygons of Small Area.

Dan Ismailescu

Discret. Comput. Geom., 2009

2008

Illuminating a convex polygon with vertex lights.

Dan Ismailescu

Period. Math. Hung., 2008

2007

On simultaneous planar graph embeddings.

Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell

Comput. Geom., 2007

2006

On Sequences of Nested Triangles.

Dan Ismailescu, Jacqueline Jacobs

Period. Math. Hung., 2006

2004

A dense planar point set from iterated line intersections.

Dan Ismailescu, Rados Radoicic

Comput. Geom., 2004

2003

Slicing the Pie.

Dan Ismailescu

Discret. Comput. Geom., 2003

2002

Minimizer graphs for a class of extremal problems.

Dan Ismailescu, Dan Stefanica

J. Graph Theory, 2002

Restricted Point Configurations with Many Collinear {k}-Tuplets.

Dan Ismailescu

Discret. Comput. Geom., 2002

2001

Inequalities between Lattice Packing and Covering Densities of Centrally Symmetric Plane Convex Bodies.

Dan Ismailescu

Discret. Comput. Geom., 2001

1998

Covering the Plane with Copies of a Convex Disk.

Dan Ismailescu

Discret. Comput. Geom., 1998