S. Cicerone, G. Di Stefano, S. Klavžar, and I. G. Yero. Mutual-visibility problems on graphs of diameter two. European Journal of Combinatorics, 120: 103995, 2024. doi:10.1016/j.ejc.2024.103995 

S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra. Molecular Pattern Formation on Grids in the Moblot model. Theoretical Computer Science, 996: 114510, 2024. doi:10.1016/j.tcs.2024.114510 

S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, The Geodesic Mutual Visibility Problem: Oblivious Robots on Grids and Trees. Pervasive and Mobile Computing, 95: 101842, 2023.   doi:10.1016/j.pmcj.2023.101842 

S. Cicerone, G. Di Stefano, S. Klavžar, L. Drozek, J. Hedzet and I. G. Yero. Variety of mutual-visibility problems in graphs. Theoretical Computer Science, 974: 114096, 2023.  doi:10.1016/j.tcs.2023.114096 

S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, Molecular Oblivious Robots: a new model for robots with assembling capabilities,  IEEE Access, 11: 15701-15724, 2023.  doi:10.1109/ACCESS.2023.3244844

S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, Arbitrary pattern formation on infinite regular tessellation graphs,  Theoretical Computer Science, 942: 1-20, 2023. doi:10.1016/j.tcs.2022.11.021

S. Cicerone, G. Di Stefano, S. Klavžar. On the mutual visibility in Cartesian products and triangle-free graphs, Applied Mathematics and Computation, 438: 127619, 2023. doi:10.1016/j.amc.2022.127619

S. Cicerone. Breaking symmetries on tessellation graphs via asynchronous robots: the line formation problem as a case study, IEEE Access, 9: 147855-147873, 2021.  doi:10.1109/ACCESS.2021.3123510

S. Cicerone, M. D'Emidio, D. Frigioni, F. Tirabassi Pascucci. Combining polygon schematization and decomposition approaches for solving the cavity decomposition problem, ACM Transaction on Spatial Algorithms and Systems, 7(4):  22:1-22:37, 2021. doi: 10.1145/3462760

S. Cicerone, G. Di Stefano, Getting new algorithmic results by extending distance-hereditary graphs via split composition, PeerJ Computer Science, 7:e627, 2021. doi: 10.7717/peerj-cs.627

S. Cicerone, G. Di Stefano, and A. Navarra. Solving the pattern formation by mobile robots with chirality, IEEE Access, 9:  88177-88204, 2021.  doi:10.1109/ACCESS.2021.3089081

S. Cicerone, G. Di Stefano, and A. Navarra. A structured methodology for designing distributed algorithms for mobile entities, Information Sciences, 574: 111-132, 2021. doi: 10.1016/j.ins.2021.05.043

S. Cicerone, G. Di Stefano Special issue on “Graph algorithms and applications”, Algorithms 14 (5):150,  2021.  doi:10.3390/a14050150

S. Cicerone, M. D’Emidio, G. Di Stefano, A. Navarra, On the effectiveness of the genetic paradigm for polygonization, Information Processing Letters, 171:106134, 2021.  doi:10. 1016/j.ipl.2021.106134

S. Cicerone, A quasi-hole detection algorithm for recognizing k-distance-hereditary graphs, with k < 2, Algorithms 14 (4):105,  2021. doi:10.3390/a14040105

S. Cicerone, G. Di Stefano, and A. Navarra. “Semi-Asynchronous”: a new scheduler in distributed computing. IEEE Access, 9: 41540-41557, 2021.  doi:10.1109/ACCESS.2021.3064880

S. Cicerone, G. Di Stefano, and A. Navarra. Gathering robots in graphs: The central role of synchronicity. Theoretical Computer Science, 849:99–120, 2021. doi:10.1016/j.tcs.2020.10.011

S. Cicerone and G. Di Stefano. Approximation algorithms for decomposing octilinear polygons. Theoretical Computer Science, 779:17–36, 2019. doi:10.1016/j.tcs.2019.01.037

S. Cicerone, G. Di Stefano, and A. Navarra. Asynchronous arbitrary pattern formation: the effects of a rigorous approach. Distributed Computing, 32(2):91–132, 2019. doi:10.1007/s00446-018-0325-7

