| Publication | Date of Publication | Type |
|---|
| Temporal queries for dynamic temporal forests | 2026-06-08 | Paper |
| Graph spanners for group Steiner distances | 2026-05-26 | Paper |
Uniform-budget solo chess with only rooks or only knights is hard
Theoretical Computer Science | 2025-11-10 | Paper |
| Sparse temporal spanners with low stretch | 2025-06-19 | Paper |
Finding diameter-reducing shortcuts in trees
Journal of Computer and System Sciences | 2025-05-07 | Paper |
| Single-source shortest p-disjoint paths: fast computation and sparse preservers | 2024-04-23 | Paper |
Blackout-tolerant temporal spanners
Journal of Computer and System Sciences | 2024-01-22 | Paper |
Finding diameter-reducing shortcuts in trees
Lecture Notes in Computer Science | 2024-01-16 | Paper |
| Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees | 2024-01-15 | Paper |
Blackout-tolerant temporal spanners
Algorithmics of Wireless Networks | 2023-08-04 | Paper |
Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
Algorithmica | 2023-06-05 | Paper |
| Cutting bamboo down to size | 2023-02-07 | Paper |
| Consensus vs Broadcast, with and without Noise | 2023-02-03 | Paper |
New approximation algorithms for the heterogeneous weighted delivery problem
Theoretical Computer Science | 2022-09-16 | 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 |
A tight analysis of the parallel undecided-state dynamics with two colors
(available as arXiv preprint) | 2021-08-04 | Paper |
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
(available as arXiv preprint) | 2020-11-25 | Paper |
Coalition resilient outcomes in max k-cut games
(available as arXiv preprint) | 2020-10-22 | 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 |
| Efficient oracles and routing schemes for replacement paths | 2020-08-05 | 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
(available as arXiv preprint) | 2018-04-12 | Paper |
Compact and fast sensitivity oracles for single-source distances
(available as arXiv preprint) | 2018-03-02 | Paper |
Multiple-edge-fault-tolerant approximate shortest-path trees
(available as arXiv preprint) | 2018-01-24 | Paper |
Large peg-army maneuvers
(available as arXiv preprint) | 2017-07-17 | 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 |
Reducing the diameter of a unit disk graph via node addition
Information Processing Letters | 2015-07-15 | 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 |
The max-distance network creation game on general host graphs
Lecture Notes in Computer Science | 2013-04-11 | Paper |
On Stackelberg pricing with computationally bounded customers
Networks | 2012-11-15 | Paper |
Improved approximability and non-approximability results for graph diameter decreasing problems
Theoretical Computer Science | 2012-03-13 | 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 |
Stability of networks in stretchable graphs
Structural Information and Communication Complexity | 2010-02-24 | 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 |
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 |
Exact and approximate truthful mechanisms for the shortest paths tree problem
Algorithmica | 2007-11-28 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
