|
Search the dblp DataBase
Serafino Cicerone:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Serafino Cicerone, Daniele Frigioni, Laura Tarantino, Paolino Di Felice
Interacting with Topological Invariants of Spatial Databases. [Citation Graph (0, 0)][DBLP] DANTE, 1999, pp:213-217 [Conf]
- Serafino Cicerone, Daniele Frigioni, Paolino Di Felice
Decomposing Spatial Databases and Applications. [Citation Graph (0, 0)][DBLP] DEXA Workshop, 2000, pp:861-868 [Conf]
- Serafino Cicerone, Daniele Frigioni, Laura Tarantino
Interacting with Geographic Databases: A Focus+Context Approach. [Citation Graph (0, 0)][DBLP] DEXA Workshop, 2000, pp:869-875 [Conf]
- Serafino Cicerone, Francesco Parisi-Presicce
Strategies in Modular System Design by Interface Rewriting. [Citation Graph (0, 0)][DBLP] ESOP, 1994, pp:165-179 [Conf]
- Serafino Cicerone, Eliseo Clementini
Extraction of qualitative information from the weighted walkthroughs. [Citation Graph (0, 0)][DBLP] ACM-GIS, 2002, pp:137-142 [Conf]
- Serafino Cicerone, Paolino Di Felice
Cardinal relations between regions with a broad boundary. [Citation Graph (0, 0)][DBLP] ACM-GIS, 2000, pp:15-20 [Conf]
- Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
Static and Dynamic Low-Congested Interval Routing Schemes. [Citation Graph (0, 0)][DBLP] ICALP, 1998, pp:592-603 [Conf]
- Serafino Cicerone, Gabriele Di Stefano
On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. [Citation Graph (0, 0)][DBLP] ISAAC, 1997, pp:354-363 [Conf]
- Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke
Survivable Networks with Bounded Delay: The Edge Failure Case. [Citation Graph (0, 0)][DBLP] ISAAC, 1999, pp:205-214 [Conf]
- Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
A Fully Dynamic Algorithm for Distributed Shortest Paths. [Citation Graph (0, 0)][DBLP] LATIN, 2000, pp:247-257 [Conf]
- Serafino Cicerone, Daniele Frigioni, Laura Tarantino
On the formalization of zoom-based interaction with geographic databases. [Citation Graph (0, 0)][DBLP] SEBD, 2000, pp:401-414 [Conf]
- Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP] SIROCCO, 1999, pp:62-77 [Conf]
- Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano
(k, +)-Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP] WG, 2001, pp:66-77 [Conf]
- Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
Counting Edges in a Dag. [Citation Graph (0, 0)][DBLP] WG, 1996, pp:85-100 [Conf]
- Serafino Cicerone, Gabriele Di Stefano
Networks with Small Stretch Number. [Citation Graph (0, 0)][DBLP] WG, 2000, pp:95-106 [Conf]
- Serafino Cicerone, Gabriele Di Stefano
Graphs with Bounded Induced Distance. [Citation Graph (0, 0)][DBLP] WG, 1998, pp:177-191 [Conf]
- Serafino Cicerone, Daniele Frigioni, Laura Tarantino
Supporting a Focus+Context Interaction Style for Spatial Databases. [Citation Graph (0, 0)][DBLP] WISE, 2000, pp:328-335 [Conf]
- Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni
Partially Dynamic Concurrent Update of Distributed Shortest Paths. [Citation Graph (0, 0)][DBLP] ICCTA, 2007, pp:32-38 [Conf]
- Serafino Cicerone, Gabriele Di Stefano
Graphs with bounded induced distance. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:3-21 [Journal]
- Serafino Cicerone, Gabriele Di Stefano
On the Extension of Bipartite to Parity Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:181-195 [Journal]
- Serafino Cicerone, Gabriele Di Stefano
Graph Classes Between Parity and Distance-hereditary Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:197-216 [Journal]
- Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke
Self-spanner graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:99-120 [Journal]
- Serafino Cicerone, Daniele Frigioni, Paolino Di Felice
A general strategy for decomposing topological invariants of spatial databases and an application. [Citation Graph (0, 0)][DBLP] Data Knowl. Eng., 2002, v:42, n:1, pp:57-87 [Journal]
- Serafino Cicerone, Eliseo Clementini
Efficient Estimation of Qualitative Topological Relations based on the Weighted Walkthroughs Model. [Citation Graph (0, 0)][DBLP] GeoInformatica, 2003, v:7, n:3, pp:211-227 [Journal]
- Serafino Cicerone, Paolino Di Felice
Cardinal directions between spatial objects: the pairwise-consistency problem. [Citation Graph (0, 0)][DBLP] Inf. Sci., 2004, v:164, n:1-4, pp:165-188 [Journal]
- Serafino Cicerone, Gabriele Di Stefano
(k, +)-distance-hereditary graphs. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2003, v:1, n:3-4, pp:281-302 [Journal]
- Serafino Cicerone, Gabriele Di Stefano
Networks with small stretch number. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2004, v:2, n:4, pp:383-405 [Journal]
- Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2001, v:61, n:10, pp:1472-1488 [Journal]
- Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
Low-congested interval routing schemes for hypercubelike networks. [Citation Graph (0, 0)][DBLP] Networks, 2000, v:36, n:3, pp:191-201 [Journal]
- Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
A Uniform Approach to Semi-Dynamic Problems on Digraphs. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:203, n:1, pp:69-90 [Journal]
- Serafino Cicerone, Francesco Parisi-Presicce
On the Complexity of Specification Morphisms. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:189, n:1-2, pp:239-248 [Journal]
- Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
Static and dynamic low-congested interval routing schemes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:276, n:1-2, pp:315-354 [Journal]
- Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
A fully dynamic algorithm for distributed shortest paths. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:1, n:297, pp:83-102 [Journal]
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. [Citation Graph (, )][DBLP]
Delay Management Problem: Complexity Results and Robust Algorithms. [Citation Graph (, )][DBLP]
Maintenance of Multi-level Overlay Graphs for Timetable Queries. [Citation Graph (, )][DBLP]
Robust Algorithms and Price of Robustness in Shunting Problems. [Citation Graph (, )][DBLP]
Dynamic Algorithms for Recoverable Robustness Problems. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs
|