Department of Computer Science

  1. Published

    Faster deterministic fully-dynamic graph connectivity

    Wulff-Nilsen, Christian, 2013, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Khanna, S. (ed.). Association for Computing Machinery, p. 1757-1769 13 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  2. Published

    Faster separators for shallow minor-free graphs via dynamic approximate distance oracles

    Wulff-Nilsen, Christian, 2014, Automata, languages, and programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Esparza, J., Fraigniaud, P., Husfeldt, T. & Koutsoupias, E. (eds.). Springer, p. 1063-1074 12 p. (Lecture notes in computer science, Vol. 8572).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  3. Published

    Approximate distance oracles with improved query time

    Wulff-Nilsen, Christian, 2014, Encyclopedia of Algorithms. Kao, M-Y. (ed.). Springer, p. 1-4 4 p.

    Research output: Chapter in Book/Report/Conference proceedingEncyclopedia chapterResearchpeer-review

  4. Published

    Approximate distance oracles with improved query time

    Wulff-Nilsen, Christian, 2016, Encyclopedia of algorithms. Kao, M-Y. (ed.). Springer, p. 94-97 4 p.

    Research output: Chapter in Book/Report/Conference proceedingEncyclopedia chapterResearchpeer-review

  5. Published

    Approximate distance oracles for planar graphs with improved query time-space tradeoff

    Wulff-Nilsen, Christian, 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 351-362 12 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  6. Published

    Approximate distance oracles with improved query time

    Wulff-Nilsen, Christian, 2013, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Khanna, S. (ed.). Association for Computing Machinery, p. 539-549 11 p. (The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  7. Published

    Fully-dynamic minimum spanning forest with improved worst-case update time

    Wulff-Nilsen, Christian, 2017, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 1130-1143 14 p.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  8. Published

    Faster deterministic fully-dynamic graph connectivity

    Wulff-Nilsen, Christian, 2016, Encyclopedia of algorithms. Kao, M-Y. (ed.). Springer, p. 738-741 4 p.

    Research output: Chapter in Book/Report/Conference proceedingEncyclopedia chapterResearchpeer-review

  9. Published

    Auto-segmentation of Hip Joints Using MultiPlanar UNet with Transfer Learning

    Xu, Peidi, nsv780, nsv780, Gholamalizadeh, T., Nielsen, Michael Bachmann, Erleben, Kenny & Darkner, Sune, 2022, Medical Image Learning with Limited and Noisy Data: First International Workshop, MILLanD 2022 Held in Conjunction with MICCAI 2022 Singapore, September 22, 2022 Proceedings. Zamzmi, G., Antani, S., Rajaraman, S., Xue, Z., Bagci, U. & Linguraru, M. G. (eds.). Springer Science and Business Media Deutschland GmbH, p. 153-162 10 p. (Medical Image Learning with Limited and Noisy Data, Vol. 13559).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  10. Published

    Reliability and Accuracy of Brain Volume Measurement on MR Imaging

    Yamagchii, K., Lassen, Anders & Ring, P., 17 Sep 1998.

    Research output: Contribution to conferenceConference abstract for conferenceResearchpeer-review