Giovanni Viglietta

Graphs Comb., October, 2023

Minimal Arrangements of Spherical Geodesics.

[BibT_eX]

[DOI]

CoRR, 2023

Efficient Computation in Congested Anonymous Dynamic Networks.

[BibT_eX]

[DOI]

CoRR, 2023

A Theory of Spherical Diagrams.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

Pushing Blocks by Sweeping Lines.

[BibT_eX]

[DOI]

Hugo A. Akitaya

Maarten Löffler

Comput. Geom. Topol., 2023

Optimal Computation in Leaderless and Multi-Leader Disconnected Anonymous Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022

Token shifting on graphs.

[BibT_eX]

[DOI]

Win Hlaing Hlaing Myint

Int. J. Comput. Math. Comput. Syst. Theory, October, 2022

Cyclic Shift Problems on Graphs.

[BibT_eX]

[DOI]

Kwon Kham Sai

IEICE Trans. Inf. Syst., 2022

Bicolored Path Embedding Problems Inspired by Protein Folding Models.

[BibT_eX]

[DOI]

Tianfeng Feng

IEICE Trans. Inf. Syst., 2022

Complexity of Critter Crunch.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2022

TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications.

[BibT_eX]

[DOI]

Paola Flocchini

Nicola Santoro

Distributed Comput., 2022

Leaderless and Multi-Leader Computation in Disconnected Anonymous Dynamic Networks.

[BibT_eX]

[DOI]

CoRR, 2022

Edge guards for polyhedra in three-space.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Computing in Anonymous Dynamic Networks Is Linear.

[BibT_eX]

[DOI]

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Chasing Puppies: Mobile Beacon Routing on Closed Curves.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Gathering in dynamic rings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Meeting in a polygon by anonymous oblivious robots.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Shape formation by programmable particles.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Fault-tolerant simulation of population protocols.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots.

[BibT_eX]

[DOI]

Yukiko Yamauchi

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Mobile RAM and Shape Formation by Programmable Particles.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2020: Parallel Processing, 2020

2019

Uniform Circle Formation.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing by Mobile Entities, 2019

Robots with Lights.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing by Mobile Entities, 2019

Population protocols with faulty interactions: The impact of a leader.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Oblivious Permutations on the Plane.

[BibT_eX]

[DOI]

Shantanu Das

Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

2018

Line Recovery by Programmable Particles.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017

Mutual visibility by luminous robots without collisions.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Constructing self-stabilizing oscillators in population protocols.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Distributed computing by mobile robots: uniform circle formation.

[BibT_eX]

[DOI]

Distributed Comput., 2017

Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots.

[BibT_eX]

[DOI]

CoRR, 2017

Brief Announcement: Shape Formation by Programmable Particles.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

Mediated Population Protocols: Leader Election and Applications.

[BibT_eX]

[DOI]

Shantanu Das

Paola Flocchini

Nicola Santoro

Proceedings of the Theory and Applications of Models of Computation, 2017

On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

2016

Rendezvous with constant memory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Implicit Function Computation by Oblivious Mobile Robots.

[BibT_eX]

[DOI]

CoRR, 2016

Universal Systems of Oblivious Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

A Rupestrian Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Super Mario Bros. is Harder/Easier Than We Thought.

[BibT_eX]

[DOI]

Erik D. Demaine

Aaron Williams

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Square Formation by Asynchronous Oblivious Robots.

[BibT_eX]

Marcello Mamino

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Lemmings is PSPACE-complete.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Classic Nintendo games are (computationally) hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Getting close without touching: near-gathering for autonomous mobile robots.

[BibT_eX]

[DOI]

Linda Pagli

Giuseppe Prencipe

Distributed Comput., 2015

Simulating a die roll by flipping two coins.

[BibT_eX]

[DOI]

CoRR, 2015

Reprint of: Face-guarding polyhedra.

[BibT_eX]

[DOI]

Comput. Geom., 2015

The Shadows of a Cycle Cannot All Be Paths.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Gaming Is a Hard Job, but Someone Has to Do It!

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Face-guarding polyhedra.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Robots with Lights: Overcoming Obstructed Visibility Without Colliding.

[BibT_eX]

[DOI]

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

Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

The Mutual Visibility Problem for Oblivious Robots.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Guarding and Searching Polyhedra.

[BibT_eX]

[DOI]

PhD thesis, 2013

Algorithms for Designing Pop-Up Cards.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Rendezvous of Two Robots with Constant Memory.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2013

Partial Searchlight Scheduling is Strongly PSPACE-complete.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Rendezvous of Two Robots with Visible Bits.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Searching Polyhedra by rotating half-Planes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2012

Guarding and Searching Polyhedra

[BibT_eX]

[DOI]

CoRR, 2012

Getting Close without Touching.

[BibT_eX]

[DOI]

Linda Pagli

Giuseppe Prencipe

Proceedings of the Structural Information and Communication Complexity, 2012

Hardness of Mastermind.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

A Survey on Open Problems for Mobile Robots

[BibT_eX]

[DOI]

Alberto Bandettini

Fabio Luporini

CoRR, 2011

Searching Polyhedra by Rotating Planes

[BibT_eX]

[DOI]

CoRR, 2011

Edge-guarding Orthogonal Polyhedra.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Jorge Urrutia

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

The 3-dimensional searchlight scheduling problem.

[BibT_eX]

[DOI]