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
Hilfe
Suche: Author="di Battista, Giuseppe"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The importance of being proper: (In clustered-level planarity and
T
-level planarity)
Patrizio Angelini
,
Giordano Da Lozzo
,
Giuseppe Di Battista
,
Fabrizio Frati
,
Vincenzo Roselli
Theoretical Computer Science
571
, 2015, pp. 1-9
Anchored drawings of planar graphs
Patrizio Angelini
,
Giordano Da Lozzo
,
Marco Di Bartolomeo
,
Giuseppe Di Battista
,
Seok-Hee Hong
,
Maurizio Patrignani
,
Vincenzo Roselli
Lecture Notes in Computer Science
8871
, 2014, pp. 404-415
Morphing planar graph drawings optimally
Patrizio Angelini
,
Giordano Da Lozzo
,
Giuseppe Di Battista
,
Fabrizio Frati
,
Maurizio Patrignani
,
Vincenzo Roselli
Lecture Notes in Computer Science
8572
, 2014, pp. 126-137
The importance of being proper (in clustered-level planarity and
T
-level planarity)
Patrizio Angelini
,
Giordano Da Lozzo
,
Giuseppe Di Battista
,
Fabrizio Frati
,
Vincenzo Roselli
Lecture Notes in Computer Science
8871
, 2014, pp. 246-258
Advances on testing
c
-planarity of embedded flat clustered graphs
Markus Chimani
,
Giuseppe Di Battista
,
Fabrizio Frati
,
Karsten Klein
Lecture Notes in Computer Science
8871
, 2014, pp. 416-427
Topological morphing of planar graphs
Patrizio Angelini
,
Pier Francesco Cortese
,
Giuseppe Di Battista
,
Maurizio Patrignani
Theoretical Computer Science
514
, 2013, pp. 2-20
Strip planarity testing
Patrizio Angelini
,
Giordano Da Lozzo
,
Giuseppe Di Battista
,
Fabrizio Frati
Lecture Notes in Computer Science
8242
, 2013, pp. 37-48
Implementing a partitioned 2-page book embedding testing algorithm
Patrizio Angelini
,
Marco Di Bartolomeo
,
Giuseppe Di Battista
Lecture Notes in Computer Science
7704
, 2013, pp. 79-89
Dynamic traceroute visualization at multiple abstraction levels
Massimo Candela
,
Marco Di Bartolomeo
,
Giuseppe Di Battista
,
Claudio Squarcella
Lecture Notes in Computer Science
8242
, 2013, pp. 496-507
On the queue number of planar graphs
Giuseppe Di Battista
,
Fabrizio Frati
,
János Pach
SIAM Journal on Computing
42
(6), 2013, pp. 2243-2285
Succinct greedy drawings do not always exist
Patrizio Angelini
,
Giuseppe Di Battista
,
Fabrizio Frati
Networks
59
(3), 2012, pp. 267-274
Small point sets for simply-nested planar graphs
Patrizio Angelini
,
Giuseppe Di Battista
,
Michael Kaufmann
,
Tamara Mchedlidze
,
Vincenzo Roselli
,
Claudio Squarcella
Lecture Notes in Computer Science
7034
, 2012, pp. 75-85
Drawing trees in a streaming model
Carla Binucci
,
Ulrik Brandes
,
Giuseppe Di Battista
,
Walter Didimo
,
Marco Gaertler
,
Pietro Palladino
,
Maurizio Patrignani
,
Antonios Symvonis
,
Katharina Zweig
Information Processing Letters
112
(11), 2012, pp. 418-422
Computational complexity of traffic hijacking under BGP and S-BGP
Marco Chiesa
,
Giuseppe Di Battista
,
Thomas Erlebach
,
Maurizio Patrignani
Lecture Notes in Computer Science
7392
, 2012, pp. 476-487
Nonconvex representations of plane graphs
Giuseppe Di Battista
,
Fabrizio Frati
,
Maurizio Patrignani
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1670-1681
How to visualize the K-root name server (demo)
Giuseppe Di Battista
,
Claudio Squarcella
,
Wolfgang Nagele
Lecture Notes in Computer Science
7034
, 2012, pp. 191-202
Monotone drawings of graphs
Patrizio Angelini
,
Enrico Colasante
,
Giuseppe Di Battista
,
Fabrizio Frati
,
Maurizio Patrignani
Lecture Notes in Computer Science
6502
, 2011, pp. 13-24
Simultaneous embedding of embedded planar graphs
Patrizio Angelini
,
Giuseppe Di Battista
,
Fabrizio Frati
Lecture Notes in Computer Science
7074
, 2011, pp. 271-280
Finding a minimum-depth embedding of a planar graph in
O(n^4)
time
Patrizio Angelini
,
Giuseppe Di Battista
,
Maurizio Patrignani
Algorithmica
60
(4), 2011, pp. 890-937
Drawing graphs on a smartphone
Giordano Da Lozzo
,
Giuseppe Di Battista
,
Francesco Ingrassia
Lecture Notes in Computer Science
6502
, 2011, pp. 153-164
On the perspectives opened by right angle crossing drawings
Patrizio Angelini
,
Luca Cittadini
,
Giuseppe Di Battista
,
Walter Didimo
,
Fabrizio Frati
,
Michael Kaufmann
,
Antonios Symvonis
Lecture Notes in Computer Science
5849
, 2010, pp. 21-32
Succinct greedy drawings do not always exist
Patrizio Angelini
,
Giuseppe Di Battista
,
Fabrizio Frati
Lecture Notes in Computer Science
5849
, 2010, pp. 171-182
Drawing trees in a streaming model
Carla Binucci
,
Ulrik Brandes
,
Giuseppe Di Battista
,
Walter Didimo
,
Marco Gaertler
,
Pietro Palladino
,
Maurizio Patrignani
,
Antonios Symvonis
,
Katharina Zweig
Lecture Notes in Computer Science
5849
, 2010, pp. 292-303
Topological morphing of planar graphs
Patrizio Angelini
,
Pier Francesco Cortese
,
Giuseppe Di Battista
,
Maurizio Patrignani
Lecture Notes in Computer Science
5417
, 2009, pp. 145-156
Policy-aware visualization of Internet dynamics
Luca Cittadini
,
Tiziana Refice
,
Alessio Campisano
,
Giuseppe Di Battista
,
Claudio Sasso
Lecture Notes in Computer Science
5417
, 2009, pp. 435-436
Seiten 1
2
3
4
5
6
>