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="Marino, Andrea"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games
Michele Borassi
,
Pierluigi Crescenzi
,
Michel Habib
,
Walter A. Kosters
,
Andrea Marino
,
Frank W. Takes
Theoretical Computer Science
586
, 2015, pp. 59-80
On computing the diameter of real-world undirected graphs
Pilu Crescenzi
,
Roberto Grossi
,
Michel Habib
,
Leonardo Lanzi
,
Andrea Marino
Theoretical Computer Science
514
, 2013, pp. 84-95
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets
Vicente Acuña
,
Etienne Birmelé
,
Ludovic Cottret
,
Pierluigi Crescenzi
,
Fabien Jourdan
,
Vincent Lacroix
,
Alberto Marchetti-Spaccamela
,
Andrea Marino
,
Paulo Vieira Milreu
,
Marie-France Sagot
,
Leen Stougie
Theoretical Computer Science
457
, 2012, pp. 1-9
Smooth movement and Manhattan path based Random Waypoint mobility
Pilu Crescenzi
,
Miriam Di Ianni
,
Andrea Marino
,
Donatella Merlini
,
Gianluca Rossi
,
Paola Vocca
Information Processing Letters
111
(5), 2011, pp. 239-246
Finding the diameter in real-world graphs: Experimentally turning a lower bound into an upper bound
Pierluigi Crescenzi
,
Roberto Grossi
,
Claudio Imbrenda
,
Leonardo Lanzi
,
Andrea Marino
Lecture Notes in Computer Science
6346
, 2010, pp. 302-313