Serafino Cicerone

Associate Professor

Felix 1, Room
serafino.cicerone@univaq.it
+39 0862 434472

 

  • Algorithmic graph theory
  • Algorithm engineering
  • Robust algorithms
  • Models for spatial data: topological & direction relations
 

Projects

    • ARRIVAL
    • (Algorithms for Robust and online Railway optimization: Improving the Validity and reliAbility of Large scale systems) - European project funded by the Future and Emerging Technologies Unit of EC (IST priority - 6th FP), under contract no. FP6-021235-2. 

    The main goal of ARRIVAL was to develop the necessary foundational algorithmic research in order to provide ingenious and sound answers to the fundamental efficiency and quality issues encapsulated in robust and online planning of complex, large-scale systems as those in railways.
  • AMORE (Algorithmic Methods for Optimizing the Railways in Europe) - European project funded by the Human Potential Program of the EU, under contract n. HPRC-CT-1999-00104.  
    The main goal of AMORE was to develop models for railway optimization problems, and to propose and implement algorithms for solving them.
  • SPADA (Representation and Processing of Spatial Data in Geographic Information Systems) - Project funded by the Italian Ministry of University and Scientific and Technological Research (MURST).

The information is available at the external address http://www.ing.univaq.it/personale/scheda_personale.php?codice=118.

Book chapters

S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra, M. Schachtebeck, and A. Schöbel.
Recoverable robustness in shunting and timetabling.
In R. K. Ahuja, R. H. Möhring, and C. D. Zaroliagis, editors, Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, volume 5868 of Lecture Notes in Computer Science, pages 28-60. Springer, 2009.

Journals

S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, V. Maurizio.
Engineering a new Algorithm for Distributed Shortest Paths on Dynamic Networks.
Algorithmica, 66(1): 51-86, 2013. DOI: 10.1007/s00453-012-9623-9

S. Cicerone, G. Di Stefano, M. Schachtebeck, and A. Schöbel.
Multi -Stage Recovery Robustness for Optimization Problems: a new Concept for Planning under Disturbances.
Information Sciences, 190:107-126, 2012. DOI: 10.1016/j.ins.2011.12.010

S. Cicerone.
Characterizations of Graphs with Stretch Number less than 2.
Electronic Notes in Discrete Mathematics, 37: 375-380, 2011.

S. Cicerone, G. D'Angelo, G. Di Stefano, and D. Frigioni.
Partially dynamic efficient algorithms for distributed shortest paths.
Theoretical Computer Science, 411(7-9):1013-1037, 2010.

S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra.
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases.
Journal of Combinatorial Optimization, 18(3):229-257, 2009.

S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra.
Recoverable robustness for train shunting problems.
Algorithmic Operations Research, 4(2):102-116, 2009.

F. Bruera, S. Cicerone, G. D'Angelo, G. Di Stefano, and D. Frigioni.
Dynamic multi-level overlay graphs for shortest paths.
Mathematics in Computer Science, 1(4):709-736, 2008.

S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Petricola.
Partially dynamic algorithms for distributed shortest paths and their experimental evaluation.
Journal of Computers, 2(9):16-26, 2007.

S. Cicerone, G. Di Stefano, and D. Handke.
Self-spanner graphs.
Discrete Applied Mathematics, 150(1-3):99-120, 2005.

S. Cicerone and P. Di Felice.
Cardinal directions between spatial objects: the pairwise-consistency problem.
Information Science, 164(1-4):165-188, 2004.

S. Cicerone and G. Di Stefano.
Networks with small stretch number.
Journal of Discrete Algorithms, 2(4):383-405, 2004.

S. Cicerone and E. Clementini.
Efficient estimation of qualitative topological relations based on the weighted walkthroughs model.
GeoInformatica, 7(3):211-227, 2003.

S. Cicerone and G. Di Stefano.
(k, +)-distance-hereditary graphs.
Journal of Discrete Algorithms, 1(3-4):281-302, 2003.

