#### Filter Results:

- Full text PDF available (67)

#### Publication Year

1950

2017

- This year (2)
- Last 5 years (6)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Luca Forlizzi, Ralf Hartmut Güting, Enrico Nardelli, Markus Schneider
- SIGMOD Conference
- 2000

We consider spatio-temporal databases supporting spatial objects with continuously changing position and extent, termed <i>moving objects databases</i>. We formally define a data model for such databases that includes complex evolving spatial structures such as line networks or multi-component regions with holes. The data model is given as a collection of… (More)

- José Antonio Cotelo Lema, Luca Forlizzi, Ralf Hartmut Güting, Enrico Nardelli, Markus Schneider
- Comput. J.
- 2003

type Discrete type moving(int) mapping(const(int)) moving(string) mapping(const(string)) moving(bool) mapping(const(bool)) moving(real) mapping(ureal) moving(point) mapping(upoint) moving(points) mapping(upoints) moving(line) mapping(uline) moving(region) mapping(uregion) The sliced representation is built by a type constructor mapping parameterized by the… (More)

- Giuseppe Di Battista, Enrico Nardelli
- IEEE Trans. Systems, Man, and Cybernetics
- 1988

- Enrico Nardelli, Guido Proietti, Peter Widmayer
- Algorithmica
- 2002

Abstract. Let G=(V,E) be a 2-edge connected, undirected and nonnegatively weighted graph, and let S(r) be a single source shortest paths tree (SPT) of G rooted at r ∈ V . Whenever an edge e in S(r) fails, we are interested in reconnecting the nodes now disconnected from the root by means of a single edge e' crossing the cut created by the removal of e .… (More)

- Enrico Nardelli, Guido Proietti, Peter Widmayer
- Theor. Comput. Sci.
- 2001

In an undirected, 2-node connected graph G = (V,E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in G. The removal of a node and its incident edges from G may increase the distance from r to s. A most vital node of a given shortest path from r to s is a node (other than r and s)… (More)

- M. Gargano, Enrico Nardelli, Maurizio Talamo
- Inf. Syst.
- 1991

- Carlo Batini, L. Furlani, Enrico Nardelli
- ER
- 1985

- Enrico Nardelli, Guido Proietti, Peter Widmayer
- Inf. Process. Lett.
- 2001

Let PG(r, s) denote a shortest path between two nodes r and s in an undirected graph G = (V ,E) such that |V | = n and |E| = m and with a positive real length w(e) associated with any e ∈ E. In this paper we focus on the problem of finding an edge e∗ ∈ PG(r, s) whose removal is such that the length of PG−e∗(r, s) is maximum, where G − e∗ = (V ,E \ {e∗}).… (More)

- Timos K. Sellis, Manolis Koubarakis, +11 authors Michel Scholl
- Spatio-Temporal Databases: The CHOROCHRONOS…
- 2003

- Enrico Nardelli, Guido Proietti, Peter Widmayer
- Inf. Process. Lett.
- 1998