Gabriele Di Stefano

157 papers A* 1A 5B 21C 26Misc 2Journal 89Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	About the infinite windy firebreak location problem. Discret. Appl. Math. Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini
2026	A	`conf`	On Computing Top-k Simple Shortest Paths from a Single Source. ALENEX Mattia D'Emidio, Gabriele Di Stefano
2026	J	`jnl`	On the approximability of graph visibility problems. Theor. Comput. Sci. Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci
2025	C	`conf`	Brief Announcement: On the Impact of Unlimited Computational Power in 풪: Consequences for Synchronous Robots on Graphs. SSS Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2025	J	`jnl`	Burning some myths on privacy properties of social networks against active attacks. CoRR Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero
2025	J	`jnl`	Characterizing and computing in linear time mutual-visibility parameters in distance-hereditary graphs. Discret. Appl. Math. Serafino Cicerone, Gabriele Di Stefano
2025	J	`jnl`	Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks. CoRR Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Gang Zhang
2025	J	`jnl`	Gathering in Non-Vertex-Transitive Graphs Under Round Robin. CoRR Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2025	C	`conf`	Gathering in Non-vertex-Transitive Graphs Under Round Robin. SSS Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2025	J	`jnl`	Gathering in Vertex- and Edge-Transitive Graphs without Multiplicity Detection under Round Robin. CoRR Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2025	J	`jnl`	Instantiating a Diffusion Network Model to Support Wildfire Management. IEEE Trans. Netw. Sci. Eng. Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini
2025	J	`jnl`	Lower general position sets in graphs. Discuss. Math. Graph Theory Gabriele Di Stefano, Sandi Klavzar, Aditi Krishnakumar, James Tuite, Ismael G. Yero
2025	J	`jnl`	Mutual and total mutual visibility in hypercube-like graphs. Appl. Math. Comput. Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli
2025	J	`jnl`	On Computing Top- CoRR Mattia D'Emidio, Gabriele Di Stefano
2025	B	`conf`	On the Approximability of Graph Visibility Problems. WALCOM Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci
2025	J	`jnl`	On the impact of unlimited computational power in OBLOT: consequences for synchronous robots on graphs. CoRR Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2025	J	`jnl`	Optimal gathering of robots in anonymous butterfly networks via leader election. Theor. Comput. Sci. Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2025	J	`jnl`	The vertex visibility number of graphs. CoRR Dhanya Roy, Gabriele Di Stefano, Sandi Klavzar, S. Aparna Lakshmanan
2024	C	`conf`	An Optimal Algorithm for Geodesic Mutual Visibility on Hexagonal Grids. SSS Sahar Badri, Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano
2024	J	`jnl`	An optimal algorithm for geodesic mutual visibility on hexagonal grids. CoRR Sahar Badri, Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano
2024	C	`conf`	Gathering of Robots in Butterfly Networks. SSS Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2024	C	`conf`	Improved Algorithms for the Capacitated Team Orienteering Problem. ATMOS Gianlorenzo D'Angelo, Mattia D'Emidio, Esmaeil Delfaraz, Gabriele Di Stefano
2024	J	`jnl`	Molecular pattern formation on grids in the Moblot model. Theor. Comput. Sci. Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2024	B	`conf`	Mutual Visibility in Hypercube-Like Graphs. SIROCCO Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli
2024	J	`jnl`	Mutual-visibility in strong products of graphs via total mutual-visibility. Discret. Appl. Math. Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero
2024	J	`jnl`	Mutual-visibility problems on graphs of diameter two. CoRR Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero
2024	J	`jnl`	Mutual-visibility problems on graphs of diameter two. Eur. J. Comb. Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero
2024	J	`jnl`	On monophonic position sets in graphs. Discret. Appl. Math. Elias John Thomas, S. V. Ullas Chandran, James Tuite, Gabriele Di Stefano
2024	J	`jnl`	On the approximability of graph visibility problems. CoRR Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci
2024	J	`jnl`	On the general position number of Mycielskian graphs. Discret. Appl. Math. Elias John Thomas, S. V. Ullas Chandran, James Tuite, Gabriele Di Stefano
2024	J	`jnl`	On the vertex position number of graphs. Discuss. Math. Graph Theory Maya G. S. Thankachy, S. V. Ullas Chandran, James Tuite, Elias John Thomas, Gabriele Di Stefano, Grahame Erskine
2023	J	`jnl`	Arbitrary pattern formation on infinite regular tessellation graphs. Theor. Comput. Sci. Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2023	J	`jnl`	Molecular Oblivious Robots: A New Model for Robots With Assembling Capabilities. IEEE Access Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2023	J	`jnl`	Mutual visibility in hypercube-like graphs. CoRR Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli
2023	C	`conf`	Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. LAGOS Serafino Cicerone, Gabriele Di Stefano
2023	J	`jnl`	Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. CoRR Serafino Cicerone, Gabriele Di Stefano
2023	J	`jnl`	On the mutual visibility in Cartesian products and triangle-free graphs. Appl. Math. Comput. Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar
2023	Misc	`conf`	The Geodesic Mutual Visibility Problem for Oblivious Robots: the case of Trees. ICDCN Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2023	J	`jnl`	The geodesic mutual visibility problem: Oblivious robots on grids and trees. Pervasive Mob. Comput. Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2023	C	`conf`	Time-Optimal Geodesic Mutual Visibility of Robots on Grids Within Minimum Area. SSS Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2023	J	`jnl`	Time-optimal geodesic mutual visibility of robots on grids within minimum area. CoRR Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2023	J	`jnl`	Variety of mutual-visibility problems in graphs. CoRR Serafino Cicerone, Gabriele Di Stefano, Lara Drozdek, Jaka Hedzet, Sandi Klavzar, Ismael G. Yero
2023	J	`jnl`	Variety of mutual-visibility problems in graphs. Theor. Comput. Sci. Serafino Cicerone, Gabriele Di Stefano, Lara Drozdek, Jaka Hedzet, Sandi Klavzar, Ismael G. Yero
2022	J	`jnl`	A graph theoretical approach to the firebreak locating problem. Theor. Comput. Sci. Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini
2022	J	`jnl`	About the Infinite Windy Firebreak Location problem. CoRR Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini
2022	C	`conf`	Molecular Robots with Chirality on Grids. ALGOSENSORS Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2022	J	`jnl`	Mutual visibility in graphs. Appl. Math. Comput. Gabriele Di Stefano
2021	J	`jnl`	"Semi-Asynchronous": A New Scheduler in Distributed Computing. IEEE Access Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2021	J	`jnl`	A graph theoretical approach to the firebreak locating problem. CoRR Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini
2021	J	`jnl`	A structured methodology for designing distributed algorithms for mobile entities. Inf. Sci. Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2021	Misc	`conf`	Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs. ICDCN Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2021	J	`jnl`	Gathering robots in graphs: The central role of synchronicity. Theor. Comput. Sci. Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2021	J	`jnl`	Getting new algorithmic results by extending distance-hereditary graphs via split composition. PeerJ Comput. Sci. Serafino Cicerone, Gabriele Di Stefano
2021	A	`conf`	MOBLOT: Molecular Oblivious Robots. AAMAS Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2021	J	`jnl`	Mutual Visibility in Graphs. CoRR Gabriele Di Stefano
2021	J	`jnl`	On the effectiveness of the genetic paradigm for polygonization. Inf. Process. Lett. Serafino Cicerone, Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra
2021	J	`jnl`	Solving the Pattern Formation by Mobile Robots With Chirality. IEEE Access Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2021	J	`jnl`	Special Issue on "Graph Algorithms and Applications". Algorithms Serafino Cicerone, Gabriele Di Stefano
2020	J	`jnl`	A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study. CoRR Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2020	J	`jnl`	Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs. CoRR Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
2019	J	`jnl`	Approximation algorithms for decomposing octilinear polygons. Theor. Comput. Sci. Serafino Cicerone, Gabriele Di Stefano
2019	J	`jnl`	Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach. Distributed Comput. Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2019	B	`conf`	Asynchronous Rendezvous with Different Maps. SIROCCO Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Alfredo Navarra
2019	—	`ch.`	Asynchronous Robots on Graphs: Gathering. Distributed Computing by Mobile Entities Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2019	J	`jnl`	Bamboo Garden Trimming Problem: Priority Schedulings. Algorithms Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra
2019	J	`jnl`	Embedded pattern formation by asynchronous robots without chirality. Distributed Comput. Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2019	C	`conf`	Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements. CIAC Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik, Grzegorz Stachowiak
2019	B	`conf`	Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies. SIROCCO Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2019	C	`conf`	On Gathering of Semi-synchronous Robots in Graphs. SSS Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2019	B	`conf`	Priority Scheduling in the Bamboo Garden Trimming Problem. SOFSEM Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra
2018	A	`conf`	"Semi-Asynchronous": A New Scheduler for Robot Based Computing Systems. ICDCS Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2018	J	`jnl`	Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane. Inf. Comput. Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2018	J	`jnl`	Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. Distributed Comput. Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2018	—	`ed.`	Proceedings of the GEOSAFE Workshop on Robust Solutions for Fire Fighting, RSFF 2018, L'Aquila, Italy, July 19-20, 2018. RSFF Gabriele Di Stefano, Alfredo Navarra
2017	J	`jnl`	Asynchronous Pattern Formation: the effects of a rigorous approach. CoRR Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2017	J	`jnl`	Gathering of oblivious robots on infinite grids with minimum traveled distance. Inf. Comput. Gabriele Di Stefano, Alfredo Navarra
2017	J	`jnl`	Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings. Distributed Comput. Gabriele Di Stefano, Alfredo Navarra
2016	A	`conf`	Asynchronous Embedded Pattern Formation Without Orientation. DISC Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2016	J	`jnl`	Gathering of robots on anonymous grids and trees without multiplicity detection. Theor. Comput. Sci. Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra
2016	—	`conf`	Improved Protocols for Luminous Asynchronous Robots. ICTCS Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2015	C	`conf`	About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings. IWOCA Gabriele Di Stefano, Pietro Montanari, Alfredo Navarra
2015	J	`jnl`	Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. Algorithmica Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan
2015	C	`conf`	Gathering of Robots on Meeting-Points. ALGOSENSORS Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2015	C	`conf`	MinMax-Distance Gathering on Given Meeting Points. CIAC Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2014	J	`jnl`	Flow Problems in Multi-Interface Networks. IEEE Trans. Computers Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2014	J	`jnl`	Gathering on rings under the Look-Compute-Move model. Distributed Comput. Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2014	J	`jnl`	Gathering six oblivious robots on anonymous symmetric rings. J. Discrete Algorithms Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2014	C	`conf`	Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points. ALGOSENSORS Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
2014	C	`conf`	Optimal Gathering on Infinite Grids. SSS Gabriele Di Stefano, Alfredo Navarra
2014	J	`jnl`	The Game of Scintillae: From Cellular Automata to Computing and Cryptography Systems. J. Cell. Autom. Gabriele Di Stefano, Alfredo Navarra
2013	—	`conf`	A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems. IPDPS Workshops Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan
2013	—	`conf`	Decomposing Octilinear Polygons into Triangles and Rectangles. JCDCGG Serafino Cicerone, Gabriele Di Stefano
2013	J	`jnl`	Different Genetic Algorithms and the Evolution of Specialization: A Study with Groups of Simulated Neural Robots. Artif. Life Tomassino Ferrauto, Domenico Parisi, Gabriele Di Stefano, Gianluca Baldassarre
2013	J	`jnl`	Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Algorithmica Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio
2013	B	`conf`	Optimal Gathering of Oblivious Robots in Anonymous Graphs. SIROCCO Gabriele Di Stefano, Alfredo Navarra
2012	J	`jnl`	Distance-hereditary comparability graphs. Discret. Appl. Math. Gabriele Di Stefano
2012	B	`conf`	Gathering of Robots on Anonymous Grids without Multiplicity Detection. SIROCCO Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra
2012	A	`conf`	How to Gather Asynchronous Oblivious Robots on Anonymous Rings. DISC Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2012	J	`jnl`	Minimize the Maximum Duty in Multi-interface Networks. Algorithmica Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2012	J	`jnl`	Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances. Inf. Sci. Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel
2012	J	`jnl`	On the online track assignment problem. Discret. Appl. Math. Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu
2012	—	`conf`	Scintillae: How to Approach Computing Systems by Means of Cellular Automata. ACRI Gabriele Di Stefano, Alfredo Navarra
2011	B	`conf`	Bandwidth Constrained Multi-interface Networks. SOFSEM Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2011	B	`conf`	Gathering of Six Robots on Anonymous Symmetric Rings. SIROCCO Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2011	—	`conf`	Maximum flow and minimum-cost flow in multi-interface networks. ICUIMC Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2011	B	`conf`	Min-Max Coverage in Multi-interface Networks. SOFSEM Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2011	J	`jnl`	Recoverable Robust Timetables: An Algorithmic Approach on Trees. IEEE Trans. Computers Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti
2010	B	`conf`	A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. SEA Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio
2010	—	`conf`	Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. COCOA (2) Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2010	J	`jnl`	Partially dynamic efficient algorithms for distributed shortest paths. Theor. Comput. Sci. Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
2009	C	`ed.`	9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, ATMOS 2009, IT University of Copenhagen, Denmark, September 10, 2009 ATMOS Jens Clausen, Gabriele Di Stefano
2009	C	`conf`	ATMOS 2009 Preface -- 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS Jens Clausen, Gabriele Di Stefano
2009	J	`jnl`	Distance-Hereditary Comparability Graphs. Electron. Notes Discret. Math. Gabriele Di Stefano
2009	C	`conf`	Evaluation of Recoverable-Robust Timetables on Tree Networks. IWOCA Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2009	C	`conf`	Recoverable Robust Timetables on Trees. COCOA Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti
2009	J	`jnl`	Recoverable Robustness for Train Shunting Problems. Algorithmic Oper. Res. Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2009	—	`ch.`	Recoverable Robustness in Shunting and Timetabling. Robust and Online Large-Scale Optimization Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra, Michael Schachtebeck, Anita Schöbel
2009	J	`jnl`	Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. J. Comb. Optim. Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2009	J	`jnl`	Treelike comparability graphs. Discret. Appl. Math. Sabine Cornelsen, Gabriele Di Stefano
2008	J	`jnl`	A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks. J. Comput. Gabriele Di Stefano, Alberto Petricola
2008	C	`conf`	Delay Management Problem: Complexity Results and Robust Algorithms. COCOA Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2008	C	`conf`	Dynamic Algorithms for Recoverable Robustness Problems. ATMOS Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel
2008	J	`jnl`	Dynamic Multi-level Overlay Graphs for Shortest Paths. Math. Comput. Sci. Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
2008	J	`jnl`	On minimum k-modal partitions of permutations. J. Discrete Algorithms Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann
2008	J	`jnl`	Online Bounded Coloring of Permutation and Overlap Graphs. Electron. Notes Discret. Math. Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu
2007	C	`conf`	Maintenance of Multi-level Overlay Graphs for Timetable Queries. ATMOS Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
2007	J	`jnl`	Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. J. Comput. Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alberto Petricola
2007	—	`conf`	Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni
2007	C	`conf`	Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2007	J	`jnl`	Track assignment. J. Discrete Algorithms Sabine Cornelsen, Gabriele Di Stefano
2006	B	`conf`	On Minimum LATIN Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann
2006	C	`conf`	On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer. ISPA Gabriele Di Stefano, Alberto Petricola, Christos D. Zaroliagis
2005	J	`jnl`	Self-spanner graphs. Discret. Appl. Math. Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke
2004	J	`jnl`	Networks with small stretch number. J. Discrete Algorithms Serafino Cicerone, Gabriele Di Stefano
2004	C	`conf`	Platform Assignment. ATMOS Sabine Cornelsen, Gabriele Di Stefano
2004	B	`conf`	Treelike Comparability Graphs: Characterization, Recognition, and Applications. WG Sabine Cornelsen, Gabriele Di Stefano
2003	J	`jnl`	(k, +)-distance-hereditary graphs. J. Discrete Algorithms Serafino Cicerone, Gabriele Di Stefano
2003	C	`conf`	A Graph Theoretical Approach To The Shunting Problem. ATMOS Gabriele Di Stefano, Magnus Love Koci
2003	J	`jnl`	A fully dynamic algorithm for distributed shortest paths. Theor. Comput. Sci. Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
2002	J	`jnl`	Static and dynamic low-congested interval routing schemes. Theor. Comput. Sci. Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
2001	B	`conf`	(k, +)-Distance-Hereditary Graphs. WG Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano
2001	J	`jnl`	Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. J. Parallel Distributed Comput. Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
2001	J	`jnl`	Graphs with bounded induced distance. Discret. Appl. Math. Serafino Cicerone, Gabriele Di Stefano
2000	B	`conf`	A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
2000	J	`jnl`	Low-congested interval routing schemes for hypercubelike networks. Networks Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
2000	B	`conf`	Networks with Small Stretch Number. WG Serafino Cicerone, Gabriele Di Stefano
1999	B	`conf`	Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. SIROCCO Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
1999	J	`jnl`	Graph Classes Between Parity and Distance-hereditary Graphs. Discret. Appl. Math. Serafino Cicerone, Gabriele Di Stefano
1999	J	`jnl`	On the Extension of Bipartite to Parity Graphs. Discret. Appl. Math. Serafino Cicerone, Gabriele Di Stefano
1999	B	`conf`	Survivable Networks with Bounded Delay: The Edge Failure Case. ISAAC Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke
1998	B	`conf`	Graphs with Bounded Induced Distance. WG Serafino Cicerone, Gabriele Di Stefano
1998	A*	`conf`	Static and Dynamic Low-Congested Interval Routing Schemes. ICALP Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
1997	B	`conf`	On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. ISAAC Serafino Cicerone, Gabriele Di Stefano
1996	B	`conf`	A Routing Algorithm for Networks Based on Distance-Hereditary Topologies. SIROCCO Gabriele Di Stefano
1996	—	`conf`	Graph Classes between Parity and Distance-Hereditary Graphs. DMTCS Serafino Cicerone, Gabriele Di Stefano
1995	—	`conf`	Analysis and implementation of a VLSI neural network. ICNN Gian Carlo Cardarilli, Gabriele Di Stefano, G. Fabrizi, P. Marinucci
1993	—	`conf`	An Application of the MILFORD System to Handle Radiological Data. CISM - Advances in Database Systems Gabriele Di Stefano, M. V. Marabello, Alessandro D'Atri