Serafino Cicerone

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 47

Top Venues

Publications

Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero
Mutual-visibility problems on graphs of diameter two. Eur. J. Comb. 120 (2024)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli
Mutual Visibility in Hypercube-Like Graphs. SIROCCO (2024)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
Molecular pattern formation on grids in the Moblot model. Theor. Comput. Sci. 996 (2024)
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero
Mutual-visibility in strong products of graphs via total mutual-visibility. Discret. Appl. Math. 358 (2024)
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero
Mutual-visibility problems on graphs of diameter two. CoRR (2024)
Sahar Badri, Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano
An optimal algorithm for geodesic mutual visibility on hexagonal grids. CoRR (2024)
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar
On the mutual visibility in Cartesian products and triangle-free graphs. Appl. Math. Comput. 438 (2023)
Serafino Cicerone, Gabriele Di Stefano, Lara Drozdek, Jaka Hedzet, Sandi Klavzar, Ismael G. Yero
Variety of mutual-visibility problems in graphs. Theor. Comput. Sci. 974 (2023)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
Molecular Oblivious Robots: A New Model for Robots With Assembling Capabilities. IEEE Access 11 (2023)
Serafino Cicerone, Gabriele Di Stefano
Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. CoRR (2023)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
Arbitrary pattern formation on infinite regular tessellation graphs. Theor. Comput. Sci. 942 (2023)
Serafino Cicerone, Gabriele Di Stefano, Lara Drozek, Jaka Hedzet, Sandi Klavzar, Ismael G. Yero
Variety of mutual-visibility problems in graphs. CoRR (2023)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
Time-Optimal Geodesic Mutual Visibility of Robots on Grids Within Minimum Area. SSS (2023)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
The Geodesic Mutual Visibility Problem for Oblivious Robots: the case of Trees. ICDCN (2023)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
The geodesic mutual visibility problem: Oblivious robots on grids and trees. Pervasive Mob. Comput. 95 (2023)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
Time-optimal geodesic mutual visibility of robots on grids within minimum area. CoRR (2023)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli
Mutual visibility in hypercube-like graphs. CoRR (2023)
Serafino Cicerone, Gabriele Di Stefano
Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. LAGOS (2023)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
Molecular Robots with Chirality on Grids. ALGOSENSORS (2022)
Serafino Cicerone
A Quasi-Hole Detection Algorithm for Recognizing k-Distance-Hereditary Graphs, with k < 2. Algorithms 14 (4) (2021)
Serafino Cicerone
Breaking Symmetries on Tessellation Graphs via Asynchronous Robots: The Line Formation Problem as a Case Study. IEEE Access 9 (2021)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Gathering robots in graphs: The central role of synchronicity. Theor. Comput. Sci. 849 (2021)
Serafino Cicerone, Gabriele Di Stefano
Special Issue on "Graph Algorithms and Applications". Algorithms 14 (5) (2021)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs. ICDCN (2021)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
MOBLOT: Molecular Oblivious Robots. AAMAS (2021)
Serafino Cicerone, Gabriele Di Stefano
Getting new algorithmic results by extending distance-hereditary graphs via split composition. PeerJ Comput. Sci. 7 (2021)
Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni, Filippo Tirabassi Pascucci
Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem. ACM Trans. Spatial Algorithms Syst. 7 (4) (2021)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
"Semi-Asynchronous": A New Scheduler in Distributed Computing. IEEE Access 9 (2021)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
A structured methodology for designing distributed algorithms for mobile entities. Inf. Sci. 574 (2021)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Solving the Pattern Formation by Mobile Robots With Chirality. IEEE Access 9 (2021)
Serafino Cicerone, Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra
On the effectiveness of the genetic paradigm for polygonization. Inf. Process. Lett. 171 (2021)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study. CoRR (2020)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs. CoRR (2020)
Serafino Cicerone
On Building Networks with Limited Stretch Factor. AINA Workshops (2020)
Serafino Cicerone
Breaking Symmetries on Tessellation Graphs via Asynchronous Robots. ICTCS (2020)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
On Gathering of Semi-synchronous Robots in Graphs. SSS (2019)
Serafino Cicerone, Gabriele Di Stefano
Approximation algorithms for decomposing octilinear polygons. Theor. Comput. Sci. 779 (2019)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies. SIROCCO (2019)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Embedded pattern formation by asynchronous robots without chirality. Distributed Comput. 32 (4) (2019)
Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Alfredo Navarra
Asynchronous Rendezvous with Different Maps. SIROCCO (2019)
Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik, Grzegorz Stachowiak
Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements. CIAC (2019)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach. Distributed Comput. 32 (2) (2019)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. Distributed Comput. 31 (1) (2018)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
"Semi-Asynchronous": A New Scheduler for Robot Based Computing Systems. ICDCS (2018)
Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni
On Mining Distances in Large-Scale Dynamic Graphs. ICTCS (2018)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Asynchronous Pattern Formation: the effects of a rigorous approach. CoRR (2017)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Asynchronous Embedded Pattern Formation Without Orientation. DISC (2016)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
MinMax-Distance Gathering on Given Meeting Points. CIAC (2015)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Gathering of Robots on Meeting-Points. ALGOSENSORS (2015)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points. ALGOSENSORS (2014)
Serafino Cicerone, Gabriele Di Stefano
Decomposing Octilinear Polygons into Triangles and Rectangles. JCDCGG (2013)
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Algorithmica 66 (1) (2013)
Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel
Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances. Inf. Sci. 190 (2012)
Serafino Cicerone, Matteo Cermignani
Fast and Simple Approach for Polygon Schematization. ICCSA (1) (2012)
Serafino Cicerone
Characterizations of Graphs with Stretch Number less than 2. Electron. Notes Discret. Math. 37 (2011)
Serafino Cicerone
Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way - (Extended Abstract). TAMC (2011)
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. SEA (2010)
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
Partially dynamic efficient algorithms for distributed shortest paths. Theor. Comput. Sci. 411 (7-9) (2010)
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
Recoverable Robustness for Train Shunting Problems. Algorithmic Oper. Res. 4 (2) (2009)
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. J. Comb. Optim. 18 (3) (2009)
Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel
Dynamic Algorithms for Recoverable Robustness Problems. ATMOS (2008)
Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
Dynamic Multi-level Overlay Graphs for Shortest Paths. Math. Comput. Sci. 1 (4) (2008)
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
Delay Management Problem: Complexity Results and Robust Algorithms. COCOA (2008)
Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni
Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA (2007)
Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
Maintenance of Multi-level Overlay Graphs for Timetable Queries. ATMOS (2007)
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alberto Petricola
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. J. Comput. 2 (9) (2007)
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS (2007)
Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke
Self-spanner graphs. Discret. Appl. Math. 150 (1-3) (2005)
Serafino Cicerone, Paolino Di Felice
Cardinal directions between spatial objects: the pairwise-consistency problem. Inf. Sci. 164 (1-4) (2004)
Serafino Cicerone, Gabriele Di Stefano
Networks with small stretch number. J. Discrete Algorithms 2 (4) (2004)
Serafino Cicerone, Gabriele Di Stefano
(k, +)-distance-hereditary graphs. J. Discrete Algorithms 1 (3-4) (2003)
Serafino Cicerone, Eliseo Clementini
Efficient Estimation of Qualitative Topological Relations based on the Weighted Walkthroughs Model. GeoInformatica 7 (3) (2003)
Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
A fully dynamic algorithm for distributed shortest paths. Theor. Comput. Sci. 297 (1-3) (2003)
Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
Static and dynamic low-congested interval routing schemes. Theor. Comput. Sci. 276 (1-2) (2002)
Serafino Cicerone, Eliseo Clementini
Extraction of qualitative information from the weighted walkthroughs. ACM-GIS (2002)
Serafino Cicerone, Daniele Frigioni, Paolino Di Felice
A general strategy for decomposing topological invariants of spatial databases and an application. Data Knowl. Eng. 42 (1) (2002)
Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. J. Parallel Distributed Comput. 61 (10) (2001)
Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano
(k, +)-Distance-Hereditary Graphs. WG (2001)
Serafino Cicerone, Gabriele Di Stefano
Graphs with bounded induced distance. Discret. Appl. Math. 108 (1-2) (2001)
Serafino Cicerone, Daniele Frigioni, Laura Tarantino
Supporting a Focus+Context Interaction Style for Spatial Databases. WISE (2000)
Serafino Cicerone, Daniele Frigioni, Laura Tarantino
Interacting with Geographic Databases: A Focus+Context Approach. DEXA Workshop (2000)
Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN (2000)
Serafino Cicerone, Daniele Frigioni, Laura Tarantino
On the formalization of zoom-based interaction with geographic databases. SEBD (2000)
Serafino Cicerone, Daniele Frigioni, Paolino Di Felice
Decomposing Spatial Databases and Applications. DEXA Workshop (2000)
Serafino Cicerone, Gabriele Di Stefano
Networks with Small Stretch Number. WG (2000)
Serafino Cicerone, Paolino Di Felice
Cardinal relations between regions with a broad boundary. ACM-GIS (2000)
Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
Low-congested interval routing schemes for hypercubelike networks. Networks 36 (3) (2000)
Serafino Cicerone, Gabriele Di Stefano
Graph Classes Between Parity and Distance-hereditary Graphs. Discret. Appl. Math. 95 (1-3) (1999)
Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. SIROCCO (1999)
Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke
Survivable Networks with Bounded Delay: The Edge Failure Case. ISAAC (1999)
Serafino Cicerone, Gabriele Di Stefano
On the Extension of Bipartite to Parity Graphs. Discret. Appl. Math. 95 (1-3) (1999)
Serafino Cicerone, Daniele Frigioni, Laura Tarantino, Paolino Di Felice
Interacting with Topological Invariants of Spatial Databases. DANTE (1999)
Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
Static and Dynamic Low-Congested Interval Routing Schemes. ICALP (1998)
Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
A Uniform Approach to Semi-Dynamic Problems on Digraphs. Theor. Comput. Sci. 203 (1) (1998)
Serafino Cicerone, Gabriele Di Stefano
Graphs with Bounded Induced Distance. WG (1998)
Serafino Cicerone, Francesco Parisi-Presicce
On the Complexity of Specification Morphisms. Theor. Comput. Sci. 189 (1-2) (1997)
Serafino Cicerone, Gabriele Di Stefano
On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. ISAAC (1997)
Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
Counting Edges in a Dag. WG (1996)
Serafino Cicerone, Gabriele Di Stefano
Graph Classes between Parity and Distance-Hereditary Graphs. DMTCS (1996)
Serafino Cicerone, Francesco Parisi-Presicce
Strategies in Modular System Design by Interface Rewriting. ESOP (1994)

Serafino Cicerone.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Serafino Cicerone