Christian Wulff-Nilsen
Christian Wulff-Nilsen
Associate professor, Department of Computer Science, University of Copenhagen
Подтвержден адрес электронной почты в домене di.ku.dk - Главная страница
Название
Процитировано
Процитировано
Год
Improved algorithms for min cut and max flow in undirected planar graphs
GF Italiano, Y Nussbaum, P Sankowski, C Wulff-Nilsen
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
922011
Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
G Borradaile, PN Klein, S Mozes, Y Nussbaum, C Wulff-Nilsen
SIAM Journal on Computing 46 (4), 1280-1303, 2017
892017
Primal dual gives almost optimal energy-efficient online algorithms
NR Devanur, Z Huang
ACM Transactions on Algorithms (TALG) 14 (1), 1-30, 2017
612017
Dynamic minimum spanning forest with subpolynomial worst-case update time
D Nanongkai, T Saranurak, C Wulff-Nilsen
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
592017
Shortest Paths in Planar Graphs with Real Lengths in O(nlog2n/loglogn) Time
S Mozes, C Wulff-Nilsen
European Symposium on Algorithms, 206-217, 2010
582010
Faster deterministic fully-dynamic graph connectivity
C Wulff-Nilsen
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
552013
Fully-dynamic minimum spanning forest with improved worst-case update time
C Wulff-Nilsen
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
502017
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
G Borradaile, P Sankowski, C Wulff-Nilsen
ACM Transactions on Algorithms (TALG) 11 (3), 1-29, 2015
422015
Approximate distance oracles with improved preprocessing time
C Wulff-Nilsen
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
372012
Better tradeoffs for exact distance oracles in planar graphs
P Gawrychowski, S Mozes, O Weimann, C Wulff-Nilsen
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
312018
Single source--All sinks max flows in planar digraphs
J Lacki, Y Nussbaum, P Sankowski, C Wulff-Nilsen
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 599-608, 2012
302012
Approximate Distance Oracles with Improved Query Time
C Wulff-Nilsen
Encyclopedia of Algorithms, 1-4, 2014
262014
Fast and compact exact distance oracle for planar graphs
V Cohen-Addad, S Dahlgaard, C Wulff-Nilsen
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
252017
Faster Fully-Dynamic Minimum Spanning Forest
J Holm, E Rotenberg, C Wulff-Nilsen
European Symposium on Algorithms 9294, 742-753, 2015
232015
Separator theorems for minor-free and shallow minor-free graphs with applications
C Wulff-Nilsen
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 37-46, 2011
232011
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
G Borradaile, D Eppstein, A Nayyeri, C Wulff-Nilsen
Symposium on Computational Geometry 51, 22:1--22:16, 2016
222016
Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time
C Wulff-Nilsen
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
222010
A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
M Brazil, DA Thomas, BK Nielsen, P Winter, C Wulff‐Nilsen, ...
Networks: An International Journal 53 (2), 104-111, 2009
202009
Near-optimal light spanners
S Chechik, C Wulff-Nilsen
ACM Transactions on Algorithms (TALG) 14 (3), 1-15, 2018
192018
Minor-free graphs have light spanners
G Borradaile, H Le, C Wulff-Nilsen
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
182017
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20