Umberto Nanni

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Richard B. Tan

> Home > Persons > Umberto Nanni

Publications

2001
[j13]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/FlamminiGNT01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/FlamminiGNT01
Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Characterization results of all shortest paths interval routing schemes. Networks 37(4): 225-232 (2001)
1998
[j7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/FlamminiGNT98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/FlamminiGNT98
Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Multidimensional Interval Routing Schemes. Theor. Comput. Sci. 205(1-2): 115-133 (1998)
[c14]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/sirocco/FlamminiGNT98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sirocco/FlamminiGNT98
Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Characterization results of all shortest paths interval routing schemes. SIROCCO 1998: 201-213
1995
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/wdag/FlamminiGNT95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wdag/FlamminiGNT95
Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Multi-Dimensional Interval Routing Schemes. WDAG 1995: 131-144

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.