# Giovanni Viglietta

According to our database

Collaborative distances:

^{1}, Giovanni Viglietta authored at least 38 papers between 2010 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Uniform Circle Formation.

Proceedings of the Distributed Computing by Mobile Entities, 2019

Robots with Lights.

Proceedings of the Distributed Computing by Mobile Entities, 2019

2018

TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and Its Applications.

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Line Recovery by Programmable Particles.

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

2017

Mutual visibility by luminous robots without collisions.

Inf. Comput., 2017

Distributed computing by mobile robots: uniform circle formation.

Distributed Computing, 2017

Brief Announcement: Shape Formation by Programmable Particles.

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

Meeting in a Polygon by Anonymous Oblivious Robots.

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

Mediated Population Protocols: Leader Election and Applications.

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

Gathering in Dynamic Rings.

Proceedings of the Structural Information and Communication Complexity, 2017

Shape Formation by Programmable Particles.

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

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

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

Population Protocols with Faulty Interactions: The Impact of a Leader.

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Rendezvous with constant memory.

Theor. Comput. Sci., 2016

Universal Systems of Oblivious Mobile Robots.

Proceedings of the Structural Information and Communication Complexity, 2016

A Rupestrian Algorithm.

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

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

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

Square Formation by Asynchronous Oblivious Robots.

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

2015

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

Distributed Computing, 2015

Reprint of: Face-guarding polyhedra.

Comput. Geom., 2015

Constructing Self-stabilizing Oscillators in Population Protocols.

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

The Shadows of a Cycle Cannot All Be Paths.

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

2014

Robots with Lights: Overcoming Obstructed Visibility Without Colliding.

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

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

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

Lemmings Is PSPACE-Complete.

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Classic Nintendo Games Are (Computationally) Hard.

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

The Mutual Visibility Problem for Oblivious Robots.

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

2013

Algorithms for Designing Pop-Up Cards.

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

Rendezvous of Two Robots with Constant Memory.

Proceedings of the Structural Information and Communication Complexity, 2013

Face-Guarding Polyhedra.

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

Partial Searchlight Scheduling is Strongly PSPACE-complete.

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

Rendezvous of Two Robots with Visible Bits.

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Searching Polyhedra by rotating half-Planes.

Int. J. Comput. Geometry Appl., 2012

Getting Close without Touching.

Proceedings of the Structural Information and Communication Complexity, 2012

Hardness of Mastermind.

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

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

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

2011

Edge-guarding Orthogonal Polyhedra.

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

2010

The 3-dimensional searchlight scheduling problem.

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010