| Publication | Date of Publication | Type |
|---|
Fault-tolerant \(ST\)-diameter oracles
| 2024-11-14 | Paper |
New algorithms for Steiner tree reoptimization
Algorithmica | 2024-08-13 | Paper |
Approximate distance sensitivity oracles in subquadratic space
TheoretiCS | 2024-07-03 | Paper |
Deterministic sensitivity oracles for diameter, eccentricities and all pairs distances
| 2024-06-24 | Paper |
Approximate distance sensitivity oracles in subquadratic space
| 2024-05-08 | Paper |
Single-source shortest \(p\)-disjoint paths: fast computation and sparse preservers
| 2024-04-23 | Paper |
scientific article; zbMATH DE number 7829255 (Why is no real title available?)
| 2024-04-09 | Paper |
Geometric Network Creation Games
SIAM Journal on Discrete Mathematics | 2024-01-23 | Paper |
Blackout-tolerant temporal spanners
Journal of Computer and System Sciences | 2024-01-22 | Paper |
Compact distance oracles with large sensitivity and low stretch
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Finding diameter-reducing shortcuts in trees
Lecture Notes in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7740873 (Why is no real title available?)
| 2023-09-20 | Paper |
scientific article; zbMATH DE number 7724191 (Why is no real title available?)
| 2023-08-08 | Paper |
Blackout-tolerant temporal spanners
Algorithmics of Wireless Networks | 2023-08-04 | Paper |
Cutting bamboo down to size
| 2023-02-07 | Paper |
New approximation algorithms for the heterogeneous weighted delivery problem
Theoretical Computer Science | 2022-09-16 | Paper |
Almost optimal algorithms for diameter-optimally augmenting trees
Theoretical Computer Science | 2022-09-01 | Paper |
Almost optimal algorithms for diameter-optimally augmenting trees
| 2022-07-21 | Paper |
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
| 2022-07-21 | Paper |
Topological Influence and Locality in Swap Schelling Games.
| 2022-07-18 | Paper |
New approximation algorithms for the heterogeneous weighted delivery problem
Structural Information and Communication Complexity | 2022-03-22 | Paper |
Cutting bamboo down to size
Theoretical Computer Science | 2022-03-01 | Paper |
Multiple-edge-fault-tolerant approximate shortest-path trees
Algorithmica | 2022-02-01 | Paper |
New algorithms for Steiner tree reoptimization
| 2021-07-28 | Paper |
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
| 2020-11-25 | Paper |
Tracking routes in communication networks
Theoretical Computer Science | 2020-10-21 | Paper |
On the complexity of Two Dots for narrow boards and few colors
| 2020-08-11 | Paper |
On the PSPACE-completeness of Peg Duotaire and other peg-jumping games
| 2020-08-11 | Paper |
On the tree conjecture for the network creation game
| 2020-08-05 | Paper |
Efficient oracles and routing schemes for replacement paths
| 2020-08-05 | Paper |
On the tree conjecture for the network creation game
Theory of Computing Systems | 2020-04-15 | Paper |
An improved algorithm for computing all the best swap edges of a tree spanner
Algorithmica | 2020-04-09 | Paper |
Tracking routes in communication networks
Structural Information and Communication Complexity | 2020-03-03 | Paper |
Fault-tolerant approximate shortest-path trees
Algorithmica | 2018-10-18 | Paper |
Polygon-constrained motion planning problems
| 2018-10-17 | Paper |
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges
| 2018-04-12 | Paper |
Compact and fast sensitivity oracles for single-source distances
| 2018-03-02 | Paper |
Multiple-edge-fault-tolerant approximate shortest-path trees
| 2018-01-24 | Paper |
Exact and approximate algorithms for movement problems on (special classes of) graphs
Theoretical Computer Science | 2016-11-04 | Paper |
A Faster Computation of All the Best Swap Edges of a Tree Spanner
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Improved purely additive fault-tolerant spanners
Algorithms - ESA 2015 | 2015-11-19 | Paper |
A faster computation of all the best swap edges of a shortest paths tree
Algorithmica | 2015-11-19 | Paper |
New bounds for the balloon popping problem
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
The max-distance network creation game on general host graphs
Theoretical Computer Science | 2015-02-24 | Paper |
Finding best swap edges minimizing the routing cost of a spanning tree
Algorithmica | 2014-12-02 | Paper |
Specializations and generalizations of the Stackelberg minimum spanning tree game
Theoretical Computer Science | 2014-12-02 | Paper |
Fault-tolerant approximate shortest-path trees
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Network verification via routing table queries
Journal of Computer and System Sciences | 2014-09-22 | Paper |
Network creation games with traceroute-based strategies
Structural Information and Communication Complexity | 2014-08-07 | Paper |
An algorithm composition scheme preserving monotonicity
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Exact and approximate algorithms for movement problems on (special classes of) graphs
Structural Information and Communication Complexity | 2013-12-17 | Paper |
A faster computation of all the best swap edges of a shortest paths tree
Lecture Notes in Computer Science | 2013-09-17 | Paper |
New reoptimization techniques applied to Steiner tree problem
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
New bounds for the balloon popping problem
Lecture Notes in Computer Science | 2013-06-11 | Paper |
The max-distance network creation game on general host graphs
Lecture Notes in Computer Science | 2013-04-11 | Paper |
New advances in reoptimizing the minimum Steiner tree problem
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Reconstructing visibility graphs with simple robots
Theoretical Computer Science | 2012-08-10 | Paper |
Improved approximability and non-approximability results for graph diameter decreasing problems
Theoretical Computer Science | 2012-03-13 | Paper |
Approximating the metric TSP in linear time
Theory of Computing Systems | 2011-11-30 | Paper |
Reoptimization of the shortest common superstring problem
Algorithmica | 2011-09-20 | Paper |
Finding best swap edges minimizing the routing cost of a spanning tree
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Improved approximability and non-approximability results for graph diameter decreasing problems
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems
Internet Mathematics | 2010-07-09 | Paper |
Discovery of network properties with all-shortest-paths queries
Theoretical Computer Science | 2010-04-06 | Paper |
Reconstructing visibility graphs with simple robots
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Stability of networks in stretchable graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Reoptimization of the Shortest Common Superstring Problem
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Dynamic mechanism design
Theoretical Computer Science | 2009-04-29 | Paper |
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Reoptimization of Weighted Graph and Covering Problems
Approximation and Online Algorithms | 2009-02-12 | Paper |
Approximating the Metric TSP in Linear Time
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
On the complexity of minimizing interference in ad-hoc and sensor networks
Theoretical Computer Science | 2008-08-14 | Paper |
Reoptimization of Steiner Trees
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Discovery of Network Properties with All-Shortest-Paths Queries
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Locating Facilities on a Network to Minimize Their Average Service Radius
Algorithms and Computation | 2008-05-27 | Paper |
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem
Combinatorial and Algorithmic Aspects of Networking | 2008-04-17 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
