Luciano Gualà

Stefano Leucci

Isabella Ziccardi

Algorithmica, June, 2023

Finding Diameter-Reducing Shortcuts in Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022

New approximation algorithms for the heterogeneous weighted delivery problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Cutting bamboo down to size.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

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

[BibT_eX]

[DOI]

Algorithmica, 2022

Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Sparse Temporal Spanners with Low Stretch.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Finding single-source shortest p-disjoint paths: fast computation and sparse preservers.

[BibT_eX]

[DOI]

CoRR, 2021

Network Creation Games with Traceroute-Based Strategies.

[BibT_eX]

[DOI]

Algorithms, 2021

2020

Tracking routes in communication networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

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

[BibT_eX]

[DOI]

Algorithmica, 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

2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Fault-Tolerant Approximate Shortest-Path Trees.

[BibT_eX]

[DOI]

Algorithmica, 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

Rational Fair Consensus in the Gossip Model.

[BibT_eX]

[DOI]

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

2016

Locality-Based Network Creation Games.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2016

Exact and approximate algorithms for movement problems on (special classes of) graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Bounded-Distance Network Creation Games.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

Specializations and generalizations of the Stackelberg minimum spanning tree game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The max-distance network creation game on general host graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Network verification via routing table queries.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 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 Shortest Paths Tree.

[BibT_eX]

[DOI]

Algorithmica, 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

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

[BibT_eX]

[DOI]

Algorithmica, 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

Polygon-Constrained Motion Planning Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Improved approximability and non-approximability results for graph diameter decreasing problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On stackelberg pricing with computationally bounded customers.

[BibT_eX]

[DOI]

Networks, 2012

2009

Dynamic mechanism design.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

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

[BibT_eX]

[DOI]

Internet Math., 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

Efficient truthful mechanisms for the single-source shortest paths tree problem.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2007

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

[BibT_eX]

[DOI]

Algorithmica, 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

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

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

[BibT_eX]

[DOI]