Luciano Gualà

Stefano Leucci

Isabella Ziccardi

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Cutting Bamboo down to Size.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

2020

Consensus vs Broadcast, with and Without Noise (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019

Coalition Resilient Outcomes in Max k-Cut Games.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Tracking Routes in Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

2018

Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise.

[BibT_eX]

[DOI]

CoRR, 2018

Efficient Oracles and Routing Schemes for Replacement Paths.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

On the Complexity of Two Dots for Narrow Boards and Few Colors.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017

On the Parallel Undecided-State Dynamics with Two Colors.

[BibT_eX]

[DOI]

CoRR, 2017

Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors.

[BibT_eX]

[DOI]

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

Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2017

An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Rational Fair Consensus in the Gossip Model.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016

Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees.

[BibT_eX]

[DOI]

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Large Peg-Army Maneuvers.

[BibT_eX]

[DOI]

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

Compact and Fast Sensitivity Oracles for Single-Source Distances.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Reducing the diameter of a unit disk graph via node addition.

[BibT_eX]

[DOI]

Miriam Di Ianni

Gianluca Rossi

Inf. Process. Lett., 2015

A Faster Computation of All the Best Swap Edges of a Tree Spanner.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

Improved Purely Additive Fault-Tolerant Spanners.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Locality-based network creation games.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Network Creation Games with Traceroute-Based Strategies.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2014

Fault-Tolerant Approximate Shortest-Path Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

Bejeweled, Candy Crush and other match-three games are (NP-)hard.

[BibT_eX]

[DOI]

Stefano Leucci

Emanuele Natale

Proceedings of the 2014 IEEE Conference on Computational Intelligence and Games, 2014

2013

Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2013

A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Polygon-Constrained Motion Planning Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

On stackelberg pricing with computationally bounded customers.

[BibT_eX]

[DOI]

Networks, 2012

Bounded-Distance Network Creation Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

The Max-Distance Network Creation Game on General Host Graphs.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

2011

Network Verification via Routing Table Queries.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

2010

Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2009

On Stackelberg Pricing with Computationally Bounded Consumers.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Stability of Networks in Stretchable Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2009

2008

Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2007

Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem.

[BibT_eX]

[DOI]

Algorithmica, 2007

Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

An algorithm composition scheme preserving monotonicity.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Locating Facilities on a Network to Minimize Their Average Service Radius.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

Dynamic Mechanism Design.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, Second International Workshop, 2006

On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2006

Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005

Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals.

[BibT_eX]

[DOI]