Strategies in Modular System Design by Interface Rewriting. - Serafino Cicerone; Francesco Parisi-Presicce (ESOP, 1994)

Counting Edges in a Dag. - Serafino Cicerone; Daniele Frigioni; Umberto Nanni; Francesco Pugliese (WG, 1996)

On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. - Serafino Cicerone; Gabriele Di Stefano (ISAAC, 1997)

On the Complexity of Specification Morphisms. - Serafino Cicerone; Francesco Parisi-Presicce (Theor. Comput. Sci., 1997)

A Uniform Approach to Semi-Dynamic Problems on Digraphs. - Serafino Cicerone; Daniele Frigioni; Umberto Nanni; Francesco Pugliese (Theor. Comput. Sci., 1998)

Interacting with Topological Invariants of Spatial Databases. - Serafino Cicerone; Daniele Frigioni; Laura Tarantino; Paolino Di Felice (DANTE, 1999)

Survivable Networks with Bounded Delay: The Edge Failure Case. - Serafino Cicerone; Gabriele Di Stefano; Dagmar Handke (ISAAC, 1999)

On the Extension of Bipartite to Parity Graphs. - Serafino Cicerone; Gabriele Di Stefano (Discret. Appl. Math., 1999)

Graph Classes Between Parity and Distance-hereditary Graphs. - Serafino Cicerone; Gabriele Di Stefano (Discret. Appl. Math., 1999)

Decomposing Spatial Databases and Applications. - Serafino Cicerone; Daniele Frigioni; Paolino Di Felice (DEXA Workshop, 2000)

Interacting with Geographic Databases: A Focus+Context Approach. - Serafino Cicerone; Daniele Frigioni; Laura Tarantino (DEXA Workshop, 2000)

Cardinal relations between regions with a broad boundary. - Serafino Cicerone; Paolino Di Felice (ACM-GIS, 2000)

On the formalization of zoom-based interaction with geographic databases. - Serafino Cicerone; Daniele Frigioni; Laura Tarantino (SEBD, 2000)

Supporting a Focus+Context Interaction Style for Spatial Databases. - Serafino Cicerone; Daniele Frigioni; Laura Tarantino (WISE, 2000)

Low-congested interval routing schemes for hypercubelike networks. - Serafino Cicerone; Gabriele Di Stefano; Michele Flammini (Networks, 2000)

(k, +)-Distance-Hereditary Graphs. - Serafino Cicerone; Gianluca D'Ermiliis; Gabriele Di Stefano (WG, 2001)

Graphs with bounded induced distance. - Serafino Cicerone; Gabriele Di Stefano (Discret. Appl. Math., 2001)

Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. - Serafino Cicerone; Gabriele Di Stefano; Michele Flammini (J. Parallel Distributed Comput., 2001)

Extraction of qualitative information from the weighted walkthroughs. - Serafino Cicerone; Eliseo Clementini (ACM-GIS, 2002)

A general strategy for decomposing topological invariants of spatial databases and an application. - Serafino Cicerone; Daniele Frigioni; Paolino Di Felice (Data Knowl. Eng., 2002)

Static and dynamic low-congested interval routing schemes. - Serafino Cicerone; Gabriele Di Stefano; Michele Flammini (Theor. Comput. Sci., 2002)

Efficient Estimation of Qualitative Topological Relations based on the Weighted Walkthroughs Model. - Serafino Cicerone; Eliseo Clementini (GeoInformatica, 2003)

(k, +)-distance-hereditary graphs. - Serafino Cicerone; Gabriele Di Stefano (J. Discrete Algorithms, 2003)

A fully dynamic algorithm for distributed shortest paths. - Serafino Cicerone; Gabriele Di Stefano; Daniele Frigioni; Umberto Nanni (Theor. Comput. Sci., 2003)

Cardinal directions between spatial objects: the pairwise-consistency problem. - Serafino Cicerone; Paolino Di Felice (Inf. Sci., 2004)

Networks with small stretch number. - Serafino Cicerone; Gabriele Di Stefano (J. Discrete Algorithms, 2004)

Self-spanner graphs. - Serafino Cicerone; Gabriele Di Stefano; Dagmar Handke (Discret. Appl. Math., 2005)

Maintenance of Multi-level Overlay Graphs for Timetable Queries. - Francesco Bruera; Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni (ATMOS, 2007)

Robust Algorithms and Price of Robustness in Shunting Problems. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (ATMOS, 2007)