S. Cicerone, G. Di Stefano, and A. Navarra. Embedded pattern formation by asynchronous robots without chirality. Distributed Computing, 32(4):291–315, 2019. doi:10.1007/s00446-018-0333-7

S. Cicerone, G. Di Stefano, and A. Navarra. Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. Distributed Computing, 31(1):1–50, 2018. doi:10.1007/ s00446-017-0293-3

S. Cicerone, G. D’Angelo, G. Di Stefano, D. Frigioni, and 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. Schobel. 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. doi:10.1016/j.endm.2011.05.064

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. doi:10.1016/j.tcs. 2009.11.008

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. doi:10.1007/s10878-009-9247-4

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. [ link ]

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. doi:10.1007/s11786-007-0023-5

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. doi:10.4304/jcp.2.9.16-26

S. Cicerone, G. Di Stefano, and D. Handke. Self-spanner graphs. Discrete Applied Mathematics, 150(1-3):99–120, 2005. doi:10.1016/j.dam.2005.04.004

S. Cicerone and P. Di Felice. Cardinal directions between spatial objects: the pairwise-consistency problem. Information Sciences, 164(1-4):165–188, 2004. doi:10.1016/j.ins.2003.05.008

S. Cicerone and G. Di Stefano. Networks with small stretch number. Journal of Discrete Algorithms, 2(4):383–405, 2004. doi:10.1016/j.jda.2004.04.002

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

S. Cicerone and G. Di Stefano. (k,+)-distance-hereditary graphs. Journal of Discrete Algorithms, 1(3-4):281–302, 2003. doi:10.1016/S1570-8667(03)00030-3

S. Cicerone, G. Di Stefano, D. Frigioni, and U. Nanni. A fully dynamic algorithm for distributed shortest paths. Theor.etical Computur Sciences, 297(1-3):83–102, 2003. doi:10.1016/S0304-3975(02)00619-9

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. doi:10.1016/S0169-023X(02)00027-7

S. Cicerone, G. Di Stefano, and M. Flammini. Static and dynamic low-congested interval routing schemes. Theoretical Computer Sciences, 276(1-2):315–354, 2002. doi:10.1016/S0304-3975(01)00279-1

S. Cicerone, D. Frigioni, and L. Tarantino. Exploration of geographic databases: Supporting a focus+context interaction style. Journal of Applied System Studies, 3:497–520, 2002.

S. Cicerone and G. Di Stefano. Graphs with bounded induced distance. Discrete Applied Mathematics, 108(1-2):3–21, 2001. doi:10.1016/S0166-218X(00)00227-4

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

S. Cicerone, G. Di Stefano, and M. Flammini. Low-congested interval routing schemes for hypercube like networks. Networks, 36(3):191–201, 2000. doi:10.1002/1097-0037(200010)36:3<191::AID-NET6>3.0.CO;2-K

S. Cicerone and G. Di Stefano. On the extension of bipartite to parity graphs. Discrete Applied Mathematics, 95(1-3):181–195, 1999. doi:10.1016/S0166-218X(99)00074-8

S. Cicerone and G. Di Stefano. Graph classes between parity and distance-hereditary graphs. Discrete Applied Mathematics, 95(1-3):197–216, 1999. doi:10.1016/S0166-218X(99)00075-X

S. Cicerone, D. Frigioni, U. Nanni, and F. Pugliese. A uniform approach to semi-dynamic problems on digraphs. Theoretical Computer Sciences, 203(1):69–90, 1998. doi:10.1016/S0304-3975(97)00288-0

S. Cicerone and F. Parisi-Presicce. On the complexity of specification morphisms. Theoretical Computer Sciences, 189(1-2):239–248, 1997. doi:10.1016/S0304-3975(97)00106-0

S. Omatu, R. Mehmood, P. Sitek, S. Cicerone, S. Rodríguez, Distributed Computing and Artificial Intelligence, 19th Int. Conference, DCAI 2022, L'Aquila, Italy, 2022. Lecture Notes in Networks and Systems, Springer 2023. doi: 10.1007/978-3-031-20859-1

S. Cicerone and G. Di Stefano, Graph Algorithms and Applications. MDPI Books, 2022. doi: 10.3390/books978-3-0365-1541-0

S. Cicerone, G. D. Stefano, A. Navarra, Asynchronous robots on graphs: Gathering, in: P. Flocchini, G. Prencipe, N. Santoro (Eds.), Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Vol. 11340 of Lecture Notes in Computer Science, Springer, 2019, pp. 184–217. doi:10.1007/978-3-030-11072-7_8

