Davide Bilò

Kleitos Papadopoulos

CoRR, 2018

On the Tree Conjecture for the Network Creation Game.

[BibT_eX]

[DOI]

Pascal Lenzner

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 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

Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees.

[BibT_eX]

[DOI]

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

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

2016

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

[BibT_eX]

[DOI]

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

Compact and Fast Sensitivity Oracles for Single-Source Distances.

[BibT_eX]

[DOI]

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

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

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

New Bounds for the Balloon Popping Problem.

[BibT_eX]

[DOI]

Vittorio Bilò

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Polygon-Constrained Motion Planning Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

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

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

New Reoptimization Techniques applied to Steiner Tree Problem.

[BibT_eX]

[DOI]

Anna Zych

Electron. Notes Discret. Math., 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

Stability of Networks in Stretchable Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2009

Reconstructing Visibility Graphs with Simple Robots.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2009

Reoptimization of the Shortest Common Superstring Problem.

[BibT_eX]

[DOI]

Hans-Joachim Böckenhauer

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 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

Approximating the Metric TSP in Linear Time.

[BibT_eX]

[DOI]

Luca Forlizzi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

Discovery of Network Properties with All-Shortest-Paths Queries.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2008

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

On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 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]