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="Nanni, Umberto"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear time analysis of properties of conflict-free and general Petri nets
Paola Alimonti
,
Esteban Feuerstein
,
Luigi Laura
,
Umberto Nanni
Theoretical Computer Science
412
(4-5), 2011, pp. 320-338
A fully dynamic algorithm for distributed shortest paths
Serafino Cicerone
,
Gabriele Di Stefano
,
Daniele Frigioni
,
Umberto Nanni
Theoretical Computer Science
297
(1-3), 2003, pp. 83-102
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Daniele Frigioni
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Journal of Algorithms
49
(1), 2003, pp. 86-113
Dynamic algorithms for classes of constraint satisfaction problems
Daniele Frigioni
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Theoretical Computer Science
259
(1-2), 2001, pp. 287-305
Fully dynamic algorithms for maintaining shortest paths trees
Daniele Frigioni
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Journal of Algorithms
34
(2), 2000, pp. 251-281
Hypergraph traversal revisited: Cost measures and dynamic algorithms
Giorgio Ausiello
,
Giuseppe F. Italiano
,
Umberto Nanni
Lecture Notes in Computer Science
1450
, 1998, pp. 1-16
A uniform approach to semi-dynamic problems on digraphs
Serafino Cicerone
,
Daniele Frigioni
,
Umberto Nanni
,
Francesco Pugliese
Theoretical Computer Science
203
(1), 1998, pp. 69-90
Multidimensional interval routing schemes
Michele Flammini
,
Giorgio Gambosi
,
Umberto Nanni
,
Richard B. Tan
Theoretical Computer Science
205
(1-2), 1998, pp. 115-133
Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights
Daniele Frigioni
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Lecture Notes in Computer Science
1461
, 1998, pp. 320-331
An experimental study of dynamic algorithms for directed graphs
Daniele Frigioni
,
Tobias Miller
,
Umberto Nanni
,
Giulio Pasqualone
,
Guido Schaefer
,
Christos Zaroliagis
Lecture Notes in Computer Science
1461
, 1998, pp. 368-380
Counting edges in a dag
Serafino Cicerone
,
Daniele Frigioni
,
Umberto Nanni
,
Francesco Pugliese
Lecture Notes in Computer Science
1197
, 1997, pp. 85-100
The incremental maintenance of a depth-first-search tree in directed acyclic graphs
Paolo G. Franciosa
,
Giorgio Gambosi
,
Umberto Nanni
Information Processing Letters
61
(2), 1997, pp. 113-120
Fully dynamic output bounded single source shortest path problem
Daniele Frigioni
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 212-221
Maintaining a topological order under edge insertions
Alberto Marchetti-Spaccamela
,
Umberto Nanni
,
Hans Rohnert
Information Processing Letters
59
(1), 1996, pp. 53-58
Multi-dimensional interval routing schemes
Michele Flammini
,
Giorgio Gambosi
,
Umberto Nanni
,
Richard B. Tan
Lecture Notes in Computer Science
972
, 1995, pp. 131-144
On the structure of
DFS
-forests on directed graphs and the dynamic maintenance of
DFS
on DAG's
Paolo G. Franciosa
,
Giorgio Gambosi
,
Umberto Nanni
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 343-353
Dynamization of backtrack-free search for the constraint satisfaction problem
Daniele Frigioni
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Lecture Notes in Computer Science
778
, 1994, pp. 136-151
Incremental algorithms for the single-source shortest path problem
Daniele Frigioni
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Lecture Notes in Computer Science
880
, 1994, pp. 113-124
On-line graph algorithms for incremental compilation
Alberto Marchetti-Spaccamela
,
Umberto Nanni
,
Hans Rohnert
Lecture Notes in Computer Science
790
, 1993, pp. 70-86
The weighted list update problem and the lazy adversary
Fabrizio d'Amore
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Theoretical Computer Science
108
, 1993, pp. 371-384
Linear time algorithms for liveness and boundedness in conflict-free Petri nets
Paola Alimonti
,
Esteban Feuerstein
,
Umberto Nanni
Lecture Notes in Computer Science
583
, 1992, pp. 1-14
Linear time algorithms for liveness and boundedness in conflict-free Petri nets
Paola Alimonti
,
Esteban Feuerstein
,
Umberto Nanni
Technical Report (TR-92-008), 1992, February
On-line computation of minimal and maximal length paths
Giorgio Ausiello
,
Giuseppe F. Italiano
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Theoretical Computer Science
95
, 1992, pp. 245-261
Incremental algorithms for minimal length paths
Giorgio Ausiello
,
Giuseppe F. Italiano
,
Alberto Marchetti Spaccamela
,
Umberto Nanni
Journal of Algorithms
12
, 1991, pp. 615-638
Competitive algorithms for the weighted list update problem
Fabrizio d'Amore
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Lecture Notes in Computer Science
519
, 1991, pp. 240-248
Seiten 1
2
>