Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Di Giacomo, Emilio"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fan-planar graphs: Combinatorial properties and complexity results
Carla Binucci
,
Emilio Di Giacomo
,
Walter Didimo
,
Fabrizio Montecchiani
,
Maurizio Patrignani
,
Ioannis G. Tollis
Lecture Notes in Computer Science
8871
, 2014, pp. 186-197
Planar and quasi planar simultaneous geometric embedding
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
,
Stephen Wismath
Lecture Notes in Computer Science
8871
, 2014, pp. 52-63
Drawing outer 1-planar graphs with few slopes
Emilio Di Giacomo
,
Giuseppe Liotta
,
Fabrizio Montecchiani
Lecture Notes in Computer Science
8871
, 2014, pp. 174-185
Exploring complex drawings via edge stratification
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Fabrizio Montecchiani
,
Ioannis G. Tollis
Lecture Notes in Computer Science
8242
, 2013, pp. 304-315
Lower and upper bounds for long induced paths in 3-connected planar graphs
Emilio Di Giacomo
,
Giuseppe Liotta
,
Tamara Mchedlidze
Lecture Notes in Computer Science
8165
, 2013, pp. 213-224
The approximate rectangle of influence drawability problem
Emilio Di Giacomo
,
Giuseppe Liotta
,
Henk Meijer
Lecture Notes in Computer Science
7704
, 2013, pp. 114-125
Drawing a tree as a minimum spanning tree approximation
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
Journal of Computer and System Sciences
78
(2), 2012, pp. 491-503
h
-quasi planar drawings of bounded treewidth graphs in linear area
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Fabrizio Montecchiani
Lecture Notes in Computer Science
7551
, 2012, pp. 91-102
h
-quasi planar drawings of bounded treewidth graphs in linear area
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Fabrizio Montecchiani
Lecture Notes in Computer Science
7551
, 2012, pp. 91-102
Orthogeodesic point-set embedding of trees
Emilio Di Giacomo
,
Fabrizio Frati
,
Radoslav Fulek
,
Luca Grilli
,
Marcus Krug
Lecture Notes in Computer Science
7034
, 2012, pp. 52-63
Area, curve complexity, and crossing resolution of non-planar graph drawings
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
Theory of Computing Systems
49
(3), 2011, pp. 565-575
Upward topological book embeddings of DAGs
Emilio Di Giacomo
,
Francesco Giordano
,
Giuseppe Liotta
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 479-489
Area, curve complexity, and crossing resolution of non-planar graph drawings
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
Lecture Notes in Computer Science
5849
, 2010, pp. 15-20
Drawing a tree as a minimum spanning tree approximation
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
Lecture Notes in Computer Science
6507
, 2010, pp. 61-72
Drawing colored graphs with constrained vertex positions and few bends per edge
Emilio Di Giacomo
,
Giuseppe Liotta
,
Francesco Trotta
Algorithmica
57
(4), 2010, pp. 796-818
Constrained point-set embeddability of planar graphs
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
,
Stephen Wismath
Lecture Notes in Computer Science
5417
, 2009, pp. 360-371
Visual analysis of one-to-many matched graphs
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Pietro Palladino
Lecture Notes in Computer Science
5417
, 2009, pp. 133-144
Drawing colored graphs on colored points
Melanie Badent
,
Emilio Di Giacomo
,
Giuseppe Liotta
Theoretical Computer Science
408
(2-3), 2008, pp. 129-142
Point-set embedding of trees with edge constraints
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
,
Stephen Wismath
Lecture Notes in Computer Science
4875
, 2008, pp. 113-124
Matched drawings of planar graphs
Emilio Di Giacomo
,
Walter Didimo
,
Marc van Kreveld
,
Giuseppe Liotta
,
Bettina Speckmann
Lecture Notes in Computer Science
4875
, 2008, pp. 183-194
Drawing colored graphs with constrained vertex positions and few bends per edge
Emilio Di Giacomo
,
Giuseppe Liotta
,
Francesco Trotta
Lecture Notes in Computer Science
4875
, 2008, pp. 315-326
Drawing colored graphs on colored points
Melanie Badent
,
Emilio Di Giacomo
,
Giuseppe Liotta
Lecture Notes in Computer Science
4619
, 2007, pp. 102-113
k
-colored point-set embeddability of outerplanar graphs
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
,
Francesco Trotta
,
Stephen K. Wismath
Lecture Notes in Computer Science
4372
, 2007, pp. 318-329
Radial drawings of graphs: Geometric constraints and trade-offs
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
Lecture Notes in Computer Science
4372
, 2007, pp. 355-366
Drawing bipartite graphs on two curves
Emilio Di Giacomo
,
Luca Grilli
,
Giuseppe Liotta
Lecture Notes in Computer Science
4372
, 2007, pp. 380-385
Seiten 1
2
>