| Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity J Holm, K de Lichtenberg, M Thorup Journal of the ACM (JACM) 48 (4), 723-760, 2001 | 756 | 2001 |
| Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity J Holm, K de Lichtenberg, M Thorup STOC '98, 79-89, 1998 | 750 | 1998 |
| Maintaining information in fully dynamic trees with top trees S Alstrup, J Holm, K de Lichtenberg, M Thorup ACM Transactions on Algorithms (TALG) 1 (2), 243-264, 2005 | 197 | 2005 |
| Improved algorithms for finding level ancestors in dynamic trees S Alstrup, J Holm International Colloquium on Automata, Languages, and Programming, 73-84, 2000 | 87 | 2000 |
| Online Bipartite Matching with Amortized O(log² n) Replacements A Bernstein, J Holm, E Rotenberg Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 78 | 2018 |
| Minimizing diameters of dynamic trees S Alstrup, J Holm, K de Lichtenberg, M Thorup International Colloquium on Automata, Languages, and Programming, 270-280, 1997 | 74 | 1997 |
| Faster fully-dynamic minimum spanning forest J Holm, E Rotenberg, C Wulff-Nilsen Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 48 | 2015 |
| Maintaining center and median in dynamic trees S Alstrup, J Holm, M Thorup Scandinavian Workshop on Algorithm Theory, 46-56, 2000 | 42 | 2000 |
| Dynamic Bridge-Finding in Õ(log² n) Amortized Time J Holm, E Rotenberg, M Thorup Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 31 | 2018 |
| Fully-dynamic planarity testing in polylogarithmic time J Holm, E Rotenberg Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 26 | 2020 |
| Direct routing on trees S Alstrup, J Holm, K de Lichtenberg, M Thorup Symposium on Discrete Algorithms: Proceedings of the ninth annual ACM-SIAM …, 1998 | 24 | 1998 |
| Worst-case polylog incremental SPQR-trees: Embeddings, planarity, and triconnectivity J Holm, E Rotenberg Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 19 | 2020 |
| Planar reachability in linear space and constant time J Holm, E Rotenberg, M Thorup 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 370-389, 2015 | 19 | 2015 |
| Top-trees and dynamic graph algorithms J Holm, K de Lichtenberg University of Copenhagen, 1998 | 16 | 1998 |
| Adaptive out-orientations with applications C Chekuri, AB Christiansen, J Holm, I van der Hoog, K Quanrud, ... Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 15 | 2024 |
| Dynamic Planar Embeddings of Dynamic Graphs J Holm, E Rotenberg 32nd International Symposium on Theoretical Aspects of Computer Science …, 2015 | 15 | 2015 |
| Contracting a planar graph efficiently J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg, P Sankowski arXiv preprint arXiv:1706.10228, 2017 | 13 | 2017 |
| Near-Optimal Induced Universal Graphs for Bounded Degree Graphs M Abrahamsen, S Alstrup, J Holm, MBT Knudsen, M Stöckel 44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017 | 13 | 2017 |
| Random k-out subgraph leaves only o (n/k) inter-component edges J Holm, V King, M Thorup, O Zamir, U Zwick 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 12 | 2019 |
| Decremental SPQR-trees for Planar Graphs A Karczmarz, E Rotenberg, GF Italiano, J Holm, J Łącki ESA, 2018 | 12* | 2018 |
Mikkel ThorupUniversity of CopenhagenVerified email at diku.dk
