Jacob Holm
Jacob Holm
Assistant Professor, University of Copenhagen
Bekræftet mail på di.ku.dk
Titel
Citeret af
Citeret af
År
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
5512001
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
5461998
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
1292005
Improved algorithms for finding level ancestors in dynamic trees
S Alstrup, J Holm
International Colloquium on Automata, Languages, and Programming, 73-84, 2000
672000
Minimizing diameters of dynamic trees
S Alstrup, J Holm, K de Lichtenberg, M Thorup
International Colloquium on Automata, Languages, and Programming, 270-280, 1997
631997
Maintaining center and median in dynamic trees
S Alstrup, J Holm, M Thorup
Scandinavian Workshop on Algorithm Theory, 46-56, 2000
382000
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
322018
Faster fully-dynamic minimum spanning forest
J Holm, E Rotenberg, C Wulff-Nilsen
Algorithms-ESA 2015, 742-753, 2015
242015
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
221998
Top-trees and dynamic graph algorithms
J Holm, K de Lichtenberg
University of Copenhagen, 1998
121998
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
102018
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
102015
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
101997
Contracting a planar graph efficiently
J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg, P Sankowski
arXiv preprint arXiv:1706.10228, 2017
62017
Polylogarithmic deterministic fully-dynamic graph algorithms II: 2-edge and biconnectivity
J Holm, K de Lichtenberg, M Thorup
Technical Report DIKU-TR-97/26, Dept. of Computer Science, Univ. of Copenhagen, 1997
6*1997
Decremental SPQR-trees for Planar Graphs
A Karczmarz, E Rotenberg, GF Italiano, J Holm, J Łącki
5*2018
Dynamic Planar Embeddings of Dynamic Graphs
J Holm, E Rotenberg
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
52015
Maintaining diameter, center, and median of fully-dynamic trees with top trees
S Alstrup, J Holm, K De Lichtenberg, M Thorup
Unpublished manuscript, http://arxiv. org/abs/cs/0310065, 2003
52003
Maintaining information in fully-dynamic trees with top trees, 2003
S Alstrup, J Holm, K de Lichtenberg, M Thorup
The Computing Research Repository (CoRR)[cs. DS/0310065], 0
5
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
42019
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20