| Publication | Date of Publication | Type |
|---|
Edge-connectivity augmentation of simple graphs
SIAM Journal on Discrete Mathematics | 2025-01-22 | Paper |
Triangulations admit dominating sets of size \(2n/7\).
| 2024-11-28 | Paper |
Dynamic dynamic time warping
| 2024-11-28 | Paper |
Adaptive out-orientations with applications
| 2024-11-28 | Paper |
Multilevel skeletonization using local separators
| 2024-10-16 | Paper |
Worst-case deterministic fully-dynamic biconnectivity in changeable planar embeddings
| 2024-10-16 | Paper |
Amortised analysis of dynamic data structures (invited talk)
| 2024-10-08 | Paper |
Good \(r\)-divisions imply optimal amortized decremental biconnectivity
Theory of Computing Systems | 2024-10-07 | Paper |
On dynamic \(\alpha+1\) Arboricity decomposition and out-orientation
| 2024-08-06 | Paper |
Fully-dynamic \(\alpha + 2\) Arboricity decompositions and implicit colouring
| 2024-06-24 | Paper |
Simple and robust dynamic two-dimensional convex hull
| 2024-05-29 | Paper |
Splay top trees
| 2024-05-14 | Paper |
On the discrete Fréchet distance in a graph
| 2024-05-14 | Paper |
Improved dynamic colouring of sparse graphs
| 2024-05-08 | Paper |
Triangulations Admit Dominating Sets of Size $2n/7$
| 2023-10-17 | Paper |
On Dynamic Graphs (Invited Talk).
| 2023-08-08 | Paper |
Compressed communication complexity of longest common prefixes
String Processing and Information Retrieval | 2023-07-28 | Paper |
String indexing for top-\(k\) close consecutive occurrences
Theoretical Computer Science | 2022-08-10 | Paper |
scientific article; zbMATH DE number 7378722 (Why is no real title available?)
| 2021-08-04 | Paper |
Decremental SPQR-trees for Planar Graphs
| 2021-08-04 | Paper |
One-way trail orientations
| 2021-07-28 | Paper |
Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Fully-dynamic planarity testing in polylogarithmic time
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Escaping an infinitude of lions
The American Mathematical Monthly | 2020-12-17 | Paper |
Contracting a planar graph efficiently
| 2020-05-27 | Paper |
Online bipartite matching with amortized \(O(\log^2 n)\) replacements
Journal of the ACM | 2020-02-11 | Paper |
Fast fencing
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Best laid plans of lions and men
| 2018-08-13 | Paper |
The power of two choices with simple tabulation
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Online bipartite matching with amortized \(\mathcal O(\log^2 n)\) replacements
| 2018-03-15 | Paper |
scientific article; zbMATH DE number 6850339 (Why is no real title available?)
| 2018-03-15 | Paper |
A Hamiltonian cycle in the square of a 2-connected graph in linear time
| 2018-03-15 | Paper |
Dynamic bridge-finding in \(\tilde{O}(\log^2 n)\) amortized time
| 2018-03-15 | Paper |
Dynamic planar embeddings of dynamic graphs
Theory of Computing Systems | 2018-02-01 | Paper |
Graph reconstruction with a betweenness oracle
| 2018-01-24 | Paper |
Dynamic planar embeddings of dynamic graphs
| 2017-01-24 | Paper |
Faster Fully-Dynamic Minimum Spanning Forest
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Strength of the reversible, garbage-free \(2^{k } \pm 1\) multiplier
Reversible Computation | 2013-12-17 | Paper |
