Christian Wulff-Nilsen

Christian Wulff-Nilsen

Lektor


  1. 2020
  2. Udgivet

    Decremental SSSP in weighted digraphs: Faster and against an adaptive adversary

    Gutenberg, Maximilian Probst & Wulff-Nilsen, Christian, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (red.). Association for Computing Machinery, s. 2542-2561

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  3. Udgivet

    Deterministic algorithms for decremental approximate shortest paths: Faster and Simpler

    Gutenberg, Maximilian Probst & Wulff-Nilsen, Christian, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (red.). Association for Computing Machinery, s. 2522-2541

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  4. Udgivet

    Escaping an Infinitude of Lions

    Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2020, I : The American Mathematical Monthly. 127, 10, s. 880-896

    Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

  5. Udgivet

    Fully-dynamic all-pairs shortest paths: Improved worst-case time and space bounds

    Gutenberg, Maximilian Probst & Wulff-Nilsen, Christian, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (red.). Association for Computing Machinery, s. 2562-2574

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  6. 2019
  7. Udgivet

    Constructing light spanners deterministically in near-linear time

    Alstrup, Stephen, Dahlgaard, S., Filtser, A., Stöckel, M. & Wulff-Nilsen, Christian, 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 15 s. 4. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 144).

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  8. Udgivet

    Decremental strongly-connected components and single-source reachability in near-linear time

    Bernstein, A., Gutenberg, Maximilian Probst & Wulff-Nilsen, Christian, 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (red.). Association for Computing Machinery, s. 365-376 12 s. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  9. 2018
  10. Udgivet

    Better tradeoffs for exact distance oracles in planar graphs

    Gawrychowski, P., Mozes, S., Weimann, O. & Wulff-Nilsen, Christian, 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms . Czumaj, A. (red.). Society for Industrial and Applied Mathematics, s. 515-529

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  11. 2017
  12. Udgivet

    Best laid plans of lions and men

    Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 s. 6. (Leibniz International Proceedings in Informatics, Bind 77).

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  13. Udgivet

    Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time

    Nanongkai, D., Saranurak, T. & Wulff-Nilsen, Christian, 2017, 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE, s. 950-961

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  14. Udgivet

    Fast and Compact Exact Distance Oracle for Planar Grap

    Cohen-Addad, V. P., Dahlgaard, S. & Wulff-Nilsen, Christian, 2017, 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE, s. 962-973

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  15. Udgivet

    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, s. 1130-1143 14 s.

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  16. Udgivet

    Minor-free graphs have light spanners

    Borradaile, G., Le, H. & Wulff-Nilsen, Christian, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, s. 767-778 12 s.

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  17. Udgivet

    Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time

    Borradaile, G., Klein, P. N., Mozes, S., Nussbaum, Y. & Wulff-Nilsen, Christian, 2017, I : SIAM Journal on Computing. 46, 4, s. 1280-1303 24 s.

    Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

  18. 2016
  19. Udgivet

    All-pairs minimum cuts in near-linear time for surface-embedded graphs

    Borradaile, G., Eppstein, D., Nayyeri, A. & Wulff-Nilsen, Christian, 2016, 32nd International Symposium on Computational Geometry (SoCG 2016). Fekete, S. & Lubiw, A. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 s. (Leibniz International Proceedings in Informatics, Bind 51).

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  20. Udgivet

    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. (red.). Association for Computing Machinery, s. 351-362 12 s.

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  21. Udgivet

    Approximate distance oracles with improved query time

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

    Publikation: Bidrag til bog/antologi/rapportEncyclopædiartikel

  22. Udgivet

    Brief announcement: labeling schemes for power-law graphs

    Petersen, C., Rotbart, N. G., Simonsen, Jakob Grue & Wulff-Nilsen, Christian, 2016, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, s. 39-41 3 s.

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  23. Udgivet

    Faster deterministic fully-dynamic graph connectivity

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

    Publikation: Bidrag til bog/antologi/rapportEncyclopædiartikel

  24. Udgivet

    Near optimal adjacency labeling schemes for power-law graphs

    Petersen, C., Rotbart, N. G., Simonsen, Jakob Grue & Wulff-Nilsen, Christian, 2016, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y. & Sangiorgi, D. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 s. 133. (Leibniz International Proceedings in Informatics, Bind 55).

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  25. Udgivet

    Near-optimal light spanners

    Chechik, S. & Wulff-Nilsen, Christian, 2016, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, s. 883-892 10 s.

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  26. Udgivet

    Space-efficient path-reporting approximate distance oracles

    Elkin, M., Neiman, O. & Wulff-Nilsen, Christian, 2016, I : Theoretical Computer Science. 651, s. 1-10 10 s.

    Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

  27. 2015
  28. Udgivet

    Faster fully-dynamic minimum spanning forest

    Holm, J., Rotenberg, E. & Wulff-Nilsen, Christian, 2015, Algorithms - ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Springer, s. 742-753 12 s. (Lecture notes in computer science, Bind 9294).

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedings

  29. Udgivet

    Min st-cut oracle for planar graphs with near-linear preprocessing time

    Borradaile, G., Sankowski, P. & Wulff-Nilsen, Christian, 2015, I : A C M Transactions on Algorithms. 11, 3, s. 16:1-16:29 16.

    Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

  30. Udgivet

    Near-optimal adjacency labeling scheme for power-law graphs

    Petersen, C., Rotbart, N. G., Simonsen, Jakob Grue & Wulff-Nilsen, Christian, 2015, I : arXiv.org: Computer science. arXiv:1502.03971, 18 s.

    Publikation: Bidrag til tidsskriftTidsskriftartikelForskning

  31. 2014
  32. Udgivet

    Approximate distance oracles with improved query time

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

    Publikation: Bidrag til bog/antologi/rapportEncyclopædiartikel

Forrige 1 2 3 Næste

ID: 40450735