S. Cicerone, G. D. Stefano, A. Navarra, Gathering a swarm of robots through shortest paths, in: A. A. (Ed.), Shortest Path Solvers. From Software to Wetware, Vol. 32 of Emergence, Complexity and Computation, Springer, 2018, pp. 27–72. doi:10.1007/978-3-319-77510-4_2

S. Cicerone, G. D’Angelo, G. D. Stefano, D. Frigioni, A. Navarra, M. Schachtebeck, A. Schobel, Recoverable robustness in shunting and timetabling, in: R. K. Ahuja, R. H. M ̈ohring, C. D. Zaroliagis (Eds.), Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, Vol. 5868 of Lecture Notes in Computer Science, Springer, 2009, pp. 28–60. doi:10.1007/978-3-642-05465-5_2

S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, Gathering of robots in butterfly networks, in:  Stabilization, Safety, and Security of Distributed Systems - 26th International Symposium, SSS 2024, Nagoya International Center, Aichi, Japan, October 20-22, 2024. Lecture Notes in Computer Science,  Springer. To appear. 

S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, F. Piselli, Mutual visibility in hypercube-like graphs, in: Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Vietri sul Mare, Italy, May 27-29, 2024, Lecture Notes in Computer Science, vol. 14662, Springer, 2024, pp. 192-207. doi:10.1007/978-3-031-60603-8_11

S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, Time-optimal geodesic mutual visibility of robots on grids within minimum area, in:  Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, Institute for Future Technologies, Jersey City, New Jersey, USA, October 2-4, 2023. Lecture Notes in Computer Science,  vol. 14310, Springer, Cham. 2023, pp. 385–399.  doi:10.1007/978-3-031-44274-2_29

S. Cicerone, G. Di Stefano, Mutual-visibility in distance-hereditary graphs: a linear-time algorithm, in:  Proc. of the XII Latin and American Algorithms, Graphs and Optimization Symposium, {LAGOS} 2023, Huatulco, Mexico, September 18-22, 2023. Procedia Computer Science (Elsevier), Vol. 223, 2023, Pages 104-111. doi:10.1016/j.procs.2023.08.219

S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, The geodesic mutual visibility problem for oblivious robots: the case of trees, in: Distributed Computing and Networking - 24th International Conference, ICDCN 2023, IIT Kharagpur, India, January 4-7, 2023, Association for Computing Machinery, New York, NY, USA, 2023, p. 150-159.  doi:10.1145/3571306.3571401

S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, Molecular robots with chirality on grids, in: Proceedings of the 18th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2022, Potsdam, Germany, September 8-9, 2022, Lecture Notes in Computer Science,  Springer, 2022, pp. 45–59. doi: 10.1007/978-3-031-22050-0_4

S. Cicerone, A. D. Fonso, G. D. Stefano, A. Navarra, MOBLOT: Molecular oblivious robots, in: Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems, AAMAS ’21, London, UK, May 3-7, 2021, p. 350-358. doi:10.5555/3463952.3463998.

S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, Arbitrary pattern formation on infinite regular tessellation graphs, in: Distributed Computing and Networking - 22nd International Conference, ICDCN 2021, Nara, Japan, January 5-8, 2021, Association for Computing Machinery, New York, NY, USA, 2021, p. 56–65. doi:10.1145/3427796.3427833.

S. Cicerone, Breaking symmetries on tessellation graphs via asynchronous robots, in: G. Cordasco, L. Gargano, A. A. Rescigno (Eds.), Proceedings of the 21st Italian Conference on Theoretical Computer Science, ICTCS 2020, Ischia, Italy, September 14-16, 2020 (virtual conference), Vol. 2756 of CEUR Workshop Proceedings, CEUR-WS.org, 2020, pp. 122–136. http://ceur-ws.org/Vol-2756/paper_12.pdf

S. Cicerone, On building networks with limited stretch factor, in: L. Barolli, F. Amato, F. Moscato, T. Enokido, M. Takizawa (Eds.), Web, Artificial Intelligence and Network Applications - Proceedings of the Workshops of the 34th International Conference on Advanced Information Networking and Applications, AINA Workshops 2020, Caserta, Italy, 15-17 April, Vol. 1150 of Advances in Intelligent Systems and Computing, Springer, 2020, pp. 926–936. doi:10.1007/978-3-030-44038-1_84

