Theo dõi
Emilio Di Giacomo
Emilio Di Giacomo
Associate Professor, University of Perugia, Italy
Email được xác minh tại unipg.it - Trang chủ
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
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
1072007
Curve-constrained drawings of planar graphs
E Di Giacomo, W Didimo, G Liotta, SK Wismath
Computational Geometry 30 (1), 1-23, 2005
762005
Fan-planarity: Properties and complexity
C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ...
Theoretical Computer Science 589, 76-86, 2015
572015
Simultaneous embedding of outerplanar graphs, paths, and cycles
E Di Giacomo, G Liotta
International Journal of Computational Geometry & Applications 17 (02), 139-160, 2007
522007
Drawing colored graphs on colored points
M Badent, E Di Giacomo, G Liotta
Theoretical Computer Science 408 (2-3), 129-142, 2008
482008
Designing the content analyzer of a travel recommender system
C Binucci, F De Luca, E Di Giacomo, G Liotta, F Montecchiani
Expert Systems with Applications 87, 199-208, 2017
442017
Book embeddability of series–parallel digraphs
E Di Giacomo, W Didimo, G Liotta, SK Wismath
Algorithmica 45, 531-547, 2006
442006
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
432005
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, 565-575, 2011
412011
2-layer right angle crossing drawings
E Di Giacomo, W Didimo, P Eades, G Liotta
Algorithmica 68 (4), 954-997, 2014
382014
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
362006
Ortho-polygon visibility representations of embedded graphs
E Di Giacomo, W Didimo, WS Evans, G Liotta, H Meijer, F Montecchiani, ...
Algorithmica 80, 2345-2383, 2018
322018
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
322013
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
312010
Drawing series-parallel graphs on a box
E Di Giacomo, G Liotta, SK Wismath
Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG …, 2002
312002
Homothetic Triangle Contact Representations of Planar Graphs.
M Badent, C Binucci, E Di Giacomo, W Didimo, S Felsner, F Giordano, ...
CCCG, 233-236, 2007
282007
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
252010
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
252009
Area, curve complexity, and crossing resolution of non-planar graph drawings
E Di Giacomo, W Didimo, G Liotta, H Meijer
Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA …, 2010
242010
Upward book embeddings of st-graphs
C Binucci, G Da Lozzo, E Di Giacomo, W Didimo, T Mchedlidze, ...
arXiv preprint arXiv:1903.07966, 2019
232019
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20