Dan Ismailescu

Orcid: 0000-0002-5566-5080

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On the smallest area (n-1)-gon containing a convex n-gon.
Period. Math. Hung., December, 2023

2020
The Chromatic Number of the Plane is At Least 5: A New Proof.
Discret. Comput. Geom., 2020

2019
On Second-Order Linear Sequences of Composite Numbers.
J. Integer Seq., 2019

2014
A New Kind of Fibonacci-Like Sequence of Composite Numbers.
J. Integer Seq., 2014

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

Improved upper bounds for the Steiner ratio.
Discret. Optim., 2014

Packing and Covering with Centrally Symmetric Convex Disks.
Discret. Comput. Geom., 2014

On the Chromatic Number of ℝ<sup>4</sup>.
Discret. Comput. Geom., 2014

2009
Circumscribed Polygons of Small Area.
Discret. Comput. Geom., 2009

2008
Illuminating a convex polygon with vertex lights.
Period. Math. Hung., 2008

2006
On Sequences of Nested Triangles.
Period. Math. Hung., 2006

2004
A dense planar point set from iterated line intersections.
Comput. Geom., 2004

2003
Slicing the Pie.
Discret. Comput. Geom., 2003

On Simultaneous Planar Graph Embeddings.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

2002
Minimizer graphs for a class of extremal problems.
J. Graph Theory, 2002

Restricted Point Configurations with Many Collinear {k}-Tuplets.
Discret. Comput. Geom., 2002

2001
Inequalities between Lattice Packing and Covering Densities of Centrally Symmetric Plane Convex Bodies.
Discret. Comput. Geom., 2001

1998
Covering the Plane with Copies of a Convex Disk.
Discret. Comput. Geom., 1998


  Loading...