S. Cicerone, G. D. Stefano, A. Navarra, On gathering of semi-synchronous robots in graphs, in: M. Ghaffari, M. Nesterenko, S. Tixeuil, S. Tucci, Y. Yamauchi (Eds.), Stabilization, Safety, and Security of Distributed Systems - 21st International Symposium, SSS 2019, Pisa, Italy, October 22-25, 2019, Proceedings, Vol. 11914 of Lecture Notes in Computer Science, Springer, 2019, pp. 84–98. doi:10.1007/978-3-030-34992-9_7

S. Cicerone, G. D. Stefano, L. Gasieniec, A. Navarra, Asynchronous rendezvous with different maps, in: K. Censor-Hillel, M. Flammini (Eds.), Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, L’Aquila, Italy, July 1-4, 2019, Proceedings, Vol. 11639 of Lecture Notes in Computer Science, Springer, 2019, pp. 154–169. doi:10.1007/ 978-3-030-24922-9_11

S. Cicerone, G. D. Stefano, A. Navarra, Gathering synchronous robots in graphs: From general properties to dense and symmetric topologies, in: K. Censor-Hillel, M. Flammini (Eds.), Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, L’Aquila, Italy, July 1-4, 2019, Proceedings, Vol. 11639 of Lecture Notes in Computer Science, Springer, 2019, pp. 170–184. doi:10.1007/978-3-030-24922-9_12

S. Cicerone, G. D. Stefano, L. Gasieniec, T. Jurdzinski, A. Navarra, T. Radzik, G. Stachowiak, Fair hitting sequence problem: Scheduling activities with varied frequency requirements, in: P. Heggernes (Ed.), Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings, Vol. 11485 of Lecture Notes in Computer Science, Springer, 2019, pp. 174–186. doi:10.1007/978-3-030-17402-6_15

S. Cicerone, M. D’Emidio, D. Frigioni, On mining distances in large-scale dynamic graphs, in: A. Aldini, M. Bernardo (Eds.), Proceedings of the 19th Italian Conference on Theoretical Computer Science, Urbino, Italy, September 18-20, 2018, Vol. 2243 of CEUR Workshop Proceedings, CEUR- WS.org, 2018, pp. 77–81. http://ceur-ws.org/Vol-2243/paper6.pdf

S. Cicerone, G. D. Stefano, A. Navarra, ”Semi-Asynchronous”: A new scheduler for robot based computing systems, in: 38th IEEE International Conference on Distributed Computing Systems, ICDCS 2018, Vienna, Austria, July 2-6, 2018, IEEE Computer Society, 2018, pp. 176–187. doi: 10.1109/ICDCS.2018.00027

S. Cicerone, G. D. Stefano, A. Navarra, Asynchronous embedded pattern formation without orientation, in: C. Gavoille, D. Ilcinkas (Eds.), Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings, Vol. 9888 of Lecture Notes in Computer Science, Springer, 2016, pp. 85–98. doi:10.1007/978-3-662-53426-7_7

S. Cicerone, G. D. Stefano, A. Navarra, Gathering of robots on meeting-points, in: P. Bose, L. A. Gasieniec, K. R ̈omer, R. Wattenhofer (Eds.), Algorithms for Sensor Systems - 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, Patras, Greece, September 17-18, 2015, Revised Selected Papers, Vol. 9536 of Lecture Notes in Computer Science, Springer, 2015, pp. 183–195. doi:10.1007/978-3-319-28472-9_14

S. Cicerone, G. D. Stefano, A. Navarra, Minmax-distance gathering on given meeting points, in: V. T. Paschos, P. Widmayer (Eds.), Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings, Vol. 9079 of Lecture Notes in Computer Science, Springer, 2015, pp. 127–139. doi:10.1007/978-3-319-18173-8_9

S. Cicerone, G. D. Stefano, A. Navarra, Minimum-traveled-distance gathering of oblivious robots over given meeting points, in: J. Gao, A. Efrat, S. P. Fekete, Y. Zhang (Eds.), Algorithms for Sensor Systems - 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2014, Wroclaw, Poland, September 12, 2014, Revised Selected Papers, Vol. 8847 of Lecture Notes in Computer Science, Springer, 2014, pp. 57–72. doi:10.1007/978-3-662-46018-4_4