S. Cicerone, G. Di Stefano, D. Frigioni, and U. Nanni.
A fully dynamic algorithm for distributed shortest paths.
Theoretical Computer Science, 297(1-3):83-102, 2003.

S. Cicerone, D. Frigioni, and P. Di Felice.
A general strategy for decomposing topological invariants of spatial databases and an application.
Data Knowledge Engineering, 42(1):57-87, 2002.

S. Cicerone, G. Di Stefano, and M. Flammini.
Static and dynamic low-congested interval routing schemes.
Theoretical Computer Science, 276(1-2):315-354, 2002.

S. Cicerone, D. Frigioni, and L. Tarantino.
Exploration of geographic databases: supporting a focus+context interaction style.
Journal of Applied System Studies, 3(2), 2002.

S. Cicerone and G. Di Stefano.
Graphs with bounded induced distance.
Discrete Applied Mathematics, 108(1-2):3-21, 2001.

S. Cicerone, G. Di Stefano, and M. Flammini.
Compact-port routing models and applications to distance-hereditary graphs.
Journal of Parallel and Distribributed Computing, 61(10):1472-1488, 2001.

S. Cicerone, G. Di Stefano, and M. Flammini.
Low-congested interval routing schemes for hypercubelike networks.
Networks, 36(3):191-201, 2000.

S. Cicerone and G. Di Stefano.
On the extension of bipartite to parity graphs.
Discrete Applied Mathematics, 95(1-3):181-195, 1999.

S. Cicerone and G. Di Stefano.
Graph classes between parity and distance-hereditary graphs.
Discrete Applied Mathematics, 95(1-3):197-216, 1999.

S. Cicerone, D. Frigioni, U. Nanni, and F. Pugliese.
A uniform approach to semi-dynamic problems on digraphs.
Theoretical Computer Science, 203(1):69-90, 1998.

S. Cicerone and F. Parisi-Presicce.
On the complexity of specification morphisms.
Theoretical Computer Science, 189(1-2):239-248, 1997.

Conferences

