#### Filter Results:

- Full text PDF available (25)

#### Publication Year

1975

2017

- This year (2)
- Last 5 years (10)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Serafino Cicerone, Paolino Di Felice
- Inf. Sci.
- 2004

The paper formalizes an open-problem (called by the authors the pairwise-consistency problem) which is relevant in the context of cardinal directions among extended objects, proposes an efficient algorithmic solution for it, discusses the implementation of the algorithm and briefly reports the numerical results obtained by running the code.

- Serafino Cicerone, Gianlorenzo D'Angelo, +4 authors Anita Schöbel
- Robust and Online Large-Scale Optimization
- 2009

In this paper we provide efficient robust algorithms for shunting problems concerning the reordering of train cars over a hump. In particular, we study algorithms able to cope with small disruptions, as temporary and local unavailability and/or malfunctioning of key resources that can occur and affect planned operations. To this aim, a definition of robust… (More)

We propose a fully-dynamic distributed algorithm for the all-pairs shortest paths problem on general networks with positive real edge weights. If ∆σ is the number of pairs of nodes changing the distance after a single edge modification σ (insert, delete, weight decrease, or weight increase) then the message complexity of the proposed algorithm is O(n∆σ) in… (More)

- Serafino Cicerone, Gabriele Di Stefano
- Discrete Applied Mathematics
- 1999

Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and other combinatorial problems exploit the structural property of these graphs described by Burlet and Uhry in [8]. This paper introduces a different structural property of parity… (More)

- Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
- Theor. Comput. Sci.
- 1998

In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutré and van Leeuwen in [17] for updating the transitive closure and the transitive reduction of a dag. We define a propagation property on a binary relationship over the vertices of a digraph… (More)

- Serafino Cicerone, Gabriele Di Stefano
- DMTCS
- 1996

Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs, are NP-complete or open for parity graphs. Moreover, the metric characterizations of these two graph classes suggest an excessive gap between them. We introduce a family of… (More)

- Serafino Cicerone, Paolino Di Felice
- ACM-GIS
- 2000

Despite the innovative relevance of the results about spatial relations today available, the expressiveness of spatial query languages needs to be pushed further significantly in order to cope with the complexity of spatial entities. In particular, more research is necessary in order to support queries against data with uncertainty. In connection with… (More)

- Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
- Algorithmic Operations Research
- 2009

Several attempts have been done in the literature in the last years in order to provide a formal definition of the notions of robustness and recoverability for optimization problems. Recently, a new model of recoverable robustness has been introduced in the context of railways optimization. The basic idea of recoverable robustness is to compute solutions… (More)

- Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
- Theor. Comput. Sci.
- 2010