Partially Dynamic Concurrent Update of Distributed Shortest Paths. - Gianlorenzo D'Angelo; Serafino Cicerone; Gabriele Di Stefano; Daniele Frigioni (ICCTA, 2007)

Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alberto Petricola (J. Comput., 2007)

Dynamic Algorithms for Recoverable Robustness Problems. - Serafino Cicerone; Gabriele Di Stefano; Michael Schachtebeck; Anita Schöbel (ATMOS, 2008)

Delay Management Problem: Complexity Results and Robust Algorithms. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (COCOA, 2008)

Dynamic Multi-level Overlay Graphs for Shortest Paths. - Francesco Bruera; Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni (Math. Comput. Sci., 2008)

Recoverable Robustness for Train Shunting Problems. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (Algorithmic Oper. Res., 2009)

Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (J. Comb. Optim., 2009)

Recoverable Robustness in Shunting and Timetabling. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra; Michael Schachtebeck; Anita Schöbel (Robust and Online Large-Scale Optimization, 2009)

A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Vinicio Maurizio (SEA, 2010)

Partially dynamic efficient algorithms for distributed shortest paths. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni (Theor. Comput. Sci., 2010)

Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way - (Extended Abstract). - Serafino Cicerone (TAMC, 2011)

Characterizations of Graphs with Stretch Number less than 2. - Serafino Cicerone (Electron. Notes Discret. Math., 2011)

Fast and Simple Approach for Polygon Schematization. - Serafino Cicerone; Matteo Cermignani (ICCSA (1), 2012)

Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances. - Serafino Cicerone; Gabriele Di Stefano; Michael Schachtebeck; Anita Schöbel (Inf. Sci., 2012)

Decomposing Octilinear Polygons into Triangles and Rectangles. - Serafino Cicerone; Gabriele Di Stefano (JCDCGG, 2013)

Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Vinicio Maurizio (Algorithmica, 2013)

Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (ALGOSENSORS, 2014)

Gathering of Robots on Meeting-Points. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (ALGOSENSORS, 2015)

MinMax-Distance Gathering on Given Meeting Points. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (CIAC, 2015)

Asynchronous Embedded Pattern Formation Without Orientation. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (DISC, 2016)

Asynchronous Pattern Formation: the effects of a rigorous approach. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (CoRR, 2017)

"Semi-Asynchronous": A New Scheduler for Robot Based Computing Systems. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (ICDCS, 2018)

On Mining Distances in Large-Scale Dynamic Graphs. - Serafino Cicerone; Mattia D'Emidio; Daniele Frigioni (ICTCS, 2018)

Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (Distributed Comput., 2018)

Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements. - Serafino Cicerone; Gabriele Di Stefano; Leszek Gasieniec; Tomasz Jurdzinski; Alfredo Navarra; Tomasz Radzik; Grzegorz Stachowiak (CIAC, 2019)

Asynchronous Rendezvous with Different Maps. - Serafino Cicerone; Gabriele Di Stefano; Leszek Gasieniec; Alfredo Navarra (SIROCCO, 2019)

Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (SIROCCO, 2019)

On Gathering of Semi-synchronous Robots in Graphs. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (SSS, 2019)

Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (Distributed Comput., 2019)

Embedded pattern formation by asynchronous robots without chirality. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (Distributed Comput., 2019)

Approximation algorithms for decomposing octilinear polygons. - Serafino Cicerone; Gabriele Di Stefano (Theor. Comput. Sci., 2019)

Asynchronous Robots on Graphs: Gathering. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (Distributed Computing by Mobile Entities, 2019)

On Building Networks with Limited Stretch Factor. - Serafino Cicerone (AINA Workshops, 2020)

Breaking Symmetries on Tessellation Graphs via Asynchronous Robots. - Serafino Cicerone (ICTCS, 2020)

A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (CoRR, 2020)

MOBLOT: Molecular Oblivious Robots. - Serafino Cicerone; Alessia Di Fonso; Gabriele Di Stefano; Alfredo Navarra (AAMAS, 2021)

Breaking Symmetries on Tessellation Graphs via Asynchronous Robots: The Line Formation Problem as a Case Study. - Serafino Cicerone (IEEE Access, 2021)

"Semi-Asynchronous": A New Scheduler in Distributed Computing. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (IEEE Access, 2021)

Solving the Pattern Formation by Mobile Robots With Chirality. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (IEEE Access, 2021)

A Quasi-Hole Detection Algorithm for Recognizing k-Distance-Hereditary Graphs, with k < 2. - Serafino Cicerone (Algorithms, 2021)

Special Issue on "Graph Algorithms and Applications". - Serafino Cicerone; Gabriele Di Stefano (Algorithms, 2021)

