| Publication | Date of Publication | Type |
|---|
| Adaptive out-orientations with applications | 2024-11-28 | Paper |
| Worst-case deterministic fully-dynamic biconnectivity in changeable planar embeddings | 2024-10-16 | 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 |
| Massively parallel computation on embedded planar graphs | 2024-05-14 | Paper |
| Splay top trees | 2024-05-14 | Paper |
Decremental SPQR-trees for Planar Graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
One-way trail orientations
(available as arXiv preprint) | 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 |
Near-optimal induced universal graphs for cycles and paths
Discrete Applied Mathematics | 2020-06-05 | Paper |
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
Contracting a planar graph efficiently
(available as arXiv preprint) | 2020-05-27 | Paper |
Online bipartite matching with amortized \(O(\log^2 n)\) replacements
Journal of the ACM | 2020-02-11 | Paper |
Best laid plans of lions and men
(available as arXiv preprint) | 2018-08-13 | Paper |
Minimizing diameters of dynamic trees
Automata, Languages and Programming | 2018-07-04 | Paper |
| Online bipartite matching with amortized \(\mathcal O(\log^2 n)\) replacements | 2018-03-15 | Paper |
| Dynamic bridge-finding in \(\tilde{O}(\log^2 n)\) amortized time | 2018-03-15 | Paper |
Dynamic bridge-finding in \(\tilde{O}(\log^2 n)\) amortized time
(available as arXiv preprint) | 2018-03-15 | Paper |
Dynamic planar embeddings of dynamic graphs
Theory of Computing Systems | 2018-02-01 | Paper |
Dynamic planar embeddings of dynamic graphs
(available as arXiv preprint) | 2017-01-24 | Paper |
Faster Fully-Dynamic Minimum Spanning Forest
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Maintaining information in fully dynamic trees with top trees
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
Journal of the ACM | 2008-02-11 | Paper |
| scientific article; zbMATH DE number 1670815 (Why is no real title available?) | 2001-12-09 | Paper |
| scientific article; zbMATH DE number 1617247 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1303574 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1775391 (Why is no real title available?) | 1998-01-01 | Paper |
