Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Wulff-Nilsen, Christian
250  Ergebnisse:
Personensuche X
?
1

Almost Optimal Exact Distance Oracles for Planar Graphs:

Charalampopoulos, Panagiotis ; Gawrychowski, Paweł ; Long, Yaowei...
Journal of the ACM.  70 (2023)  2 - p. 1-50 , 2023
Link: https://doi.org/10.1145/..
 
?
2

Optimal Approximate Distance Oracle for Planar Graphs:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Le, Hung ; Wulff-Nilsen, Christian - p. 363-374 , 2022
Link: https://doi.org/10.1109/..
 
?
3

Special Section on the Fifty-Second Annual ACM Symposium on..:

Chattopadhyay, Arkadev ; Cygan, Marek ; Ron-Zewi, Noga.
SIAM Journal on Computing.  51 (2022)  3 - p. STOC20-i-STOC20-i , 2022
Link: https://doi.org/10.1137/..
 
?
4

Constructing light spanners deterministically in near-linea..:

Alstrup, Stephen ; Dahlgaard, Søren ; Filtser, Arnold..
Theoretical Computer Science.  907 (2022)  - p. 82-112 , 2022
Link: https://doi.org/10.1016/..
 
?
5

Negative-Weight Single-Source Shortest Paths in Near-linear..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Bernstein, Aaron ; Nanongkai, Danupon ; Wulff-Nilsen, Christian - p. 600-611 , 2022
Link: https://doi.org/10.1109/..
 
?
6

Decremental Strongly Connected Components and Single-Source..:

Bernstein, Aaron ; Gutenberg, Maximilian Probst ; Wulff-Nilsen, Christian
SIAM Journal on Computing.  52 (2021)  2 - p. STOC19-128-STOC19-155 , 2021
Link: https://doi.org/10.1137/..
 
?
7

Near-Optimal Decremental SSSP in Dense Weighted Digraphs:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Bernstein, Aaron ; Gutenberg, Maximilian Probst ; Wulff-Nilsen, Christian - p. 1112-1122 , 2020
Link: https://doi.org/10.1109/..
 
?
8

Escaping an Infinitude of Lions:

Abrahamsen, Mikkel ; Holm, Jacob ; Rotenberg, Eva.
The American Mathematical Monthly.  127 (2020)  10 - p. 880-896 , 2020
Link: https://www.jstor.org/st..
 
?
9

Fully-dynamic all-pairs shortest paths : improved worst-..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Gutenberg, Maximilian Probst ; Wulff-Nilsen, Christian - p. 2562-2574 , 2020
Link: https://dl.acm.org/doi/1..
 
?
10

Escaping an Infinitude of Lions:

Abrahamsen, Mikkel ; Holm, Jacob ; Rotenberg, Eva.
The American Mathematical Monthly.  127 (2020)  10 - p. 880-896 , 2020
Link: https://doi.org/10.1080/..
 
?
11

Deterministic algorithms for decremental approximate shorte..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Gutenberg, Maximilian Probst ; Wulff-Nilsen, Christian - p. 2522-2541 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

Decremental sssp in weighted digraphs : faster and again..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Gutenberg, Maximilian Probst ; Wulff-Nilsen, Christian - p. 2542-2561 , 2020
Link: https://dl.acm.org/doi/1..
 
?
13

Decremental strongly-connected components and single-source..:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,
Bernstein, Aaron ; Probst, Maximilian ; Wulff-Nilsen, Christian - p. 365-376 , 2019
Link: https://dl.acm.org/doi/1..
 
?
14

Greedy spanners are optimal in doubling metrics:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Borradaile, Glencora ; Le, Hung ; Wulff-Nilsen, Christian - p. 2371-2379 , 2019
Link: https://dl.acm.org/doi/1..
 
?
15

Better tradeoffs for exact distance oracles in planar graph:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Gawrychowski, Paweł ; Mozes, Shay ; Weimann, Oren. - p. 515-529 , 2018
Link: https://dl.acm.org/doi/1..
 
1-15