default search action
Umberto Nanni
Person information
- affiliation: Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c25]Paolo Fantozzi
, Luigi Laura, Umberto Nanni
Non-isomorphic CNF Generation. DCAI (1) 2021: 98-107
2010 – 2019
- 2019
- [c24]Giorgio Audrito, Tania Di Mascio
Recommending Tasks in Online Judges. MIS4TEL 2019: 129-136 - 2018
- [c23]Paolo Fantozzi
Visual Analysis of Vertex-Disjoint Path Connectivity in Networks. IV 2018: 260-265 - 2016
- [e1]Dickson K. W. Chiu, Ivana Marenzi, Umberto Nanni, Marc Spaniol
Advances in Web-Based Learning - ICWL 2016 - 15th International Conference, Rome, Italy, October 26-29, 2016, Proceedings. Lecture Notes in Computer Science 10013, 2016, ISBN 978-3-319-47439-7 [contents] - 2014
- [c22]Luigi Laura
The Organization of Large-Scale Repositories of Learning Objects with Directed Hypergraphs. ICWL Workshops 2014: 23-33 - [c21]Luigi Laura
Visual Analysis Based on Dominator Trees with Application to Personalized eLearning. ICWL 2014: 207-212 - 2012
- [c20]Giorgio Ausiello, Giuseppe F. Italiano
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. ISCO 2012: 1-14 - 2011
- [j17]Paola Alimonti, Esteban Feuerstein, Luigi Laura
Linear time analysis of properties of conflict-free and general Petri nets. Theor. Comput. Sci. 412(4-5): 320-338 (2011)
2000 – 2009
- 2003
- [j16]Daniele Frigioni
Fully dynamic shortest paths in digraphs with arbitrary arc weights. J. Algorithms 49(1): 86-113 (2003) - [j15]Serafino Cicerone
A fully dynamic algorithm for distributed shortest paths. Theor. Comput. Sci. 297(1-3): 83-102 (2003) - 2001
- [j14]Daniele Frigioni
An Experimental Study of Dynamic Algorithms for Transitive Closure. ACM J. Exp. Algorithmics 6: 9 (2001) - [j13]Michele Flammini
Characterization results of all shortest paths interval routing schemes. Networks 37(4): 225-232 (2001) - [j12]Daniele Frigioni
Dynamic algorithms for classes of constraint satisfaction problems. Theor. Comput. Sci. 259(1-2): 287-305 (2001) - 2000
- [j11]Daniele Frigioni
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. J. Algorithms 34(2): 251-281 (2000) - [c19]Serafino Cicerone
A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN 2000: 247-257 - [c18]Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. WAE 2000: 218-229
1990 – 1999
- 1998
- [j10]Daniele Frigioni, Alberto Marchetti-Spaccamela
Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. Algorithmica 22(3): 250-274 (1998) - [j9]Daniele Frigioni
Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem. ACM J. Exp. Algorithmics 3: 5 (1998) - [j8]Serafino Cicerone, Daniele Frigioni, Umberto Nanni
A Uniform Approach to Semi-Dynamic Problems on Digraphs. Theor. Comput. Sci. 203(1): 69-90 (1998) - [j7]Michele Flammini
Multidimensional Interval Routing Schemes. Theor. Comput. Sci. 205(1-2): 115-133 (1998) - [c17]Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. ESA 1998: 320-331 - [c16]Daniele Frigioni, Tobias Miller, Umberto Nanni
An Experimental Study of Dynamic Algorithms for Directed Graphs. ESA 1998: 368-380 - [c15]Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. MFCS 1998: 1-16 - [c14]Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Characterization results of all shortest paths interval routing schemes. SIROCCO 1998: 201-213 - 1997
- [j6]Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni
The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs. Inf. Process. Lett. 61(2): 113-120 (1997) - [c13]Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone:
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem. WAE 1997: 54-63 - 1996
- [j5]Alberto Marchetti-Spaccamela
Maintaining a Topological Order Under Edge Insertions. Inf. Process. Lett. 59(1): 53-58 (1996) - [c12]Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). SODA 1996: 212-221 - [c11]Serafino Cicerone
Counting Edges in a Dag. WG 1996: 85-100 - 1995
- [c10]Michele Flammini, Giorgio Gambosi, Umberto Nanni
Multi-Dimensional Interval Routing Schemes. WDAG 1995: 131-144 - 1994
- [c9]Daniele Frigioni, Alberto Marchetti-Spaccamela
Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. CIAC 1994: 136-151 - [c8]Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni
On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's. ESA 1994: 343-353 - [c7]Daniele Frigioni, Alberto Marchetti-Spaccamela
Incremental Algorithms for the Single-Source Shortest Path Problem. FSTTCS 1994: 113-124 - 1993
- [j4]Fabrizio d'Amore
The Weighted List Update Problem and the Lazy Adversary. Theor. Comput. Sci. 108(2): 371-384 (1993) - [c6]Alberto Marchetti-Spaccamela
On-line Graph Algorithms for Incremental Compilation. WG 1993: 70-86 - [p2]Umberto Nanni
LOA: The LOGIDATA+ Object Algebra. LOGIDATA+: Deductive Databases with Complex Objects 1993: 195-210 - [p1]Umberto Nanni
The LOGIDATA+ Prototype System. LOGIDATA+: Deductive Databases with Complex Objects 1993: 211-232 - 1992
- [j3]Giorgio Ausiello, Giuseppe F. Italiano
On-Line Computation of Minimal and Maximal Length Paths. Theor. Comput. Sci. 95(2): 245-261 (1992) - [c5]Paola Alimonti, Esteban Feuerstein, Umberto Nanni
Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets. LATIN 1992: 1-14 - 1991
- [j2]Giorgio Ausiello, Giuseppe F. Italiano
Incremental Algorithms for Minimal Length Paths. J. Algorithms 12(4): 615-638 (1991) - [c4]Fabrizio d'Amore, Alberto Marchetti-Spaccamela
Competitive Algorithms for the Weighted List Update Problem. WADS 1991: 240-248 - 1990
- [j1]Giorgio Ausiello, Umberto Nanni
Dynamic Maintenance of Directed Hypergraphs. Theor. Comput. Sci. 72(2&3): 97-117 (1990) - [c3]Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni:
Incremental Algorithms for Minimal Length Paths. SODA 1990: 12-21
1980 – 1989
- 1989
- [c2]Giuseppe F. Italiano, Alberto Marchetti-Spaccamela
Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). WADS 1989: 352-372 - 1988
- [c1]Giorgio Ausiello, Alberto Marchetti-Spaccamela
Dynamic Maintenance of Paths and Path Expressions on Graphs. ISSAC 1988: 1-12
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: