Dan Ismailescu

19 papers B 1Journal 18
YearRankTypeTitle / Venue / Authors
2023 J jnl
On the smallest area (n-1)-gon containing a convex n-gon.
Period. Math. Hung.
David E. Hong, Dan Ismailescu, Alex Kwak, Grace Y. Park
2020 J jnl
The Chromatic Number of the Plane is At Least 5: A New Proof.
Discret. Comput. Geom.
Geoffrey Exoo, Dan Ismailescu
2019 J jnl
On Second-Order Linear Sequences of Composite Numbers.
J. Integer Seq.
Dan Ismailescu, Adrienne Ko, Celine Lee, Jae Yong Park
2014 J jnl
A New Kind of Fibonacci-Like Sequence of Composite Numbers.
J. Integer Seq.
Dan Ismailescu, Jaesung Son
2014 J jnl
Improved upper bounds for the Steiner ratio.
Discret. Optim.
Dan Ismailescu, Joseph Park
2014 J jnl
On Numbers That Cannot be Expressed as a Plus-Minus Weighted Sum of a Fibonacci Number and a Prime.
Integers
Dan Ismailescu, Peter C. Shim
2014 J jnl
On the Chromatic Number of ℝ
Discret. Comput. Geom.
Geoffrey Exoo, Dan Ismailescu, Michael Lim
2014 J jnl
Packing and Covering with Centrally Symmetric Convex Disks.
Discret. Comput. Geom.
Dan Ismailescu, Brian Kim
2009 J jnl
Circumscribed Polygons of Small Area.
Discret. Comput. Geom.
Dan Ismailescu
2008 J jnl
Illuminating a convex polygon with vertex lights.
Period. Math. Hung.
Dan Ismailescu
2007 J jnl
On simultaneous planar graph embeddings.
Comput. Geom.
Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell
2006 J jnl
On Sequences of Nested Triangles.
Period. Math. Hung.
Dan Ismailescu, Jacqueline Jacobs
2004 J jnl
A dense planar point set from iterated line intersections.
Comput. Geom.
Dan Ismailescu, Rados Radoicic
2003 B conf
On Simultaneous Planar Graph Embeddings.
WADS
Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell
2003 J jnl
Slicing the Pie.
Discret. Comput. Geom.
Dan Ismailescu
2002 J jnl
Minimizer graphs for a class of extremal problems.
J. Graph Theory
Dan Ismailescu, Dan Stefanica
2002 J jnl
Restricted Point Configurations with Many Collinear {k}-Tuplets.
Discret. Comput. Geom.
Dan Ismailescu
2001 J jnl
Inequalities between Lattice Packing and Covering Densities of Centrally Symmetric Plane Convex Bodies.
Discret. Comput. Geom.
Dan Ismailescu
1998 J jnl
Covering the Plane with Copies of a Convex Disk.
Discret. Comput. Geom.
Dan Ismailescu