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="D'Angelo, Gianlorenzo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding disjoint paths in networks with star shared risk link groups
Jean-Claude Bermond
,
David Coudert
,
Gianlorenzo D'Angelo
,
Fatima Zahra Moataz
Theoretical Computer Science
579
, 2015, pp. 74-87
Fully dynamic update of arc-flags
Gianlorenzo D'Angelo
,
Mattia D'Emidio
,
Daniele Frigioni
Networks
63
(3), 2014, pp. 243-259
A loop-free shortest-path routing algorithm for dynamic networks
Gianlorenzo D'Angelo
,
Mattia D'Emidio
,
Daniele Frigioni
Theoretical Computer Science
516
, 2014, pp. 1-19
Engineering a new algorithm for distributed shortest paths on dynamic networks
Serafino Cicerone
,
Gianlorenzo D'Angelo
,
Gabriele Di Stefano
,
Daniele Frigioni
,
Vinicio Maurizio
Algorithmica
66
(1), 2013, pp. 51-86
Minimize the maximum duty in multi-interface networks
Gianlorenzo D'Angelo
,
Gabriele Di Stefano
,
Alfredo Navarra
Algorithmica
63
(1-2), 2012, pp. 274-295
Mixed-criticality scheduling of sporadic task systems
Sanjoy K. Baruah
,
Vincenzo Bonifaci
,
Gianlorenzo D'Angelo
,
Alberto Marchetti-Spaccamela
,
Suzanne van der Ster
,
Leen Stougie
Lecture Notes in Computer Science
6942
, 2011, pp. 555-566
Scheduling real-time mixed-criticality jobs
Sanjoy K. Baruah
,
Vincenzo Bonifaci
,
Gianlorenzo D'Angelo
,
Haohan Li
,
Alberto Marchetti-Spaccamela
,
Nicole Megow
,
Leen Stougie
Lecture Notes in Computer Science
6281
, 2010, pp. 90-101
Partially dynamic efficient algorithms for distributed shortest paths
Serafino Cicerone
,
Gianlorenzo D'Angelo
,
Gabriele Di Stefano
,
Daniele Frigioni
Theoretical Computer Science
411
(7-9), 2010, pp. 1013-1037