Umberto Nanni

From MaRDI portal
Person:286983

Available identifiers

zbMath Open nanni.umbertoDBLPn/UmbertoNanniWikidataQ60667518 ScholiaQ60667518MaRDI QIDQ286983

List of research outcomes





PublicationDate of PublicationType
Counting edges in a dag2024-06-05Paper
On-line graph algorithms for incremental compilation2024-01-05Paper
Multi-dimensional Interval Routing Schemes2023-12-01Paper
An Experimental Study of Dynamic Algorithms for Transitive Closure2017-06-15Paper
The incremental maintenance of a depth-first-search tree in directed acyclic graphs2016-05-26Paper
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs2012-11-02Paper
Linear time analysis of properties of conflict-free and general Petri nets2011-02-02Paper
Power balance and apportionment algorithms for the United States Congress2005-08-04Paper
Fully dynamic shortest paths in digraphs with arbitrary arc weights2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44704972004-07-01Paper
A fully dynamic algorithm for distributed shortest paths.2003-08-17Paper
Characterization results of all shortest paths interval routing schemes2003-06-26Paper
Maintaining a topological order under edge insertions2003-06-24Paper
Dynamic algorithms for classes of constraint satisfaction problems2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45083812000-10-03Paper
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees2000-08-28Paper
https://portal.mardi4nfdi.de/entity/Q42520342000-03-13Paper
https://portal.mardi4nfdi.de/entity/Q42180921999-07-14Paper
Semidynamic algorithms for maintaining single-source shortest path trees1999-06-22Paper
Multidimensional interval routing schemes1999-01-12Paper
A uniform approach to semi-dynamic problems on digraphs1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q48751881996-04-28Paper
https://portal.mardi4nfdi.de/entity/Q31388721994-01-02Paper
https://portal.mardi4nfdi.de/entity/Q40374231993-05-18Paper
The weighted list update problem and the lazy adversary1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40288991993-03-28Paper
Incremental algorithms for minimal length paths1992-06-28Paper
On-line computation of minimal and maximal length paths1992-06-28Paper
Dynamic maintenance of directed hypergraphs1990-01-01Paper

Research outcomes over time

This page was built for person: Umberto Nanni