Serafino Cicerone

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

Molecular Robots with Chirality on Grids.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Wireless Networks, 2022

2021

Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem.

[BibT_eX]

[DOI]

Mattia D'Emidio

Filippo Tirabassi Pascucci

ACM Trans. Spatial Algorithms Syst., 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

A Quasi-Hole Detection Algorithm for Recognizing k-Distance-Hereditary Graphs, with k < 2.

[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

Breaking Symmetries on Tessellation Graphs via Asynchronous Robots: The Line Formation Problem as a Case Study.

[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

Breaking Symmetries on Tessellation Graphs via Asynchronous Robots.

[BibT_eX]

[DOI]

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

On Building Networks with Limited Stretch Factor.

[BibT_eX]

[DOI]

Proceedings of the Web, Artificial Intelligence and Network Applications, 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

On Gathering of Semi-synchronous Robots in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 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

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

[BibT_eX]

[DOI]

Distributed Comput., 2018

On Mining Distances in Large-Scale Dynamic Graphs.

[BibT_eX]

[DOI]

Mattia D'Emidio

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 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

Asynchronous Pattern Formation: the effects of a rigorous approach.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Asynchronous Embedded Pattern Formation Without Orientation.

[BibT_eX]

[DOI]

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

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

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2014

2013

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

[BibT_eX]

[DOI]

Algorithmica, 2013

Decomposing Octilinear Polygons into Triangles and Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs, 2013

2012

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

[BibT_eX]

[DOI]

Inf. Sci., 2012

Fast and Simple Approach for Polygon Schematization.

[BibT_eX]

[DOI]

Matteo Cermignani

Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012

2011

Characterizations of Graphs with Stretch Number less than 2.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 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

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

Recoverable Robustness for Train Shunting Problems.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2009

2008

Dynamic Multi-level Overlay Graphs for Shortest Paths.

[BibT_eX]

[DOI]

Math. Comput. Sci., 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

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

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

Cardinal directions between spatial objects: the pairwise-consistency problem.

[BibT_eX]

[DOI]

Inf. Sci., 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

Efficient Estimation of Qualitative Topological Relations based on the Weighted Walkthroughs Model.

[BibT_eX]

[DOI]

Eliseo Clementini

GeoInformatica, 2003

2002

Static and dynamic low-congested interval routing schemes.

[BibT_eX]

[DOI]

Michele Flammini

Theor. Comput. Sci., 2002

A general strategy for decomposing topological invariants of spatial databases and an application.

[BibT_eX]

[DOI]

Data Knowl. Eng., 2002

Extraction of qualitative information from the weighted walkthroughs.

[BibT_eX]

[DOI]

Eliseo Clementini

Proceedings of the ACM-GIS 2002, 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

Supporting a Focus+Context Interaction Style for Spatial Databases.

[BibT_eX]

[DOI]

Laura Tarantino

Proceedings of the WISE 2000, 2000

On the formalization of zoom-based interaction with geographic databases.

[BibT_eX]

Laura Tarantino

Proceedings of the Ottavo Convegno Nazionale su Sistemi Evoluti per Basi di Dati, 2000

Cardinal relations between regions with a broad boundary.

[BibT_eX]

[DOI]

Proceedings of the ACM-GIS 2000, 2000

Interacting with Geographic Databases: A Focus+Context Approach.

[BibT_eX]

[DOI]

Laura Tarantino

Proceedings of the 11th International Workshop on Database and Expert Systems Applications (DEXA'00), 2000

Decomposing Spatial Databases and Applications.

[BibT_eX]

[DOI]

Proceedings of the 11th International Workshop on Database and Expert Systems Applications (DEXA'00), 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

Interacting with Topological Invariants of Spatial Databases.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Database Applications in Non-Traditional Environments (DANTE '99), 1999

1998

A Uniform Approach to Semi-Dynamic Problems on Digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

1997

On the Complexity of Specification Morphisms.

[BibT_eX]

[DOI]

Francesco Parisi-Presicce

Theor. Comput. Sci., 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

Counting Edges in a Dag.

[BibT_eX]

[DOI]

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

1994

Strategies in Modular System Design by Interface Rewriting.

[BibT_eX]

[DOI]