Παρακολούθηση
Dan Ismailescu
Dan Ismailescu
Hofstra University
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα hofstra.edu
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
On simultaneous planar graph embeddings
P Brass, E Cenek, CA Duncan, A Efrat, C Erten, DP Ismailescu, ...
Computational Geometry 36 (2), 117-130, 2007
1542007
The chromatic number of the plane is at least 5: a new proof
G Exoo, D Ismailescu
Discrete & Computational Geometry 64 (1), 216-226, 2020
552020
On sequences of nested triangles
D Ismailescu, J Jacobs
Periodica Mathematica Hungarica 53 (1-2), 169-184, 2006
312006
Minimizer graphs for a class of extremal problems
D Ismailescu, D Stefanica
Journal of Graph Theory 39 (4), 230-240, 2002
262002
Packing and covering with centrally symmetric convex disks
D Ismailescu, B Kim
Discrete & Computational Geometry 51, 495-508, 2014
172014
A dense planar point set from iterated line intersections
D Ismailescu, R Radoičić
Computational Geometry 27 (3), 257-267, 2004
142004
On the Chromatic Number of
G Exoo, D Ismailescu, M Lim
Discrete & Computational Geometry 52 (2), 416-423, 2014
132014
Small order triangle-free 4-chromatic unit distance graphs
G Exoo, D Ismailescu
Geombinatorics 26 (2), 49-64, 2016
102016
Inequalities between lattice packing and covering densities of centrally symmetric plane convex bodies
D Ismailescu
Discrete & Computational Geometry 25, 365-388, 2001
102001
Restricted Point Configurations with Many Collinear {k}-Tuplets
Ismailescu
Discrete & Computational Geometry 28, 571-575, 2002
82002
On the chromatic number of Rn for small values of n
G Exoo, D Ismailescu
arXiv preprint arXiv:1408.2002, 2014
72014
Covering the plane with copies of a convex disk
D Ismailescu
Discrete & Computational Geometry 20, 251-263, 1998
71998
A -chromatic two-distance graph in the plane
G Exoo, D Ismailescu
arXiv preprint arXiv:1909.13177, 2019
62019
The Hadwiger-Nelson problem with two forbidden distances
G Exoo, D Ismailescu
arXiv preprint arXiv:1805.06055, 2018
62018
On point sets containing their triangle centers
M Iorio, D Ismailescu, R Radoicic, M Silva
Revue Roumaine de Mathematiques Pures et Appliquees 50 (5-6), 677-694, 2005
62005
On Numbers That Cannot be Expressed as a Plus-Minus Weighted Sum of a Fibonacci Number and a Prime.
D Ismailescu, PC Shim
Integers 14, A65, 2014
52014
Slicing the pie
D Ismailescu
Discrete & Computational Geometry 30, 263-276, 2003
52003
The chromatic number of the Minkowski plane--the regular polygon case
G Exoo, D Fisher, D Ismailescu
arXiv preprint arXiv:2108.12861, 2021
42021
Improved upper bounds for the steiner ratio
D Ismailescu, J Park
Discrete Optimization 11, 22-30, 2014
42014
On pairwise intersections of the Fibonacci, Sierpiński, and Riesel sequences
D Ismailescu, PS Park, G Seongnam-si
J. Integer Seq. 16 (9), 2013
42013
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20