Davide Bilò

Theor. Comput. Sci., 2022

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

[BibT_eX]

[DOI]

Algorithmica, 2022

Topological influence and locality in swap schelling games.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 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

Fixed-Parameter Sensitivity Oracles.

[BibT_eX]

[DOI]

J. A. Gregor Lagodzinski

Martin Schirneck

Simon Wietheger

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 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

Space-Efficient Fault-Tolerant Diameter Oracles.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Selfish Creation of Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Tracking routes in communication networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the Tree Conjecture for the Network Creation Game.

[BibT_eX]

[DOI]

Pascal Lenzner

Theory Comput. Syst., 2020

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

[BibT_eX]

[DOI]

Algorithmica, 2020

Fair Tree Connection Games with Topology-Dependent Edge Cost.

[BibT_eX]

[DOI]

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2018

An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs.

[BibT_eX]

[DOI]

Kleitos Papadopoulos

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 Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners.

[BibT_eX]

[DOI]

Kleitos Papadopoulos

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

New algorithms for Steiner tree reoptimization.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 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

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

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

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

New bounds for the balloon popping problem.

[BibT_eX]

[DOI]

Vittorio Bilò

J. Comb. Optim., 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

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

Reconstructing visibility graphs with simple robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

New Advances in Reoptimizing the Minimum Steiner Tree Problem.

[BibT_eX]

[DOI]

Anna Zych

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Approximating the Metric TSP in Linear Time.

[BibT_eX]

[DOI]

Luca Forlizzi

Theory Comput. Syst., 2011

New Reoptimization Techniques applied to Steiner Tree Problem.

[BibT_eX]

[DOI]

Anna Zych

Electron. Notes Discret. Math., 2011

Reoptimization of the Shortest Common Superstring Problem.

[BibT_eX]

[DOI]

Hans-Joachim Böckenhauer

Algorithmica, 2011

2010

Discovery of network properties with all-shortest-paths queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

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

Stability of Networks in Stretchable Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2009

2008

On the complexity of minimizing interference in ad-hoc and sensor networks.

[BibT_eX]

[DOI]

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

Reoptimization of Weighted Graph and Covering Problems.

[BibT_eX]

[DOI]

Peter Widmayer

Anna Zych

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Reoptimization of Steiner Trees.

[BibT_eX]

[DOI]

Hans-Joachim Böckenhauer

Proceedings of the Algorithm Theory, 2008

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

Range Augmentation Problems in Static Ad-Hoc Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

2004

A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Augmenting the Edge-Connectivity of a Spider Tree.

[BibT_eX]

[DOI]