Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Holm, Jacob"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dynamic planar embeddings of dynamic graphs
Jacob Holm
,
Eva Rotenberg
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 434-446
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
Jacob Holm
,
Kristian de Lichtenberg
,
Mikkel Thorup
Journal of the ACM
48
(4), 2001, pp. 723-760
Maintaining center and median in dynamic trees
Stephen Alstrup
,
Jacob Holm
,
Mikkel Thorup
Lecture Notes in Computer Science
1851
, 2000, pp. 46-56
Improved algorithms for finding level ancestors in dynamic trees
Stephen Alstrup
,
Jacob Holm
Lecture Notes in Computer Science
1853
, 2000, pp. 73-84
Direct routing on trees
Stephen Alstrup
,
Jacob Holm
,
Kristian de Lichtenberg
,
Mikkel Thorup
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 342-349
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
Jacob Holm
,
Kristian de Lichtenberg
,
Mikkel Thorup
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 79-89
Minimizing diameters of dynamic trees
Stephen Alstrup
,
Jacob Holm
,
Kristian de Lichtenberg
,
Mikkel Thorup
Lecture Notes in Computer Science
1256
, 1997, pp. 270-280