The 3-dimensional searchlight scheduling problem. - Giovanni Viglietta; Maurizio Monge (CCCG, 2010)

Edge-guarding Orthogonal Polyhedra. - Giovanni Viglietta; Nadia M. Benbernou; Erik D. Demaine; Martin L. Demaine; Anastasia Kurdia; Joseph O'Rourke; Godfried T. Toussaint; Jorge Urrutia (CCCG, 2011)

Searching Polyhedra by Rotating Planes - Giovanni Viglietta (CoRR, 2011)

A Survey on Open Problems for Mobile Robots - Alberto Bandettini; Fabio Luporini; Giovanni Viglietta (CoRR, 2011)

Hardness of Mastermind. - Giovanni Viglietta (FUN, 2012)

Getting Close without Touching. - Linda Pagli; Giuseppe Prencipe; Giovanni Viglietta (SIROCCO, 2012)

Guarding and Searching Polyhedra - Giovanni Viglietta (CoRR, 2012)

Searching Polyhedra by rotating half-Planes. - Giovanni Viglietta (Int. J. Comput. Geom. Appl., 2012)

Rendezvous of Two Robots with Visible Bits. - Giovanni Viglietta (ALGOSENSORS, 2013)

Partial Searchlight Scheduling is Strongly PSPACE-complete. - Giovanni Viglietta (CCCG, 2013)

Rendezvous of Two Robots with Constant Memory. - Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (SIROCCO, 2013)

Algorithms for Designing Pop-Up Cards. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Anna Lubiw; André Schulz 001; Diane L. Souvaine; Giovanni Viglietta; Andrew Winslow (STACS, 2013)

Guarding and Searching Polyhedra. - Giovanni Viglietta (2013)

The Mutual Visibility Problem for Oblivious Robots. - Giuseppe Antonio Di Luna; Paola Flocchini; Federico Poloni; Nicola Santoro; Giovanni Viglietta (CCCG, 2014)

Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Giovanni Viglietta (OPODIS, 2014)

Robots with Lights: Overcoming Obstructed Visibility Without Colliding. - Giuseppe Antonio Di Luna; Paola Flocchini; Sruti Gan Chaudhuri; Nicola Santoro; Giovanni Viglietta (SSS, 2014)

Face-guarding polyhedra. - Giovanni Viglietta (Comput. Geom., 2014)

Gaming Is a Hard Job, but Someone Has to Do It! - Giovanni Viglietta (Theory Comput. Syst., 2014)

The Shadows of a Cycle Cannot All Be Paths. - Giovanni Viglietta; Prosenjit Bose; Jean-Lou De Carufel; Michael Gene Dobbins; Heuna Kim (CCCG, 2015)

Reprint of: Face-guarding polyhedra. - Giovanni Viglietta (Comput. Geom., 2015)

Simulating a die roll by flipping two coins. - Giovanni Viglietta (CoRR, 2015)

Getting close without touching: near-gathering for autonomous mobile robots. - Linda Pagli; Giuseppe Prencipe; Giovanni Viglietta (Distributed Comput., 2015)

Classic Nintendo games are (computationally) hard. - Greg Aloupis; Erik D. Demaine; Alan Guo; Giovanni Viglietta (Theor. Comput. Sci., 2015)

Lemmings is PSPACE-complete. - Giovanni Viglietta (Theor. Comput. Sci., 2015)

Square Formation by Asynchronous Oblivious Robots. - Marcello Mamino; Giovanni Viglietta (CCCG, 2016)

Super Mario Bros. is Harder/Easier Than We Thought. - Erik D. Demaine; Giovanni Viglietta; Aaron Williams 001 (FUN, 2016)

A Rupestrian Algorithm. - Giuseppe Antonio Di Luna; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Giovanni Viglietta (FUN, 2016)

Universal Systems of Oblivious Mobile Robots. - Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (SIROCCO, 2016)

Implicit Function Computation by Oblivious Mobile Robots. - Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (CoRR, 2016)

Rendezvous with constant memory. - Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (Theor. Comput. Sci., 2016)

On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. - Giuseppe Antonio Di Luna; Paola Flocchini; Taisuke Izumi; Tomoko Izumi; Nicola Santoro; Giovanni Viglietta (ICDCS, 2017)

Mediated Population Protocols: Leader Election and Applications. - Shantanu Das 001; Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta (TAMC, 2017)

Brief Announcement: Shape Formation by Programmable Particles. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Yukiko Yamauchi (DISC, 2017)

Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (CoRR, 2017)

Distributed computing by mobile robots: uniform circle formation. - Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Giovanni Viglietta (Distributed Comput., 2017)

Constructing self-stabilizing oscillators in population protocols. - Colin Cooper; Anissa Lamani; Giovanni Viglietta; Masafumi Yamashita; Yukiko Yamauchi (Inf. Comput., 2017)

Mutual visibility by luminous robots without collisions. - Giuseppe Antonio Di Luna; Paola Flocchini; Sruti Gan Chaudhuri; Federico Poloni; Nicola Santoro; Giovanni Viglietta (Inf. Comput., 2017)

