#### 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, Gabriele Di Stefano
- DMTCS
- 1996

Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphismproblem), which can be solved in polynomialtime 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 classes… (More)

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

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∆ σ)… (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 diierent structural property of parity graphs:… (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)

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)

- Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
- J. Comb. Optim.
- 2009

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

Recently, the recoverable robustness model has been introduced in the optimization area. This model allows to consider disruptions (input data changes) in a unified way, that is, during both the strategic planning phase and the operational phase. Although the model represents a significant improvement, it has the following drawback: we are typically not… (More)