| Publication | Date of Publication | Type |
|---|
| Algorithmic trade-offs for girth approximation in undirected graphs | 2024-07-19 | Paper |
| Insertion-only dynamic connectivity in general disk graphs | 2024-05-29 | Paper |
| Improved girth approximation in weighted undirected graphs | 2024-05-14 | Paper |
| Dynamic connectivity in disk graphs | 2024-05-14 | Paper |
| New algorithms for all pairs approximate shortest paths | 2024-05-08 | Paper |
Dynamic connectivity in disk graphs
Discrete & Computational Geometry | 2024-01-09 | Paper |
| A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. | 2023-09-20 | Paper |
Approximate Single-Source Fault Tolerant Shortest Path
ACM Transactions on Algorithms | 2023-04-26 | Paper |
Approximate distance oracles with improved stretch for sparse graphs
Lecture Notes in Computer Science | 2023-03-30 | Paper |
Approximate distance oracles with improved stretch for sparse graphs
Theoretical Computer Science | 2023-01-05 | Paper |
scientific article; zbMATH DE number 7561506 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561404 (Why is no real title available?) | 2022-07-21 | Paper |
Triangles and girth in disk graphs and transmission graphs
(available as arXiv preprint) | 2022-05-11 | Paper |
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
SIAM Journal on Computing | 2021-08-06 | Paper |
Stabbing pairwise intersecting disks by five points
Discrete Mathematics | 2021-06-14 | Paper |
Stabbing pairwise intersecting disks by five points
Discrete Mathematics | 2021-06-14 | Paper |
An almost 2-approximation for all-pairs of shortest paths in subquadratic time
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
Discrete & Computational Geometry | 2020-10-23 | Paper |
| An efficient strongly connected components algorithm in the fault tolerant model | 2020-05-27 | Paper |
Reachability oracles for directed transmission graphs
Algorithmica | 2020-04-01 | Paper |
Towards tight approximation bounds for graph diameter and eccentricities
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Better approximation algorithms for the graph diameter
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Decremental maintenance of strongly connected components
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| scientific article; zbMATH DE number 7053319 (Why is no real title available?) | 2019-05-10 | Paper |
An efficient strongly connected components algorithm in the fault tolerant model
Algorithmica | 2019-03-11 | Paper |
An efficient strongly connected components algorithm in the fault tolerant model
Algorithmica | 2019-03-11 | Paper |
A faster and simpler fully dynamic transitive closure
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Fault tolerant reachability for directed graphs | 2018-08-24 | Paper |
Spanners for directed transmission graphs
SIAM Journal on Computing | 2018-08-21 | Paper |
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Routing in unit disk graphs
Algorithmica | 2018-04-11 | Paper |
| Approximating cycles in directed graphs: fast algorithms for girth and roundtrip spanners | 2018-03-15 | Paper |
Approximating cycles in directed graphs: fast algorithms for girth and roundtrip spanners
(available as arXiv preprint) | 2018-03-15 | Paper |
| scientific article; zbMATH DE number 6850433 (Why is no real title available?) | 2018-03-15 | Paper |
Fault-tolerant subgraph for single-source reachability: general and optimal
SIAM Journal on Computing | 2018-01-31 | Paper |
| Spanners and Reachability Oracles for Directed Transmission Graphs | 2017-10-10 | Paper |
| Approximating the girth | 2017-09-29 | Paper |
| Improved dynamic algorithms for maintaining approximate shortest paths under deletions | 2017-09-29 | Paper |
Fault tolerant subgraph for single source reachability: generic and optimal
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Fast, precise and dynamic distance queries | 2017-09-29 | Paper |
Fast, precise and dynamic distance queries
(available as arXiv preprint) | 2017-09-29 | Paper |
An experimental study on approximating \(k\) shortest simple paths
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
SIAM Journal on Computing | 2016-06-01 | Paper |
Configurations and minority in the string consensus problem
Algorithmica | 2016-05-31 | Paper |
Routing in unit disk graphs
Lecture Notes in Computer Science | 2016-05-03 | Paper |
New routing techniques and their applications
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Close to linear space routing schemes
Distributed Computing | 2016-03-01 | Paper |
Preprocess, set, query!
Algorithmica | 2015-03-23 | Paper |
Close to linear space routing schemes
Lecture Notes in Computer Science | 2015-02-10 | Paper |
Fault-tolerant spanners for general graphs
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
| On the \(k\)-simple shortest paths problem in weighted directed graphs | 2014-12-18 | Paper |
| On bounded leg shortest paths problems | 2014-12-18 | Paper |
Approximating the girth
ACM Transactions on Algorithms | 2014-12-05 | Paper |
A near-linear-time algorithm for computing replacement paths in planar directed graphs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
All-pairs shortest paths with a sublinear additive error
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Replacement paths and \(k\) simple shortest paths in unweighted directed graphs
ACM Transactions on Algorithms | 2014-09-09 | Paper |
On the hardness of the consensus string problem
Information Processing Letters | 2014-08-13 | Paper |
Fast approximation algorithms for the diameter and radius of sparse graphs
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Minimum Weight Cycles and Triangles: Equivalences and Algorithms
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
SINR diagrams, towards algorithmically usable SINR models of wireless networks
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
On the Efficiency of the Hamming C-Centerstring Problems
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Distance oracles beyond the Thorup-Zwick bound
SIAM Journal on Computing | 2014-06-04 | Paper |
Multiply balanced \(k\)-partitioning
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
SINR diagrams, convexity and its applications in wireless networks
Journal of the ACM | 2014-02-17 | Paper |
Finding the Minimum-Weight k-Path
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Configurations and minority in the string consensus problem
String Processing and Information Retrieval | 2013-04-08 | Paper |
Relaxed spanners for directed disk graphs
Algorithmica | 2013-03-05 | Paper |
\(f\)-sensitivity distance oracles and routing schemes
Algorithmica | 2012-12-06 | Paper |
Distributed algorithms for network diameter and girth
Automata, Languages, and Programming | 2012-11-01 | Paper |
Dynamic approximate all-pairs shortest paths in undirected graphs
SIAM Journal on Computing | 2012-09-12 | Paper |
Fully dynamic geometric spanners
Algorithmica | 2012-04-26 | Paper |
| Relaxed Spanners for Directed Disk Graphs | 2012-01-23 | Paper |
On dynamic shortest paths problems
Algorithmica | 2011-09-20 | Paper |
Preprocess, set, query!
Algorithms – ESA 2011 | 2011-09-16 | Paper |
An experimental study on approximating \(k\) shortest simple paths
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Dynamic connectivity: connecting to networks and geometry
SIAM Journal on Computing | 2011-07-29 | Paper |
Fault tolerant spanners for general graphs
SIAM Journal on Computing | 2011-04-04 | Paper |
On bounded leg shortest paths problems
Algorithmica | 2011-03-30 | Paper |
On the k Shortest Simple Paths Problem in Weighted Directed Graphs
SIAM Journal on Computing | 2011-01-17 | Paper |
\(f\)-sensitivity distance oracles and routing schemes
Algorithms – ESA 2010 | 2010-09-06 | Paper |
On nash equilibria for a network creation game
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
| scientific article; zbMATH DE number 5764857 (Why is no real title available?) | 2010-08-06 | Paper |
| scientific article; zbMATH DE number 5764782 (Why is no real title available?) | 2010-08-06 | Paper |
Fully dynamic geometric spanners
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
An Optimal Dynamic Spanner for Doubling Metric Spaces
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Improved Dynamic Reachability Algorithms for Directed Graphs
SIAM Journal on Computing | 2008-10-28 | Paper |
All-Pairs Shortest Paths with a Sublinear Additive Error
Automata, Languages and Programming | 2008-08-28 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 2119746 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2079364 (Why is no real title available?) | 2004-07-28 | Paper |