S. Cicerone, G. D. Stefano, Decomposing octilinear polygons into triangles and rectangles, in: J. Akiyama, H. Ito, T. Sakai (Eds.), Discrete and Computational Geometry and Graphs - 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers, Vol. 8845 of Lecture Notes in Computer Science, Springer, 2013, pp. 18–30. doi: 10.1007/978-3-319-13287-7_3

S. Cicerone, M. Cermignani, Fast and simple approach for polygon schematization, in: B. Murgante, O. Gervasi, S. Misra, N. Nedjah, A. M. A. C. Rocha, D. Taniar, B. O. Apduhan (Eds.), Computational Science and Its Applications - ICCSA 2012 - 12th International Conference, Salvador de Bahia, Brazil, June 18-21, 2012, Proceedings, Part I, Vol. 7333 of Lecture Notes in Computer Science, Springer, 2012, pp. 267–279. doi:10.1007/978-3-642-31125-3_21

S. Cicerone, Using split composition to extend distance-hereditary graphs in a generative way - (extended abstract), in: M. Ogihara, J. Tarui (Eds.), Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings, Vol. 6648 of Lecture Notes in Computer Science, Springer, 2011, pp. 286–297. doi: 10.1007/978-3-642-20877-5_29

S. Cicerone, G. D’Angelo, G. D. Stefano, D. Frigioni, V. Maurizio, A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation, in: P. Festa (Ed.), Experimental Algorithms, 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings, Vol. 6049 of Lecture Notes in Computer Science, Springer, 2010, pp. 59–70. doi: 10.1007/978-3-642-13193-6_6

S. Cicerone, A. Orlandi, B. Archambeault, S. Connor, J. Fan, J. L. Drewniak, Cavities’ identification algorithm for power integrity analysis of complex boards, in: 20th International Zurich Symposium on Electromagnetic Compatibility, IEEE Computer Society, 2009, pp. 253–256. doi:10.1109/EMCZUR.2009.4783438

S. Cicerone, G. D. Stefano, M. Schachtebeck, A. Schobel, Dynamic algorithms for recoverable robustness problems, in: M. Fischetti, P. Widmayer (Eds.), ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Karlsruhe, Germany, September 18, 2008, Vol. 9 of OASICS, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2008. http://drops.dagstuhl.de/opus/volltexte/2008/1587

S. Cicerone, G. D’Angelo, G. D. Stefano, D. Frigioni, A. Navarra, Delay management problem: Complexity results and robust algorithms, in: B. Yang, D. Du, C. A. Wang (Eds.), Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John’s, NL, Canada, August 21-24, 2008. Proceedings, Vol. 5165 of Lecture Notes in Computer Science, Springer, 2008, pp. 458–468. doi:10.1007/978-3-540-85097-7_43

F. Bruera, S. Cicerone, G. D’Angelo, G. D. Stefano, D. Frigioni, Maintenance of multi-level over- lay graphs for timetable queries, in: C. Liebchen, R. K. Ahuja, J. A. Mesa (Eds.), ATMOS 2007 - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Sys- tems, November 15-16, 2007, Sevilla, Spain, Vol. 7 of OASICS, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007. http://drops.dagstuhl.de/opus/volltexte/2007/1171

S. Cicerone, G. D’Angelo, G. D. Stefano, D. Frigioni, A. Navarra, Robust algorithms and price of robustness in shunting problems, in: C. Liebchen, R. K. Ahuja, J. A. Mesa (Eds.), ATMOS 2007 - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, November 15-16, 2007, Sevilla, Spain, Vol. 7 of OASICS, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007. http://drops.dagstuhl.de/opus/volltexte/2007/1175

G. D’Angelo, S. Cicerone, G. D. Stefano, D. Frigioni, Partially dynamic concurrent update of distributed shortest paths, in: 2007 International Conference on Computing: Theory and Applications (ICCTA 2007), 5-7 March 2007, Kolkata, India, IEEE Computer Society, 2007, pp. 32–38. doi:10.1109/ICCTA.2007.101

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