Line Recovery by Programmable Particles. - Giuseppe Antonio Di Luna; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Giovanni Viglietta (ICDCN, 2018)

Oblivious Permutations on the Plane. - Shantanu Das 001; Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (OPODIS, 2019)

Population protocols with faulty interactions: The impact of a leader. - Giuseppe Antonio Di Luna; Paola Flocchini; Taisuke Izumi; Tomoko Izumi; Nicola Santoro; Giovanni Viglietta (Theor. Comput. Sci., 2019)

Robots with Lights. - Giuseppe Antonio Di Luna; Giovanni Viglietta (Distributed Computing by Mobile Entities, 2019)

Uniform Circle Formation. - Giovanni Viglietta (Distributed Computing by Mobile Entities, 2019)

Mobile RAM and Shape Formation by Programmable Particles. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Yukiko Yamauchi (Euro-Par, 2020)

Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards. - Giovanni Viglietta (Comput. Geom., 2020)

Fault-tolerant simulation of population protocols. - Giuseppe Antonio Di Luna; Paola Flocchini; Taisuke Izumi; Tomoko Izumi; Nicola Santoro; Giovanni Viglietta (Distributed Comput., 2020)

Shape formation by programmable particles. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Yukiko Yamauchi (Distributed Comput., 2020)

Meeting in a polygon by anonymous oblivious robots. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta; Masafumi Yamashita (Distributed Comput., 2020)

Gathering in dynamic rings. - Giuseppe Antonio Di Luna; Paola Flocchini; Linda Pagli; Giuseppe Prencipe; Nicola Santoro; Giovanni Viglietta (Theor. Comput. Sci., 2020)

Chasing Puppies: Mobile Beacon Routing on Closed Curves. - Mikkel Abrahamsen; Jeff Erickson 001; Irina Kostitsyna; Maarten Löffler; Till Miltzow; Jérôme Urhausen; Jordi L. Vermeulen; Giovanni Viglietta (J. Comput. Geom., 2021)

Computing in Anonymous Dynamic Networks Is Linear. - Giuseppe Antonio Di Luna; Giovanni Viglietta (FOCS, 2022)

Edge guards for polyhedra in three-space. - Javier Cano; Csaba D. Tóth; Jorge Urrutia; Giovanni Viglietta (Comput. Geom., 2022)

Leaderless and Multi-Leader Computation in Disconnected Anonymous Dynamic Networks. - Giuseppe Antonio Di Luna; Giovanni Viglietta (CoRR, 2022)

TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications. - Giuseppe Antonio Di Luna; Paola Flocchini; Nicola Santoro; Giovanni Viglietta (Distributed Comput., 2022)

Complexity of Critter Crunch. - Tianfeng Feng; Leonie Ryvkin; Jérôme Urhausen; Giovanni Viglietta (IEICE Trans. Inf. Syst., 2022)

Bicolored Path Embedding Problems Inspired by Protein Folding Models. - Tianfeng Feng; Ryuhei Uehara; Giovanni Viglietta (IEICE Trans. Inf. Syst., 2022)

Cyclic Shift Problems on Graphs. - Kwon Kham Sai; Giovanni Viglietta; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2022)

Token shifting on graphs. - Win Hlaing Hlaing Myint; Ryuhei Uehara; Giovanni Viglietta (Int. J. Comput. Math. Comput. Syst. Theory, 2022)

Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks. - Giuseppe Antonio Di Luna; Giovanni Viglietta (PODC, 2023)

Optimal Computation in Leaderless and Multi-Leader Disconnected Anonymous Dynamic Networks. - Giuseppe Antonio Di Luna; Giovanni Viglietta (DISC, 2023)

Pushing Blocks by Sweeping Lines. - Hugo A. Akitaya; Maarten Löffler; Giovanni Viglietta (Comput. Geom. Topol., 2023)

A Theory of Spherical Diagrams. - Giovanni Viglietta (Comput. Geom. Topol., 2023)

Minimal Arrangements of Spherical Geodesics. - Giovanni Viglietta (CoRR, 2023)

Minimizing Visible Edges in Polyhedra. - Csaba D. Tóth; Jorge Urrutia; Giovanni Viglietta (Graphs Comb., 2023)

Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks. - Giuseppe Antonio Di Luna; Giovanni Viglietta (OPODIS, 2024)

History Trees and Their Applications. - Giovanni Viglietta (SIROCCO, 2024)

Computational complexity of jumping block puzzles. - Masaaki Kanzaki; Yota Otachi; Giovanni Viglietta; Ryuhei Uehara (Theor. Comput. Sci., 2024)

Gathering on a circle with limited visibility by anonymous oblivious robots. - Giuseppe Antonio Di Luna; Ryuhei Uehara; Giovanni Viglietta; Yukiko Yamauchi (Theor. Comput. Sci., 2025)

Efficient Lifting of Discrete Logarithms Modulo Prime Powers. - Giovanni Viglietta; Yasuyuki Kachi (CoRR, 2025)

Efficient computation in congested anonymous dynamic networks. - Giuseppe Antonio Di Luna; Giovanni Viglietta (Distributed Comput., 2025)