Research output per year
Research output per year
Personal profile
Short presentation
Primary research areas:
Developing efficient algorithms and data structures for general graphs as well as for more specialized graphs such as planar graphs and more generally graphs excluding a fixed minor. Problems considered are for dynamic graphs, in particular dynamic connectivity, as well as classical algorithmic problems such as shortest paths and max flow/min cut. The research is purely theoretical.
Current research area:
Dynamic connectivity and dynamic minimum spanning forest as well as light and sparse spanners for general graphs.
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Research output
-
VC Set Systems in Minor-free (Di)Graphs and Applications
Le, H. & Wulff-Nilsen, C., 2024, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, p. 5332-5360Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Open AccessFile1 Citation (Scopus)2 Downloads (Pure) -
Almost Optimal Exact Distance Oracles for Planar Graphs
Charalampopoulos, P., Gawrychowski, P., Long, Y., Mozes, S., Pettie, S., Weimann, O. & Wulff-Nilsen, C., 2023, In: Journal of the ACM. 70, 2, 50 p., 12.Research output: Contribution to journal › Journal article › Research › peer-review
-
Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time
Bernstein, A., Gutenberg, M. P. & Wulff-Nilsen, C., 2023, In: SIAM Journal on Computing. 52, 2, p. 128-155Research output: Contribution to journal › Journal article › Research › peer-review
File7 Downloads (Pure) -
Fully Dynamic Exact Edge Connectivity in Sublinear Time
Goranci, G., Henzinger, M., Nanongkai, D., Saranurak, T., Thorup, M. & Wulff-nilsen, C., 2023, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Bansal, N. & Nagarajan, V. (eds.). Society for Industrial and Applied Mathematics, p. 70-86Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Open AccessFile4 Citations (Scopus)13 Downloads (Pure) -
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs
Das, D., Gutenberg, M. P. & Wulff-Nilsen, C., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, Inc., p. 3482-3495Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Open AccessFile1 Citation (Scopus)14 Downloads (Pure) -
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs
Das, D., Kipouridis, E., Gutenberg, M. P. & Wulff-Nilsen, C., 2022, Proceedings, Symposium on Simplicity in Algorithms (SOSA). SIAM, p. 1-11Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Open AccessFile16 Downloads (Pure) -
Constructing light spanners deterministically in near-linear time
Alstrup, S., Dahlgaard, S., Filtser, A., Stöckel, M. & Wulff-Nilsen, C., 12 Mar 2022, In: Theoretical Computer Science. 907, p. 82-112Research output: Contribution to journal › Journal article › Research › peer-review
File3 Citations (Scopus)14 Downloads (Pure) -
Negative-Weight Single-Source Shortest Paths in Near-linear Time
Bernstein, A., Nanongkai, D. & Wulff-Nilsen, C., 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 600-611 (Annual IEEE Symposium on Foundations of Computer Science).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Open AccessFile18 Citations (Scopus)9 Downloads (Pure)