| 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 | 617 | 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 | 612 | 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 | 147 | 2005 |
| Improved algorithms for finding level ancestors in dynamic trees S Alstrup, J Holm Automata, Languages and Programming: 27th International Colloquium, ICALP …, 2000 | 74 | 2000 |
| Minimizing diameters of dynamic trees S Alstrup, J Holm, K de Lichtenberg, M Thorup Automata, Languages and Programming: 24th International Colloquium, ICALP'97 …, 1997 | 67 | 1997 |
| 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 | 47 | 2018 |
| Maintaining center and median in dynamic trees S Alstrup, J Holm, M Thorup Algorithm Theory-SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory …, 2000 | 39 | 2000 |
| Faster fully-dynamic minimum spanning forest J Holm, E Rotenberg, C Wulff-Nilsen Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 35 | 2015 |
| 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 | 23 | 1998 |
| 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 | 19 | 2018 |
| 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 | 15 | 2015 |
| Fully-dynamic planarity testing in polylogarithmic time J Holm, E Rotenberg Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 12 | 2020 |
| Contracting a planar graph efficiently J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg, P Sankowski arXiv preprint arXiv:1706.10228, 2017 | 12 | 2017 |
| Top-trees and dynamic graph algorithms J Holm, K de Lichtenberg University of Copenhagen, 1998 | 12 | 1998 |
| Dynamic Planar Embeddings of Dynamic Graphs J Holm, E Rotenberg 32nd International Symposium on Theoretical Aspects of Computer Science …, 2015 | 11 | 2015 |
| 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 | 10 | 2017 |
| Poly-logarithmic Deterministic Fully-dynamic Graph Algorithms I: Connectivity and Minimum Spanning Tree. J Holm, K de Lichtenberg, M Thorup Technical Report DIKU-TR-97/17, Dept. of Computer Science, Univ. of Copenhagen, 1997 | 10 | 1997 |
| Best Laid Plans of Lions and Men M Abrahamsen, J Holm, E Rotenberg, C Wulff-Nilsen 33rd International Symposium on Computational Geometry (SoCG 2017) 77 …, 2017 | 9 | 2017 |
| 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 | 7 | 2020 |
| Decremental SPQR-trees for Planar Graphs A Karczmarz, E Rotenberg, GF Italiano, J Holm, J Łącki | 7* | 2018 |
Mikkel ThorupUniversity of CopenhagenVerified email at diku.dk
