Gabriele Di Stefano

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 57

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)
Elias John Thomas, S. V. Ullas Chandran, James Tuite, Gabriele Di Stefano
On monophonic position sets in graphs. Discret. Appl. Math. 354 (2024)
Maya G. S. Thankachy, S. V. Ullas Chandran, James Tuite, Elias John Thomas, Gabriele Di Stefano, Grahame Erskine
On the vertex position number of graphs. Discuss. Math. Graph Theory 44 (3) (2024)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli
Mutual Visibility in Hypercube-Like Graphs. SIROCCO (2024)
Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci
On the approximability of graph visibility problems. CoRR (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)
Elias John Thomas, S. V. Ullas Chandran, James Tuite, Gabriele Di Stefano
On the general position number of Mycielskian graphs. Discret. Appl. Math. 353 (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)
Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini
About the Infinite Windy Firebreak Location problem. CoRR (2022)
Gabriele Di Stefano
Mutual visibility in graphs. Appl. Math. Comput. 419 (2022)
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
Molecular Robots with Chirality on Grids. ALGOSENSORS (2022)
Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini
A graph theoretical approach to the firebreak locating problem. Theor. Comput. Sci. 914 (2022)
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)
Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini
A graph theoretical approach to the firebreak locating problem. CoRR (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)
Gabriele Di Stefano
Mutual Visibility in Graphs. CoRR (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, Gabriele Di Stefano, Alfredo Navarra
On Gathering of Semi-synchronous Robots in Graphs. SSS (2019)
Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra
Bamboo Garden Trimming Problem: Priority Schedulings. Algorithms 12 (4) (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)
Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra
Priority Scheduling in the Bamboo Garden Trimming Problem. SOFSEM (2019)
Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane. Inf. Comput. 263 (2018)
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)
Gabriele Di Stefano, Alfredo Navarra
Gathering of oblivious robots on infinite grids with minimum traveled distance. Inf. Comput. 254 (2017)
Gabriele Di Stefano, Alfredo Navarra
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings. Distributed Comput. 30 (2) (2017)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Asynchronous Pattern Formation: the effects of a rigorous approach. CoRR (2017)
Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
Improved Protocols for Luminous Asynchronous Robots. ICTCS (2016)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra
Gathering of robots on anonymous grids and trees without multiplicity detection. Theor. Comput. Sci. 610 (2016)
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Asynchronous Embedded Pattern Formation Without Orientation. DISC (2016)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. Algorithmica 72 (4) (2015)
Gabriele Di Stefano, Pietro Montanari, Alfredo Navarra
About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings. IWOCA (2015)
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)
Gabriele Di Stefano, Alfredo Navarra
The Game of Scintillae: From Cellular Automata to Computing and Cryptography Systems. J. Cell. Autom. 9 (2-3) (2014)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Flow Problems in Multi-Interface Networks. IEEE Trans. Computers 63 (2) (2014)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Gathering six oblivious robots on anonymous symmetric rings. J. Discrete Algorithms 26 (2014)
Gabriele Di Stefano, Alfredo Navarra
Optimal Gathering on Infinite Grids. SSS (2014)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Gathering on rings under the Look-Compute-Move model. Distributed Comput. 27 (4) (2014)
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)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan
A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems. IPDPS Workshops (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)
Gabriele Di Stefano, Alfredo Navarra
Optimal Gathering of Oblivious Robots in Anonymous Graphs. SIROCCO (2013)
Tomassino Ferrauto, Domenico Parisi, Gabriele Di Stefano, Gianluca Baldassarre
Different Genetic Algorithms and the Evolution of Specialization: A Study with Groups of Simulated Neural Robots. Artif. Life 19 (2) (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)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
How to Gather Asynchronous Oblivious Robots on Anonymous Rings. DISC (2012)
Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu
On the online track assignment problem. Discret. Appl. Math. 160 (7-8) (2012)
Gabriele Di Stefano
Distance-hereditary comparability graphs. Discret. Appl. Math. 160 (18) (2012)
Gabriele Di Stefano, Alfredo Navarra
Scintillae: How to Approach Computing Systems by Means of Cellular Automata. ACRI (2012)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra
Gathering of Robots on Anonymous Grids without Multiplicity Detection. SIROCCO (2012)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Minimize the Maximum Duty in Multi-interface Networks. Algorithmica 63 (1-2) (2012)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Maximum flow and minimum-cost flow in multi-interface networks. ICUIMC (2011)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Min-Max Coverage in Multi-interface Networks. SOFSEM (2011)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti
Recoverable Robust Timetables: An Algorithmic Approach on Trees. IEEE Trans. Computers 60 (3) (2011)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Bandwidth Constrained Multi-interface Networks. SOFSEM (2011)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Gathering of Six Robots on Anonymous Symmetric Rings. SIROCCO (2011)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. COCOA (2) (2010)
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)
Gabriele Di Stefano
Distance-Hereditary Comparability Graphs. Electron. Notes Discret. Math. 35 (2009)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Evaluation of Recoverable-Robust Timetables on Tree Networks. IWOCA (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)
Jens Clausen, Gabriele Di Stefano
ATMOS 2009 Preface -- 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS (2009)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti
Recoverable Robust Timetables on Trees. COCOA (2009)
Sabine Cornelsen, Gabriele Di Stefano
Treelike comparability graphs. Discret. Appl. Math. 157 (8) (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)
Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann
On minimum k-modal partitions of permutations. J. Discrete Algorithms 6 (3) (2008)
Gabriele Di Stefano, Alberto Petricola
A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks. J. Comput. 3 (4) (2008)
Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu
Online Bounded Coloring of Permutation and Overlap Graphs. Electron. Notes Discret. Math. 30 (2008)

Gabriele Di Stefano.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gabriele Di Stefano