Giovanni Viglietta

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 79

Top Venues

Publications

Giovanni Viglietta
History Trees and Their Applications. CoRR (2024)
Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara
Computational complexity of jumping block puzzles. Theor. Comput. Sci. 983 (2024)
Giuseppe Antonio Di Luna, Giovanni Viglietta
Efficient Computation in Congested Anonymous Dynamic Networks. MFCS (2024)
Giovanni Viglietta
History Trees and Their Applications. SIROCCO (2024)
Hugo A. Akitaya, Maarten Löffler, Giovanni Viglietta
Pushing Blocks by Sweeping Lines. Comput. Geom. Topol. 2 (1) (2023)
Giovanni Viglietta
Minimal Arrangements of Spherical Geodesics. CoRR (2023)
Giovanni Viglietta
A Theory of Spherical Diagrams. Comput. Geom. Topol. 2 (2) (2023)
Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta
Minimizing Visible Edges in Polyhedra. Graphs Comb. 39 (5) (2023)
Giuseppe Antonio Di Luna, Giovanni Viglietta
Efficient Computation in Congested Anonymous Dynamic Networks. CoRR (2023)
Giuseppe Antonio Di Luna, Giovanni Viglietta
Optimal Computation in Leaderless and Multi-Leader Disconnected Anonymous Dynamic Networks. DISC (2023)
Giuseppe Antonio Di Luna, Giovanni Viglietta
Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks. PODC (2023)
Kwon Kham Sai, Giovanni Viglietta, Ryuhei Uehara
Cyclic Shift Problems on Graphs. IEICE Trans. Inf. Syst. (3) (2022)
Hugo A. Akitaya, Maarten Löffler, Giovanni Viglietta
Pushing Blocks by Sweeping Lines. CoRR (2022)
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications. Distributed Comput. 35 (2) (2022)
Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta
Token shifting on graphs. Int. J. Comput. Math. Comput. Syst. Theory 7 (4) (2022)
Tianfeng Feng, Ryuhei Uehara, Giovanni Viglietta
Bicolored Path Embedding Problems Inspired by Protein Folding Models. IEICE Trans. Inf. Syst. (3) (2022)
Javier Cano, Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta
Edge guards for polyhedra in three-space. Comput. Geom. 104 (2022)
Giuseppe Antonio Di Luna, Giovanni Viglietta
Computing in Anonymous Dynamic Networks Is Linear. FOCS (2022)
Giuseppe Antonio Di Luna, Giovanni Viglietta
Computing in Anonymous Dynamic Networks Is Linear. CoRR (2022)
Hugo A. Akitaya, Maarten Löffler, Giovanni Viglietta
Pushing Blocks by Sweeping Lines. FUN (2022)
Tianfeng Feng, Leonie Ryvkin, Jérôme Urhausen, Giovanni Viglietta
Complexity of Critter Crunch. IEICE Trans. Inf. Syst. (3) (2022)
Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta
Minimizing Visible Edges in Polyhedra. CoRR (2022)
Giuseppe Antonio Di Luna, Giovanni Viglietta
Leaderless and Multi-Leader Computation in Disconnected Anonymous Dynamic Networks. CoRR (2022)
Giovanni Viglietta
A Theory of Spherical Diagrams. CCCG (2022)
Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta
Cyclic Shift Problems on Graphs. WALCOM (2021)
Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta
Token Shifting on Graphs. COCOON (2021)
Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta
Chasing Puppies: Mobile Beacon Routing on Closed Curves. SoCG (2021)
Giovanni Viglietta
A Theory of Spherical Diagrams. CoRR (2021)
Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi L. Vermeulen, Giovanni Viglietta
Chasing Puppies: Mobile Beacon Routing on Closed Curves. CoRR (2021)
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi
Mobile RAM and Shape Formation by Programmable Particles. CoRR (2020)
Giovanni Viglietta
Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards. Comput. Geom. 86 (2020)
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
Meeting in a polygon by anonymous oblivious robots. Distributed Comput. 33 (5) (2020)
Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta
Cyclic Shift Problems on Graphs. CoRR (2020)
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi
Shape formation by programmable particles. Distributed Comput. 33 (1) (2020)
Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
Gathering in dynamic rings. Theor. Comput. Sci. 811 (2020)
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
Fault-tolerant simulation of population protocols. Distributed Comput. 33 (6) (2020)
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi
Mobile RAM and Shape Formation by Programmable Particles. Euro-Par (2020)
Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots. DISC (2020)
Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots. CoRR (2020)
Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
Oblivious Permutations on the Plane. CoRR (2019)
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
Population protocols with faulty interactions: The impact of a leader. Theor. Comput. Sci. 754 (2019)
Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
Oblivious Permutations on the Plane. OPODIS (2019)
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
Line Recovery by Programmable Particles. ICDCN (2018)
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and Its Applications. DISC (2018)
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and its Applications. CoRR (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
Line-Recovery by Programmable Particles. CoRR (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
Population Protocols with Faulty Interactions: The Impact of a Leader. CIAC (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi
Shape Formation by Programmable Particles. CoRR (2017)
Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi
Constructing self-stabilizing oscillators in population protocols. Inf. Comput. 255 (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. ICDCS (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi
Shape Formation by Programmable Particles. OPODIS (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Federico Poloni, Nicola Santoro, Giovanni Viglietta
Mutual visibility by luminous robots without collisions. Inf. Comput. 254 (2017)
Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta
Mediated Population Protocols: Leader Election and Applications. TAMC (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
Meeting in a Polygon by Anonymous Oblivious Robots. DISC (2017)
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
Distributed computing by mobile robots: uniform circle formation. Distributed Comput. 30 (6) (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi
Brief Announcement: Shape Formation by Programmable Particles. DISC (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
Gathering in Dynamic Rings. CoRR (2017)
Giovanni Viglietta
Optimally Guarding 2-Reflex Orthogonal Polyhedra by Reflex Edge Guards. CoRR (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots. CoRR (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
Gathering in Dynamic Rings. SIROCCO (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
Population Protocols with Faulty Interactions: the Impact of a Leader. CoRR (2016)
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. CoRR (2016)
Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
Implicit Function Computation by Oblivious Mobile Robots. CoRR (2016)
Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
Rendezvous with constant memory. Theor. Comput. Sci. 621 (2016)
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
A Rupestrian Algorithm. FUN (2016)
Marcello Mamino, Giovanni Viglietta
Square Formation by Asynchronous Oblivious Robots. CoRR (2016)
Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
Universal Systems of Oblivious Mobile Robots. SIROCCO (2016)
Erik D. Demaine, Giovanni Viglietta, Aaron Williams
Super Mario Bros. is Harder/Easier Than We Thought. FUN (2016)
Marcello Mamino, Giovanni Viglietta
Square Formation by Asynchronous Oblivious Robots. CCCG (2016)
Giovanni Viglietta
Simulating a die roll by flipping two coins. CoRR (2015)
Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta
Getting close without touching: near-gathering for autonomous mobile robots. Distributed Comput. 28 (5) (2015)
Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi
Constructing Self-stabilizing Oscillators in Population Protocols. SSS (2015)
Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta
Getting Close Without Touching: Near-Gathering for Autonomous Mobile Robots. CoRR (2015)
Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Federico Poloni, Nicola Santoro, Giovanni Viglietta
Mutual Visibility by Luminous Robots Without Collisions. CoRR (2015)
Giovanni Viglietta, Prosenjit Bose, Jean-Lou De Carufel, Michael Gene Dobbins, Heuna Kim
The Shadows of a Cycle Cannot All Be Paths. CCCG (2015)
Giovanni Viglietta
Reprint of: Face-guarding polyhedra. Comput. Geom. 48 (5) (2015)
Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta
Classic Nintendo games are (computationally) hard. Theor. Comput. Sci. 586 (2015)
Giovanni Viglietta
Lemmings is PSPACE-complete. Theor. Comput. Sci. 586 (2015)
Prosenjit Bose, Jean-Lou De Carufel, Michael Gene Dobbins, Heuna Kim, Giovanni Viglietta
The Shadows of a Cycle Cannot All Be Paths. CoRR (2015)
Giovanni Viglietta
Gaming Is a Hard Job, but Someone Has to Do It! Theory Comput. Syst. 54 (4) (2014)
Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Nicola Santoro, Giovanni Viglietta
Robots with Lights: Overcoming Obstructed Visibility Without Colliding. CoRR (2014)
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem. OPODIS (2014)
Giuseppe Antonio Di Luna, Paola Flocchini, Federico Poloni, Nicola Santoro, Giovanni Viglietta
The Mutual Visibility Problem for Oblivious Robots. CCCG (2014)
Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Nicola Santoro, Giovanni Viglietta
Robots with Lights: Overcoming Obstructed Visibility Without Colliding. SSS (2014)
Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta
Classic Nintendo Games Are (Computationally) Hard. FUN (2014)
Giovanni Viglietta
Lemmings Is PSPACE-Complete. FUN (2014)
Giovanni Viglietta
Face-guarding polyhedra. Comput. Geom. 47 (8) (2014)
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem. CoRR (2014)
Giovanni Viglietta
Face-Guarding Polyhedra CoRR (2013)
Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
Rendezvous of Two Robots with Constant Memory. SIROCCO (2013)
Giovanni Viglietta
Rendezvous of Two Robots with Visible Bits. ALGOSENSORS (2013)
Giovanni Viglietta
Partial Searchlight Scheduling is Strongly PSPACE-complete. CCCG (2013)
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow
Algorithms for Designing Pop-Up Cards. STACS (2013)
Giovanni Viglietta
Face-Guarding Polyhedra. CCCG (2013)
Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
Rendezvous of Two Robots with Constant Memory. CoRR (2013)
Giovanni Viglietta
Guarding and Searching Polyhedra CoRR (2012)
Giovanni Viglietta
Hardness of Mastermind. FUN (2012)
Giovanni Viglietta
Lemmings is PSPACE-complete CoRR (2012)
Giovanni Viglietta
Gaming is a hard job, but someone has to do it! CoRR (2012)
Giovanni Viglietta
Rendezvous of two robots with visible bits CoRR (2012)

Giovanni Viglietta.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Giovanni Viglietta