S. Cicerone, G. Di Stefano, and Alfredo Navarra.
Asynchronous Embedded Pattern Formation without Orientation.
30th International Symposium on Distributed Computing (DISC'16). Lecture Notes in Computer Science, to appear, 2016.

S. Cicerone, G. Di Stefano, and Alfredo Navarra.
Gathering of Robots on Meeting Points.
11th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (Algosensors'15), volume 9536 of Lecture Notes in Computer Science, pages 183-185. Springer, 2015.

S. Cicerone, G. Di Stefano, and Alfredo Navarra.
MinMax-Distance Gathering on given Meeting Points
9th International Conference on Algorithms and Complexity (CIAC'15), volume 9079 of Lecture Notes in Computer Science, pages 127-139. Springer, 2015.

S. Cicerone, G. Di Stefano, and Alfredo Navarra.
Minimum-Traveled-Distance Gathering of Oblivious Robots over given Meeting Points
10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (Algosensors'14), volume 8847 of Lecture Notes in Computer Science, pages 57-72. Springer, 2014.

S. Cicerone and G. Di Stefano.
Decomposing Octilinear Polygons into Triangles and Rectangles (extended abstract).
16th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG'13). 2013

S. Cicerone and M. Cermignani.
Fast and Simple Approach for Polygon Schematization.
12th International Conference on Computational Science and Applications (ICCSA'12), volume 7333 of Lecture Notes in Computer Science, pages 267-279. Springer, 2012.

S. Cicerone.
Using split composition to extend distance-hereditary graphs in a generative way (extended abstract).
8th Annual Conference on Theory and Applications of Models of Computation (TAMC'11) , volume 6648 of Lecture Notes in Computer Science, pages 286-297. Springer, 2011.

S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and V. Maurizio.
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation.
In Paola Festa, editor, 9th International Symposium on Experimental Algorithms (SEA 2010), volume 6049 of Lecture Notes in Computer Science, pages 59-70. Springer, 2010.

S. Cicerone, A. Orlandi, B. Archambeault, S. Connor, J. Fan, and J. L. Drewniak.
Cavities' identification algorithm for power integrity analysis of complex boards.
In 20th Int. Zurich Symposium on Electromagnetic Compatibility (EMC-Zurich 2009). IEEE press, 2009.

S. Cicerone, G. Di Stefano, M. Schachtebeck, and A. Schöbel.
Dynamic algorithms for recoverable robustness problems.
In Matteo Fischetti and Peter Widmayer, editors, 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2008), volume 9 of OASICS, 2008.

S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra.
Delay management problem: Complexity results and robust algorithms.
In Boting Yang, Ding-Zhu Du, and Cao An Wang, editors, 2nd Int. Conf. on Combinatorial Optimization and Applications (COCOA 2008), volume 5165 of Lecture Notes in Computer Science, pages 458-468. Springer, 2008.

F. Bruera, S. Cicerone, G. D'Angelo, G. Di Stefano, and D. Frigioni.
Maintenance of multi-level overlay graphs for timetable queries.
In Christian Liebchen, Ravindra K. Ahuja, and Juan A. Mesa, editors, 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2007), volume 7 of OASICS, 2007.

S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and A. Navarra.
Robust algorithms and price of robustness in shunting problems.
In Christian Liebchen, Ravindra K. Ahuja, and Juan A. Mesa, editors, 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2007), volume 7 of OASICS, 2007.

G. D'Angelo, S. Cicerone, G. Di Stefano, and D. Frigioni.
Partially dynamic concurrent update of distributed shortest paths.
In Int. Conference on Computing: Theory and Applications (ICCTA 2007), pages 32-38. IEEE Computer Society, 2007.

S. Cicerone and P. Di Felice.
Cardinal directions between spatial objects: the pairwise-consistency problem (extended abstract).
In 7th Int. Conference on Computer Science and Informatics (ICCSI 2003). ACM, 2003.

S. Cicerone and Eliseo Clementini.
Extraction of qualitative information from the weighted walkthroughs.
In Agnès Voisard and Shu-Ching Chen, editors, 10th ACM InternationalSymposium on Advances in Geographic Information Systems (ACM-GIS 2002), pages 137-142. ACM, 2002.

S. Cicerone, G. D'Ermiliis, and G. Di Stefano.
(k,+)-distance-hereditary graphs.
In Andreas Brandstädt and Van Bang Le, editors, 27th Int. Workshop Graph-Theoretic Concepts in Computer Science, (WG 2001), volume 2204 of Lecture Notes in Computer Science, pages 66-77. Springer, 2001.

S. Cicerone and P. Di Felice.
Cardinal relations between regions with a broad boundary.
In Ki-Joune Li, Kia Makki, Niki Pissinou, and Siva Ravada, editors, 8th ACM Symposium on Advances in Geographic Information Systems (ACM-GIS 2000), pages 15-20. ACM, 2000.

S. Cicerone, D. Frigioni, and P. Di Felice.
Decomposing spatial databases and applications.
In 11th Int. Workshop on Database and Expert Systems Applications (DEXA 2000), pages 861-868. IEEE Computer Society, 2000.

S. Cicerone, D. Frigioni, and L. Tarantino.
Interacting with geographic databases: A focus+context approach.
In 11th Int. Workshop on Database and Expert Systems Applications (DEXA 2000), pages 869-875. IEEE Computer Society, 2000.

S. Cicerone, G. Di Stefano, D. Frigioni, and U. Nanni.
A fully dynamic algorithm for distributed shortest paths.
In Gaston H. Gonnet, Daniel Panario, and Alfredo Viola, editors,Theoretical Informatics, 4th Latin American Symposium (LATIN 2000), volume 1776 of Lecture Notes in Computer Science, pages 247-257. Springer, 2000.

S. Cicerone, D. Frigioni, and L. Tarantino.
On the formalization of zoom-based interaction with geographic databases.
In Ottavo Convegno Nazionale su Sistemi Evoluti per Basi di Dati (SEBD 2000), pages 401-414, 2000.

S. Cicerone and G. Di Stefano.
Networks with small stretch number.
In Ulrik Brandes and Dorothea Wagner, editors, 26th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), volume 1928 of Lecture Notes in Computer Science, pages 95-106. Springer, 2000.

S. Cicerone, D. Frigioni, and L. Tarantino.
Supporting a focus+context interaction style for spatial databases.
In Qing Li, Z. Meral Özsoyoglu, Roland Wagner, Yahiko Kambayashi, and Yanchun Zhang, editors, 1st International Conference on Web Information Systems Engineering (WISE 2000), pages 328-335. IEEE Computer Society, 2000.

S. Cicerone, D. Frigioni, L. Tarantino, and P. Di Felice.
Interacting with topological invariants of spatial databases.
In Int. Symposium on Database Applications in Non-Traditional Environments (DANTE 1999), pages 213-217. IEEE Computer Society, 1999.

S. Cicerone, G. Di Stefano, and D. Handke.
Survivable networks with bounded delay: The edge failure case.
In Alok Aggarwal and C. Pandu Rangan, editors, 10th International Symposium on Algorithms and Computation (ISAAC 1999), volume 1741 of Lecture Notes in Computer Science, pages 205-214. Springer, 1999.

S. Cicerone, G. Di Stefano, and M. Flammini.
Compact-port routing models and applications to distance-hereditary graphs.
In Cyril Gavoille, Jean-Claude Bermond, and André Raspaud, editors, 6th International Colloquium on Structural Information & Communication Complexity (SIROCCO 1999), pages 62-77. Carleton Scientific, 1999.

S. Cicerone, G. Di Stefano, and M. Flammini.
Static and dynamic low-congested interval routing schemes.
In Kim Guldstrand Larsen, Sven Skyum, and Glynn Winskel, editors, 25th Int. Colloquium on Automata, Languages and Programming (ICALP 1998), volume 1443 of Lecture Notes in Computer Science, pages 592-603. Springer, 1998.

S. Cicerone and G. Di Stefano.
Graphs with bounded induced distance.
In Juraj Hromkovic and Ondrej Sýkora, editors, 24th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG 1998), volume 1517 of Lecture Notes in Computer Science, pages 177-191. Springer, 1998.

S. Cicerone and G. Di Stefano.
On the equivalence in complexity among basic problems on bipartite and parity graphs.
In Hon Wai Leong, Hiroshi Imai, and Sanjay Jain, editors, 8th Int. Symposium on Algorithms and Computation (ISAAC 1997), volume 1350 of Lecture Notes in Computer Science, pages 354-363. Springer, 1997.

S. Cicerone, D. Frigioni, U. Nanni, and F. Pugliese.
Counting edges in a dag.
In Fabrizio d'Amore, Paolo Giulio Franciosa, and Alberto Marchetti-Spaccamela, editors, 22nd Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG 1996), volume 1197 ofLecture Notes in Computer Science, pages 85-100. Springer, 1996.

S. Cicerone and G. Di Stefano.
Graph classes between parity and distance-hereditary graphs.
In 1st Discrete Mathematics and Theoretical Computer Science (DMTCS 1996), Combinatorics, Complexity, and Logic, pages 168-181. Springer, 1996.

S. Cicerone and F. Parisi-Presicce.
Strategies in modular system design by interface rewriting.
In Donald Sannella, editor, 5th European Symposium on Programming Languages and Systems (ESOP 1994), volume 788 of Lecture Notes in Computer Science, pages 165-179. Springer, 1994.