| 2026 | ALENEX | On Computing Top-k Simple Shortest Paths from a Single Source. | Mattia D'Emidio, Gabriele Di Stefano |
| 2025 | SSS | Brief Announcement: On the Impact of Unlimited Computational Power in 풪: Consequences for Synchronous Robots on Graphs. | Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra |
| 2025 | SSS | Gathering in Non-vertex-Transitive Graphs Under Round Robin. | Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra |
| 2025 | WALCOM | On the Approximability of Graph Visibility Problems. | Davide Bil, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci |
| 2024 | ATMOS | Improved Algorithms for the Capacitated Team Orienteering Problem. | Gianlorenzo D'Angelo, Mattia D'Emidio, Esmaeil Delfaraz, Gabriele Di Stefano |
| 2024 | SIROCCO | Mutual Visibility in Hypercube-Like Graphs. | Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli |
| 2024 | SSS | An Optimal Algorithm for Geodesic Mutual Visibility on Hexagonal Grids. | Sahar Badri, Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano |
| 2024 | SSS | Gathering of Robots in Butterfly Networks. | Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra |
| 2023 | ICDCN | The Geodesic Mutual Visibility Problem for Oblivious Robots: the case of Trees. | Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra |
| 2023 | LAGOS | Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. | Serafino Cicerone, Gabriele Di Stefano |
| 2023 | SSS | Time-Optimal Geodesic Mutual Visibility of Robots on Grids Within Minimum Area. | Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra |
| 2022 | Algosensors | Molecular Robots with Chirality on Grids. | Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra |
| 2021 | ICDCN | Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs. | Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra |
| 2019 | CIAC | 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 |
| 2019 | SIROCCO | Asynchronous Rendezvous with Different Maps. | Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Alfredo Navarra |
| 2019 | SIROCCO | Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies. | Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra |
| 2019 | SOFSEM | Priority Scheduling in the Bamboo Garden Trimming Problem. | Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra |
| 2019 | SSS | On Gathering of Semi-synchronous Robots in Graphs. | Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra |
| 2018 | ICDCS | "Semi-Asynchronous": A New Scheduler for Robot Based Computing Systems. | Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra |
| 2015 | Algosensors | Gathering of Robots on Meeting-Points. | Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra |
| 2015 | CIAC | MinMax-Distance Gathering on Given Meeting Points. | Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra |
| 2015 | IWOCA | About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings. | Gabriele Di Stefano, Pietro Montanari, Alfredo Navarra |
| 2014 | Algosensors | Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points. | Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra |
| 2014 | SSS | Optimal Gathering on Infinite Grids. | Gabriele Di Stefano, Alfredo Navarra |
| 2013 | SIROCCO | Optimal Gathering of Oblivious Robots in Anonymous Graphs. | Gabriele Di Stefano, Alfredo Navarra |
| 2012 | SIROCCO | Gathering of Robots on Anonymous Grids without Multiplicity Detection. | Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra |
| 2011 | SIROCCO | Gathering of Six Robots on Anonymous Symmetric Rings. | Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra |
| 2011 | SOFSEM | Min-Max Coverage in Multi-interface Networks. | Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra |
| 2011 | SOFSEM | Bandwidth Constrained Multi-interface Networks. | Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra |
| 2010 | COCOA | Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. | Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra |
| 2009 | ATMOS | ATMOS 2009 Preface -- 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. | Jens Clausen, Gabriele Di Stefano |
| 2009 | COCOA | Recoverable Robust Timetables on Trees. | Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti |
| 2009 | IWOCA | Evaluation of Recoverable-Robust Timetables on Tree Networks. | Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra |
| 2008 | ATMOS | Dynamic Algorithms for Recoverable Robustness Problems. | Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schbel |
| 2008 | COCOA | Delay Management Problem: Complexity Results and Robust Algorithms. | Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra |
| 2007 | ATMOS | Maintenance of Multi-level Overlay Graphs for Timetable Queries. | Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni |
| 2007 | ATMOS | Robust Algorithms and Price of Robustness in Shunting Problems. | Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra |
| 2006 | ISPA | On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer. | Gabriele Di Stefano, Alberto Petricola, Christos D. Zaroliagis |
| 2006 | LATIN | On Minimum | Gabriele Di Stefano, Stefan Krause, Marco E. Lbbecke, Uwe T. Zimmermann |
| 2004 | ATMOS | Platform Assignment. | Sabine Cornelsen, Gabriele Di Stefano |
| 2004 | WG | Treelike Comparability Graphs: Characterization, Recognition, and Applications. | Sabine Cornelsen, Gabriele Di Stefano |
| 2001 | WG | (k, +)-Distance-Hereditary Graphs. | Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano |
| 2000 | LATIN | A Fully Dynamic Algorithm for Distributed Shortest Paths. | Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni |
| 2000 | WG | Networks with Small Stretch Number. | Serafino Cicerone, Gabriele Di Stefano |
| 1999 | ISAAC | Survivable Networks with Bounded Delay: The Edge Failure Case. | Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke |
| 1999 | SIROCCO | Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. | Serafino Cicerone, Gabriele Di Stefano, Michele Flammini |
| 1998 | ICALP | Static and Dynamic Low-Congested Interval Routing Schemes. | Serafino Cicerone, Gabriele Di Stefano, Michele Flammini |
| 1998 | WG | Graphs with Bounded Induced Distance. | Serafino Cicerone, Gabriele Di Stefano |
| 1997 | ISAAC | On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. | Serafino Cicerone, Gabriele Di Stefano |
| 1996 | SIROCCO | A Routing Algorithm for Networks Based on Distance-Hereditary Topologies. | Gabriele Di Stefano |