An Application of the MILFORD System to Handle Radiological Data. - Gabriele Di Stefano; M. V. Marabello; Alessandro D'Atri (CISM - Advances in Database Systems, 1993)

Analysis and implementation of a VLSI neural network. - Gian Carlo Cardarilli; Gabriele Di Stefano; G. Fabrizi; P. Marinucci (ICNN, 1995)

A Routing Algorithm for Networks Based on Distance-Hereditary Topologies. - Gabriele Di Stefano (SIROCCO, 1996)

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

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)

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)

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

A Graph Theoretical Approach To The Shunting Problem. - Gabriele Di Stefano; Magnus Love Koci (ATMOS, 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)

Platform Assignment. - Sabine Cornelsen; Gabriele Di Stefano (ATMOS, 2004)

Treelike Comparability Graphs: Characterization, Recognition, and Applications. - Sabine Cornelsen; Gabriele Di Stefano (WG, 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)

On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer. - Gabriele Di Stefano; Alberto Petricola; Christos D. Zaroliagis (ISPA, 2006)

On Minimum k-Modal Partitions of Permutations. - Gabriele Di Stefano; Stefan Krause; Marco E. Lübbecke; Uwe T. Zimmermann (LATIN, 2006)

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)

Track assignment. - Sabine Cornelsen; Gabriele Di Stefano (J. Discrete Algorithms, 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)

Online Bounded Coloring of Permutation and Overlap Graphs. - Marc Demange; Gabriele Di Stefano; Benjamin Leroy-Beaulieu (Electron. Notes Discret. Math., 2008)

A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks. - Gabriele Di Stefano; Alberto Petricola (J. Comput., 2008)

On minimum k-modal partitions of permutations. - Gabriele Di Stefano; Stefan Krause; Marco E. Lübbecke; Uwe T. Zimmermann (J. Discrete Algorithms, 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)

ATMOS 2009 Preface – 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. - Jens Clausen; Gabriele Di Stefano (ATMOS, 2009)

Recoverable Robust Timetables on Trees. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra; Maria Cristina Pinotti (COCOA, 2009)

Evaluation of Recoverable-Robust Timetables on Tree Networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (IWOCA, 2009)

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

Treelike comparability graphs. - Sabine Cornelsen; Gabriele Di Stefano (Discret. Appl. Math., 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)

Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (COCOA (2), 2010)

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)

Maximum flow and minimum-cost flow in multi-interface networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (ICUIMC, 2011)

Gathering of Six Robots on Anonymous Symmetric Rings. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (SIROCCO, 2011)

Min-Max Coverage in Multi-interface Networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (SOFSEM, 2011)

Bandwidth Constrained Multi-interface Networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (SOFSEM, 2011)

Recoverable Robust Timetables: An Algorithmic Approach on Trees. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra; Maria Cristina Pinotti (IEEE Trans. Computers, 2011)

Scintillae: How to Approach Computing Systems by Means of Cellular Automata. - Gabriele Di Stefano; Alfredo Navarra (ACRI, 2012)

Gathering of Robots on Anonymous Grids without Multiplicity Detection. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Ralf Klasing; Alfredo Navarra (SIROCCO, 2012)

How to Gather Asynchronous Oblivious Robots on Anonymous Rings. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (DISC, 2012)

Minimize the Maximum Duty in Multi-interface Networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (Algorithmica, 2012)

On the online track assignment problem. - Marc Demange; Gabriele Di Stefano; Benjamin Leroy-Beaulieu (Discret. Appl. Math., 2012)

Distance-hereditary comparability graphs. - Gabriele Di Stefano (Discret. Appl. Math., 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)

A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra; Nicolas Nisse; Karol Suchan (IPDPS Workshops, 2013)

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

Optimal Gathering of Oblivious Robots in Anonymous Graphs. - Gabriele Di Stefano; Alfredo Navarra (SIROCCO, 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)

