| Publication | Date of Publication | Type |
|---|
| Temporal queries for dynamic temporal forests | 2026-06-08 | Paper |
| An output sensitive solution to the set union and intersection problem | 2024-06-21 | Paper |
| Single-source shortest p-disjoint paths: fast computation and sparse preservers | 2024-04-23 | Paper |
Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Sequence Hypergraphs: Paths, Flows, and Cuts
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
| Cutting bamboo down to size | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650297 (Why is no real title available?) | 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 |
ATM layouts with bounded hop count and congestion
Distributed Computing | 2020-12-03 | Paper |
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
(available as arXiv preprint) | 2020-11-25 | Paper |
Tracking routes in communication networks
Theoretical Computer Science | 2020-10-21 | 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 |
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
Journal of Combinatorial Optimization | 2019-06-25 | 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 |
Sequence hypergraphs
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Exact and approximate algorithms for movement problems on (special classes of) graphs
Theoretical Computer Science | 2016-11-04 | Paper |
Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
Finding the detour-critical edge of a shortest path between two nodes
Information Processing Letters | 2016-06-09 | Paper |
A Faster Computation of All the Best Swap Edges of a Tree Spanner
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Path-fault-tolerant approximate shortest-path trees
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 |
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 |
Dynamically maintaining shortest path trees under batches of updates
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 |
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 |
Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs
Lecture Notes in Computer Science | 2011-03-18 | Paper |
| scientific article; zbMATH DE number 5859273 (Why is no real title available?) | 2011-03-01 | 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 |
Strongly polynomial-time truthful mechanisms in one shot
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 |
On k-connectivity problems with sharpened triangle inequality
Journal of Discrete Algorithms | 2009-02-23 | 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 |
Locating Facilities on a Network to Minimize Their Average Service Radius
Algorithms and Computation | 2008-05-27 | Paper |
Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
Algorithms and Computation | 2008-04-24 | 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 |
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
Theoretical Computer Science | 2007-09-19 | Paper |
| On the stability of approximation for Hamiltonian path problems | 2007-01-18 | Paper |
Efficient management of transient station failures in linear radio communication networks with bases
Journal of Parallel and Distributed Computing | 2006-08-04 | Paper |
Efficient unbalanced merge-sort
Information Sciences | 2006-05-16 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | 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 |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
| scientific article; zbMATH DE number 2163018 (Why is no real title available?) | 2005-04-29 | Paper |
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Theoretical Computer Science | 2005-01-11 | Paper |
Nearly linear time minimum spanning tree maintenance for transient node failures
Algorithmica | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2081003 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2011856 (Why is no real title available?) | 2003-12-02 | Paper |
| scientific article; zbMATH DE number 1979495 (Why is no real title available?) | 2003-09-14 | Paper |
Polynomial time algorithms for 2-edge-connectivity augmentation problems
Algorithmica | 2003-08-19 | Paper |
Finding the most vital node of a shortest path.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1954373 (Why is no real title available?) | 2003-07-28 | Paper |
Swapping a failing edge of a single source shortest paths tree is good and fast
Algorithmica | 2003-06-02 | Paper |
An efficient spatial access method for spatial images containing multiple non-overlapping features
Information Systems | 2003-02-20 | Paper |
| scientific article; zbMATH DE number 1796972 (Why is no real title available?) | 2002-09-05 | Paper |
A faster computation of the most vital edge of a shortest path
Information Processing Letters | 2002-07-14 | Paper |
Finding all the best swaps of a minimum diameter spanning tree under transient edge failures
Journal of Graph Algorithms and Applications | 2002-01-07 | Paper |
| scientific article; zbMATH DE number 1670672 (Why is no real title available?) | 2001-11-11 | Paper |
A generalized comparison of linear representations of thematic layers
Data & Knowledge Engineering | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1405681 (Why is no real title available?) | 2001-02-18 | Paper |
| scientific article; zbMATH DE number 1305082 (Why is no real title available?) | 2000-03-13 | Paper |
Intersection reporting on two collections of disjoint sets
Information Sciences | 2000-01-05 | Paper |
An optimal algorithm for decomposing a window into maximal quadtree blocks
Acta Informatica | 1999-11-09 | Paper |