S. Cicerone, E. Clementini, Extraction of qualitative information from the weighted walkthroughs, in: A. Voisard, S. Chen (Eds.), ACM-GIS 2002, Proceedings of the Tenth ACM International Symposium on Advances in Geographic Information Systems, McLean, VA (near Washington, DC), USA, USA, November 8-9, 2002, ACM, 2002, pp. 137–142. doi:10.1145/585147.585177

S. Cicerone, G. D’Ermiliis, G. D. Stefano, (k,+)-distance-hereditary graphs, in: A. Brandstadt, V. B. Le (Eds.), Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, Vol. 2204 of Lecture Notes in Computer Science, Springer, 2001, pp. 66–77. doi:10.1007/3-540-45477-2_8

S. Cicerone, P. D. Felice, Cardinal relations between regions with a broad boundary, in: K. Li, K. Makki, N. Pissinou, S. Ravada (Eds.), ACM-GIS 2000, Proceedings of the Eighth ACM Symposium on Advances in Geographic Information Systems, November 10-11, 2000, Washington D.C., USA, ACM, 2000, pp. 15–20. doi:10.1145/355274.355539

S. Cicerone, D. Frigioni, P. D. Felice, Decomposing spatial databases and applications, in: 11th International Workshop on Database and Expert Systems Applications (DEXA’00), 6-8 September 2000, Greenwich, London, UK, IEEE Computer Society, 2000, pp. 861–868. doi:10.1109/DEXA. 2000.875127

S. Cicerone, D. Frigioni, L. Tarantino, Interacting with geographic databases: A focus+context approach, in: 11th International Workshop on Database and Expert Systems Applications (DEXA’00), 6-8 September 2000, Greenwich, London, UK, IEEE Computer Society, 2000, pp. 869–875. doi: 10.1109/DEXA.2000.875128

S. Cicerone, G. D. Stefano, D. Frigioni, U. Nanni, A fully dynamic algorithm for distributed shortest paths, in: G. H. Gonnet, D. Panario, A. Viola (Eds.), LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings, Vol. 1776 of Lecture Notes in Computer Science, Springer, 2000, pp. 247–257. doi:10.1007/10719839_25

S. Cicerone, D. Frigioni, 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, Palazzo dell’Emiciclo, L’Aquila, Italy, 26-28 Giugno 2000, 2000, pp. 401–414.

S. Cicerone, G. D. Stefano, Networks with small stretch number, in: U. Brandes, D. Wagner (Eds.), Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, Vol. 1928 of Lecture Notes in Computer Science, Springer, 2000, pp. 95–106. doi:10.1007/3-540-40064-8_10

S. Cicerone, D. Frigioni, L. Tarantino, Supporting a focus+context interaction style for spatial databases, in: Q. Li, Z. M. O ̈zsoyoglu, R. R. Wagner, Y. Kambayashi, Y. Zhang (Eds.), WISE 2000, Proceedings of the First International Conference on Web Information Systems Engineering, Volume I (Main Program), Hong Kong, China, June 19-21, 2000, IEEE Computer Society, 2000, pp. 328–335. doi:10.1109/WISE.2000.882409

S. Cicerone, D. Frigioni, L. Tarantino, P. D. Felice, Interacting with topological invariants of spatial databases, in: 1999 International Symposium on Database Applications in Non-Traditional Environments (DANTE ’99), 28-30 November 1999, Kyoto, Japan, IEEE Computer Society, 1999, pp. 213–217. doi:10.1109/DANTE.1999.844962

S. Cicerone, G. D. Stefano, D. Handke, Survivable networks with bounded delay: The edge failure case, in: A. Aggarwal, C. P. Rangan (Eds.), Algorithms and Computation, 10th International Symposium, ISAAC ’99, Chennai, India, December 16-18, 1999, Proceedings, Vol. 1741 of Lecture Notes in Computer Science, Springer, 1999, pp. 205–214. doi:10.1007/3-540-46632-0_22

S. Cicerone, G. D. Stefano, M. Flammini, Compact-port routing models and applications to distance-hereditary graphs, in: C. Gavoille, J. Bermond, A. Raspaud (Eds.), SIROCCO’99, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999, Carleton Scientific, 1999, pp. 62–77.