Different Genetic Algorithms and the Evolution of Specialization: A Study with Groups of Simulated Neural Robots. - Tomassino Ferrauto; Domenico Parisi; Gabriele Di Stefano; Gianluca Baldassarre (Artif. Life, 2013)

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

Optimal Gathering on Infinite Grids. - Gabriele Di Stefano; Alfredo Navarra (SSS, 2014)

Gathering on rings under the Look-Compute-Move model. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (Distributed Comput., 2014)

The Game of Scintillae: From Cellular Automata to Computing and Cryptography Systems. - Gabriele Di Stefano; Alfredo Navarra (J. Cell. Autom., 2014)

Gathering six oblivious robots on anonymous symmetric rings. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (J. Discrete Algorithms, 2014)

Flow Problems in Multi-Interface Networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (IEEE Trans. Computers, 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)

About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings. - Gabriele Di Stefano; Pietro Montanari; Alfredo Navarra (IWOCA, 2015)

Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra; Nicolas Nisse; Karol Suchan (Algorithmica, 2015)

Improved Protocols for Luminous Asynchronous Robots. - Mattia D'Emidio; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (ICTCS, 2016)

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

Gathering of robots on anonymous grids and trees without multiplicity detection. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Ralf Klasing; Alfredo Navarra (Theor. Comput. Sci., 2016)

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

Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings. - Gabriele Di Stefano; Alfredo Navarra (Distributed Comput., 2017)

Gathering of oblivious robots on infinite grids with minimum traveled distance. - Gabriele Di Stefano; Alfredo Navarra (Inf. Comput., 2017)

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

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

Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane. - Mattia D'Emidio; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (Inf. 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)

Priority Scheduling in the Bamboo Garden Trimming Problem. - Mattia D'Emidio; Gabriele Di Stefano; Alfredo Navarra (SOFSEM, 2019)

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

Bamboo Garden Trimming Problem: Priority Schedulings. - Mattia D'Emidio; Gabriele Di Stefano; Alfredo Navarra (Algorithms, 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)

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)

"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)

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)

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

Mutual visibility in graphs. - Gabriele Di Stefano (Appl. Math. Comput., 2022)

A graph theoretical approach to the firebreak locating problem. - Marc Demange; Alessia Di Fonso; Gabriele Di Stefano; Pierpaolo Vittorini (Theor. Comput. Sci., 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)

Improved Algorithms for the Capacitated Team Orienteering Problem. - Gianlorenzo D'Angelo; Mattia D'Emidio; Esmaeil Delfaraz; Gabriele Di Stefano (ATMOS, 2024)

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)

On the general position number of Mycielskian graphs. - Elias John Thomas; S. V. Ullas Chandran; James Tuite; Gabriele Di Stefano (Discret. Appl. Math., 2024)

On monophonic position sets in graphs. - Elias John Thomas; S. V. Ullas Chandran; James Tuite; Gabriele Di Stefano (Discret. Appl. Math., 2024)

On the vertex position number of graphs. - Maya G. S. Thankachy; S. V. Ullas Chandran; James Tuite; Elias John Thomas; Gabriele Di Stefano; Grahame Erskine (Discuss. Math. Graph Theory, 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)

On the Approximability of Graph Visibility Problems. - Davide Bilò; Alessia Di Fonso; Gabriele Di Stefano; Stefano Leucci 001 (WALCOM, 2025)

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)

Lower general position sets in graphs. - Gabriele Di Stefano; Sandi Klavzar; Aditi Krishnakumar; James Tuite; Ismael G. Yero (Discuss. Math. Graph Theory, 2025)

Instantiating a Diffusion Network Model to Support Wildfire Management. - Marc Demange; Alessia Di Fonso; Gabriele Di Stefano; Pierpaolo Vittorini (IEEE Trans. Netw. Sci. Eng., 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)

About the infinite windy firebreak location problem. - Marc Demange; Alessia Di Fonso; Gabriele Di Stefano; Pierpaolo Vittorini (Discret. Appl. Math., 2026)