On the effectiveness of the genetic paradigm for polygonization. - Serafino Cicerone; Mattia D'Emidio; Gabriele Di Stefano; Alfredo Navarra (Inf. Process. Lett., 2021)

A structured methodology for designing distributed algorithms for mobile entities. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (Inf. Sci., 2021)

Getting new algorithmic results by extending distance-hereditary graphs via split composition. - Serafino Cicerone; Gabriele Di Stefano (PeerJ Comput. Sci., 2021)

Gathering robots in graphs: The central role of synchronicity. - Serafino Cicerone; Gabriele Di Stefano; Alfredo Navarra (Theor. Comput. Sci., 2021)

Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem. - Serafino Cicerone; Mattia D'Emidio; Daniele Frigioni; Filippo Tirabassi Pascucci (ACM Trans. Spatial Algorithms Syst., 2021)

Molecular Robots with Chirality on Grids. - Serafino Cicerone; Alessia Di Fonso; Gabriele Di Stefano; Alfredo Navarra (ALGOSENSORS, 2022)

The Geodesic Mutual Visibility Problem for Oblivious Robots: the case of Trees. - Serafino Cicerone; Alessia Di Fonso; Gabriele Di Stefano; Alfredo Navarra (ICDCN, 2023)

Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. - Serafino Cicerone; Gabriele Di Stefano (LAGOS, 2023)

Time-Optimal Geodesic Mutual Visibility of Robots on Grids Within Minimum Area. - Serafino Cicerone; Alessia Di Fonso; Gabriele Di Stefano; Alfredo Navarra (SSS, 2023)

Molecular Oblivious Robots: A New Model for Robots With Assembling Capabilities. - Serafino Cicerone; Alessia Di Fonso; Gabriele Di Stefano; Alfredo Navarra (IEEE Access, 2023)

On the mutual visibility in Cartesian products and triangle-free graphs. - Serafino Cicerone; Gabriele Di Stefano; Sandi Klavzar (Appl. Math. Comput., 2023)

Arbitrary pattern formation on infinite regular tessellation graphs. - Serafino Cicerone; Alessia Di Fonso; Gabriele Di Stefano; Alfredo Navarra (Theor. Comput. Sci., 2023)

Variety of mutual-visibility problems in graphs. - Serafino Cicerone; Gabriele Di Stefano; Lara Drozdek; Jaka Hedzet; Sandi Klavzar; Ismael G. Yero (Theor. Comput. Sci., 2023)

The geodesic mutual visibility problem: Oblivious robots on grids and trees. - Serafino Cicerone; Alessia Di Fonso; Gabriele Di Stefano; Alfredo Navarra (Pervasive Mob. Comput., 2023)

Mutual Visibility in Hypercube-Like Graphs. - Serafino Cicerone; Alessia Di Fonso; Gabriele Di Stefano; Alfredo Navarra; Francesco Piselli (SIROCCO, 2024)

An Optimal Algorithm for Geodesic Mutual Visibility on Hexagonal Grids. - Sahar Badri; Serafino Cicerone; Alessia Di Fonso; Gabriele Di Stefano (SSS, 2024)

Gathering of Robots in Butterfly Networks. - Serafino Cicerone; Alessia Di Fonso; Gabriele Di Stefano; Alfredo Navarra (SSS, 2024)

Mutual-visibility in strong products of graphs via total mutual-visibility. - Serafino Cicerone; Gabriele Di Stefano; Sandi Klavzar; Ismael G. Yero (Discret. Appl. Math., 2024)

Mutual-visibility problems on graphs of diameter two. - Serafino Cicerone; Gabriele Di Stefano; Sandi Klavzar; Ismael G. Yero (Eur. J. Comb., 2024)

Molecular pattern formation on grids in the Moblot model. - Serafino Cicerone; Alessia Di Fonso; Gabriele Di Stefano; Alfredo Navarra (Theor. Comput. Sci., 2024)

Mutual and total mutual visibility in hypercube-like graphs. - Serafino Cicerone; Alessia Di Fonso; Gabriele Di Stefano; Alfredo Navarra; Francesco Piselli (Appl. Math. Comput., 2025)

Characterizing and computing in linear time mutual-visibility parameters in distance-hereditary graphs. - Serafino Cicerone; Gabriele Di Stefano (Discret. Appl. Math., 2025)

Burning some myths on privacy properties of social networks against active attacks. - Serafino Cicerone; Gabriele Di Stefano; Sandi Klavzar; Ismael G. Yero (CoRR, 2025)