S. Cicerone, G. D. Stefano, M. Flammini, Static and dynamic low-congested interval routing schemes, in: K. G. Larsen, S. Skyum, G. Winskel (Eds.), Automata, Languages and Programming, 25th International Colloquium, ICALP’98, Aalborg, Denmark, July 13-17, 1998, Proceedings, Vol. 1443 of Lecture Notes in Computer Science, Springer, 1998, pp. 592–603. doi:10.1007/BFb0055087

S. Cicerone, G. D. Stefano, Graphs with bounded induced distance, in: J. Hromkovic, O. Sy ́kora (Eds.), Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG ’98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, Vol. 1517 of Lecture Notes in Computer Science, Springer, 1998, pp. 177–191. doi:10.1007/10692760_15

S. Cicerone, G. D. Stefano, On the equivalence in complexity among basic problems on bipartite and parity graphs, in: H. W. Leong, H. Imai, S. Jain (Eds.), Algorithms and Computation, 8th International Symposium, ISAAC ’97, Singapore, December 17-19, 1997, Proceedings, Vol. 1350 of Lecture Notes in Computer Science, Springer, 1997, pp. 354–363. doi:10.1007/3-540-63890-3_38

S. Cicerone, D. Frigioni, U. Nanni, F. Pugliese, Counting edges in a dag, in: F. d’Amore, P. G. Franciosa, A. Marchetti-Spaccamela (Eds.), Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG ’96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, Vol. 1197 of Lecture Notes in Computer Science, Springer, 1996, pp. 85–100. doi:10.1007/3-540-62559-3_9

S. Cicerone, G. D. Stefano, Graph classes between parity and distance-hereditary graphs, in: D. S. Bridges, C. S. Calude, J. Gibbons, S. Reeves, I. H. Witten (Eds.), First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, DMTCS 1996, Auckland, New Zealand, December, 9-13, 1996, Springer-Verlag, Singapore, 1996, pp. 168–181.

S. Cicerone, F. Parisi-Presicce, Strategies in modular system design by interface rewriting, in: D. Sannella (Ed.), Programming Languages and Systems - ESOP’94, 5th European Symposium on Programming, Edinburgh, UK, April 11-13, 1994, Proceedings, Vol. 788 of Lecture Notes in Computer Science, Springer, 1994, pp. 165–179. doi:10.1007/3-540-57880-3_11

S. Badri, S. Cicerone, A. Di Fonso, and G. Di Stefano. An optimal algorithm for geodesic mutual visibility on hexagonal grids. CoRR, abs/2405.13615, 2024. arXiv:2405.13615

S. Cicerone, G. Di Stefano, S. Klavžar, and I. G. Yero. Mutual-visibility problems on graphs of diameter two. CoRR abs/2401.02373, 2024. arXiv: 2401.02373

S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, and F. Piselli. Mutual visibility in hypercube-like graphs. CoRR, abs/2308.14443, 2023. arXiv:2308.14443

S. Cicerone, A. Di Fonso, G. Di Stefano, and A. Navarra. Time-optimal geodesic mutual visibility of robots on grids within minimum area. CoRR, abs/2308.01855, 2023. arXiv:2308.01855

S. Cicerone, G. Di Stefano. Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. CoRR abs/2307.10661, 2023. arXiv: 2307.10661 

S. Cicerone, G. Di Stefano, S. Klavžar, L. Drozek, J. Hedzet and I. G. Yero. Variety of mutual-visibility problems in graphs. CoRR abs/2304.00864, 2023. arXiv: 2304.000864

S. Cicerone, G. Di Stefano, S. Klavžar, and I. G. Yero. Mutual-visibility in strong products of graphs via total mutual-visibility. CoRR abs/2210.07835, 2022. arXiv: 2210.07835

S. Cicerone, G. Di Stefano, and S. Klavžar. On the mutual visibility in Cartesian products and triangle-free graphs.  CoRR abs/2112.13024, 2021. arXiv:2112.13024

S. Cicerone, G. Di Stefano, and A. Navarra. A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study. CoRR, abs/2010.12463, 2020. arXiv:2010.14152  

S. Cicerone, A. Di Fonso, G. Di Stefano, and A. Navarra. Arbitrary pattern formation on infinite regular tessellation graphs. CoRR, abs/2010.14152, 2020. arXiv:2010.12463 

S. Cicerone, G. Di Stefano, and A. Navarra. Asynchronous pattern formation: the effects of a rigorous approach. CoRR, abs/1706.02474, 2017. arXiv:1706.02474