Gabriele Di Stefano

Sandi Klavzar

Appl. Math. Comput., 2023

Molecular Oblivious Robots: A New Model for Robots With Assembling Capabilities.

[BibT_eX]

[DOI]

IEEE Access, 2023

Time-Optimal Geodesic Mutual Visibility of Robots on Grids Within Minimum Area.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Mutual-visibility in distance-hereditary graphs: a linear-time algorithm.

[BibT_eX]

[DOI]

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

The Geodesic Mutual Visibility Problem for Oblivious Robots: the case of Trees.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Distributed Computing and Networking, 2023

2022

A graph theoretical approach to the firebreak locating problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

About the Infinite Windy Firebreak Location problem.

[BibT_eX]

[DOI]

CoRR, 2022

Mutual visibility in graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2022

Molecular Robots with Chirality on Grids.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Wireless Networks, 2022

2021

Gathering robots in graphs: The central role of synchronicity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Getting new algorithmic results by extending distance-hereditary graphs via split composition.

[BibT_eX]

[DOI]

PeerJ Comput. Sci., 2021

A structured methodology for designing distributed algorithms for mobile entities.

[BibT_eX]

[DOI]

Inf. Sci., 2021

On the effectiveness of the genetic paradigm for polygonization.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Special Issue on "Graph Algorithms and Applications".

[BibT_eX]

[DOI]

Algorithms, 2021

Solving the Pattern Formation by Mobile Robots With Chirality.

[BibT_eX]

[DOI]

IEEE Access, 2021

"Semi-Asynchronous": A New Scheduler in Distributed Computing.

[BibT_eX]

[DOI]

IEEE Access, 2021

MOBLOT: Molecular Oblivious Robots.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Asynchronous Robots on Graphs: Gathering.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing by Mobile Entities, 2019

Approximation algorithms for decomposing octilinear polygons.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Embedded pattern formation by asynchronous robots without chirality.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Bamboo Garden Trimming Problem: Priority Schedulings.

[BibT_eX]

[DOI]

Mattia D'Emidio

Algorithms, 2019

On Gathering of Semi-synchronous Robots in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Priority Scheduling in the Bamboo Garden Trimming Problem.

[BibT_eX]

[DOI]

Mattia D'Emidio

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Asynchronous Rendezvous with Different Maps.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Gathering of robots on meeting-points: feasibility and optimal resolution algorithms.

[BibT_eX]

[DOI]

Distributed Comput., 2018

"Semi-Asynchronous": A New Scheduler for Robot Based Computing Systems.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

2017

Gathering of oblivious robots on infinite grids with minimum traveled distance.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings.

[BibT_eX]

[DOI]

Distributed Comput., 2017

Asynchronous Pattern Formation: the effects of a rigorous approach.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Gathering of robots on anonymous grids and trees without multiplicity detection.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Asynchronous Embedded Pattern Formation Without Orientation.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Improved Protocols for Luminous Asynchronous Robots.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

2015

Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks.

[BibT_eX]

[DOI]

Algorithmica, 2015

About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings.

[BibT_eX]

[DOI]

Pietro Montanari

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

MinMax-Distance Gathering on Given Meeting Points.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Gathering of Robots on Meeting-Points.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2015

2014

Flow Problems in Multi-Interface Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2014

Gathering six oblivious robots on anonymous symmetric rings.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

The Game of Scintillae: From Cellular Automata to Computing and Cryptography Systems.

[BibT_eX]

[DOI]

J. Cell. Autom., 2014

Gathering on rings under the Look-Compute-Move model.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Optimal Gathering on Infinite Grids.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2014

2013

Different Genetic Algorithms and the Evolution of Specialization: A Study with Groups of Simulated Neural Robots.

[BibT_eX]

[DOI]

Artif. Life, 2013

Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks.

[BibT_eX]

[DOI]

Algorithmica, 2013

Optimal Gathering of Oblivious Robots in Anonymous Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2013

Decomposing Octilinear Polygons into Triangles and Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs, 2013

A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

2012

Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances.

[BibT_eX]

[DOI]

Inf. Sci., 2012

On the online track assignment problem.

[BibT_eX]

[DOI]

Marc Demange

Benjamin Leroy-Beaulieu

Discret. Appl. Math., 2012

Minimize the Maximum Duty in Multi-interface Networks.

[BibT_eX]

[DOI]

Algorithmica, 2012

