Emilio Di Giacomo
Emilio Di Giacomo
Associate Professor, University of Perugia, Italy
Vahvistettu sähköpostiosoite verkkotunnuksessa unipg.it - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Graph visualization techniques for web clustering engines
E Di Giacomo, W Didimo, L Grilli, G Liotta
IEEE Transactions on Visualization and Computer Graphics 13 (2), 294-304, 2007
952007
Assistive technology assessment handbook
S Federici, M Scherer
CRC press, 2012
932012
Curve-constrained drawings of planar graphs
E Di Giacomo, W Didimo, G Liotta, SK Wismath
Computational Geometry 30 (1), 1-23, 2005
642005
Drawing colored graphs on colored points
M Badent, E Di Giacomo, G Liotta
Theoretical Computer Science 408 (2-3), 129-142, 2008
412008
Simultaneous embedding of outerplanar graphs, paths, and cycles
E Di Giacomo, G Liotta
International Journal of Computational Geometry & Applications 17 (02), 139-160, 2007
402007
On embedding a graph on two sets of points
E Di Giacomo, G Liotta, F Trotta
International Journal of Foundations of Computer Science 17 (05), 1071-1094, 2006
332006
Fan-planarity: Properties and complexity
C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ...
Theoretical Computer Science 589, 76-86, 2015
322015
Area, curve complexity, and crossing resolution of non-planar graph drawings
E Di Giacomo, W Didimo, G Liotta, H Meijer
Theory of Computing Systems 49 (3), 565-575, 2011
302011
2-layer right angle crossing drawings
E Di Giacomo, W Didimo, P Eades, G Liotta
Algorithmica 68 (4), 954-997, 2014
272014
Book embeddability of series–parallel digraphs
E Di Giacomo, W Didimo, G Liotta, SK Wismath
Algorithmica 45 (4), 531-547, 2006
272006
Drawing series-parallel graphs on a box
ED Giacomo, G Liotta, S Wismath
Proc. 14th Canadian Conf. on Computational Geometry (CCCG 2002), 149-153, 2002
272002
Computing straight-line 3D grid drawings of graphs in linear volume
E Di Giacomo, G Liotta, H Meijer
Computational Geometry 32 (1), 26-58, 2005
262005
Area requirement of graph drawings with few crossings per edge
E Di Giacomo, W Didimo, G Liotta, F Montecchiani
Computational Geometry 46 (8), 909-916, 2013
252013
Homothetic Triangle Contact Representations of Planar Graphs.
M Badent, C Binucci, E Di Giacomo, W Didimo, S Felsner, F Giordano, ...
CCCG, 233-236, 2007
252007
Upward straight-line embeddings of directed graphs into point sets
C Binucci, E Di Giacomo, W Didimo, A Estrella-Balderrama, F Frati, ...
Computational Geometry 43 (2), 219-232, 2010
242010
Drawing colored graphs with constrained vertex positions and few bends per edge
E Di Giacomo, G Liotta, F Trotta
Algorithmica 57 (4), 796-818, 2010
212010
Area, curve complexity, and crossing resolution of non-planar graph drawings
E Di Giacomo, W Didimo, G Liotta, H Meijer
International Symposium on Graph Drawing, 15-20, 2009
212009
Ortho-polygon visibility representations of embedded graphs
E Di Giacomo, W Didimo, WS Evans, G Liotta, H Meijer, F Montecchiani, ...
Algorithmica 80 (8), 2345-2383, 2018
202018
Orthogeodesic point-set embedding of trees
E Di Giacomo, F Frati, R Fulek, L Grilli, M Krug
Computational Geometry 46 (8), 929-944, 2013
202013
Point-set embeddings of trees with given partial drawings
E Di Giacomo, W Didimo, G Liotta, H Meijer, SK Wismath
Computational Geometry 42 (6-7), 664-676, 2009
202009
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20