How to Gather Asynchronous Oblivious Robots on Anonymous Rings.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Gathering of Robots on Anonymous Grids without Multiplicity Detection.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

Scintillae: How to Approach Computing Systems by Means of Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata, 2012

2011

Recoverable Robust Timetables: An Algorithmic Approach on Trees.

[BibT_eX]

[DOI]

Maria Cristina Pinotti

IEEE Trans. Computers, 2011

Bandwidth Constrained Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Min-Max Coverage in Multi-interface Networks.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Gathering of Six Robots on Anonymous Symmetric Rings.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Maximum flow and minimum-cost flow in multi-interface networks.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, 2011

2010

Partially dynamic efficient algorithms for distributed shortest paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Recoverable Robustness in Shunting and Timetabling.

[BibT_eX]

[DOI]

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

Distance-Hereditary Comparability Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Treelike comparability graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Recoverable Robustness for Train Shunting Problems.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2009

Evaluation of Recoverable-Robust Timetables on Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Recoverable Robust Timetables on Trees.

[BibT_eX]

[DOI]

Maria Cristina Pinotti

Proceedings of the Combinatorial Optimization and Applications, 2009

ATMOS 2009 Preface -- 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.

[BibT_eX]

[DOI]

Jens Clausen

Proceedings of the ATMOS 2009, 2009

2008

Dynamic Multi-level Overlay Graphs for Shortest Paths.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2008

On minimum k-modal partitions of permutations.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks.

[BibT_eX]

[DOI]

Alberto Petricola

J. Comput., 2008

Online Bounded Coloring of Permutation and Overlap Graphs.

[BibT_eX]

[DOI]

Marc Demange

Benjamin Leroy-Beaulieu

Electron. Notes Discret. Math., 2008

Delay Management Problem: Complexity Results and Robust Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

Dynamic Algorithms for Recoverable Robustness Problems.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2008, 2008

2007

Track assignment.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation.

[BibT_eX]

[DOI]

J. Comput., 2007

Partially Dynamic Concurrent Update of Distributed Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the 2007 International Conference on Computing: Theory and Applications (ICCTA 2007), 2007

Robust Algorithms and Price of Robustness in Shunting Problems.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2007, 2007

Maintenance of Multi-level Overlay Graphs for Timetable Queries.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2007, 2007

2006

On Minimum <i>k</i>-Modal Partitions of Permutations.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer.

[BibT_eX]

[DOI]

Alberto Petricola

Christos D. Zaroliagis

Proceedings of the Parallel and Distributed Processing and Applications, 2006

2005

Self-spanner graphs.

[BibT_eX]

[DOI]

Dagmar Handke

Discret. Appl. Math., 2005

2004

Networks with small stretch number.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

Treelike Comparability Graphs: Characterization, Recognition, and Applications.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Platform Assignment.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Methods for Railway Optimization, 2004

2003

A fully dynamic algorithm for distributed shortest paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

(k, +)-distance-hereditary graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2003

A Graph Theoretical Approach To The Shunting Problem.

[BibT_eX]

[DOI]

Magnus Love Koci

Proceedings of the Algorithmic MeThods and Models for Optimization of RailwayS, 2003

2002

Static and dynamic low-congested interval routing schemes.

[BibT_eX]

[DOI]

Michele Flammini

Theor. Comput. Sci., 2002

2001

Compact-Port Routing Models and Applications to Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

Michele Flammini

J. Parallel Distributed Comput., 2001

Graphs with bounded induced distance.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

(k, +)-Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

Gianluca D'Ermiliis

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

2000

Low-congested interval routing schemes for hypercubelike networks.

[BibT_eX]

[DOI]

Michele Flammini

Networks, 2000

1999

Graph Classes Between Parity and Distance-hereditary Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

On the Extension of Bipartite to Parity Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

Survivable Networks with Bounded Delay: The Edge Failure Case.

[BibT_eX]

[DOI]

Dagmar Handke

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1997

On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996

A Routing Algorithm for Networks Based on Distance-Hereditary Topologies.

[BibT_eX]

Proceedings of the SIROCCO'96, 1996

1995

Analysis and implementation of a VLSI neural network.

[BibT_eX]

[DOI]

Gian Carlo Cardarilli

G. Fabrizi

P. Marinucci

Proceedings of International Conference on Neural Networks (ICNN'95), Perth, WA, Australia, November 27, 1995

1993

An Application of the MILFORD System to Handle Radiological Data.

[BibT_eX]