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 | 131 | 2017 |

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 | 129 | 2011 |

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 | 118 | 2017 |

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 | 94 | 2017 |

Faster deterministic fully-dynamic graph connectivity C Wulff-Nilsen Proceedings of the twenty-fourth Annual ACM-SIAM Symposium on Discrete …, 2013 | 79 | 2013 |

Shortest Paths in Planar Graphs with Real Lengths in *O*(*n*log^{2} *n*/loglog*n*) TimeS Mozes, C Wulff-Nilsen Algorithms–ESA 2010: 18th Annual European Symposium, Liverpool, UK …, 2010 | 79 | 2010 |

Min *st*-Cut Oracle for Planar Graphs with Near-Linear Preprocessing TimeG Borradaile, P Sankowski, C Wulff-Nilsen ACM Transactions on Algorithms (TALG) 11 (3), 1-29, 2015 | 63 | 2015 |

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 | 52 | 2018 |

Approximate distance oracles with improved preprocessing time C Wulff-Nilsen Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 49 | 2012 |

Near-optimal light spanners S Chechik, C Wulff-Nilsen ACM Transactions on Algorithms (TALG) 14 (3), 1-15, 2018 | 43 | 2018 |

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 | 40 | 2017 |

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 | 39 | 2016 |

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 | 39 | 2012 |

Greedy spanners are optimal in doubling metrics G Borradaile, H Le, C Wulff-Nilsen Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 37 | 2019 |

Approximate Distance Oracles with Improved Query Time C Wulff-Nilsen Encyclopedia of Algorithms, 1-4, 2014 | 37 | 2014 |

Faster Fully-Dynamic Minimum Spanning Forest J Holm, E Rotenberg, C Wulff-Nilsen European Symposium on Algorithms 9294, 742-753, 2015 | 36 | 2015 |

Decremental strongly-connected components and single-source reachability in near-linear time A Bernstein, M Probst, C Wulff-Nilsen Proceedings of the 51st Annual ACM SIGACT Symposium on theory of computing …, 2019 | 34 | 2019 |

Deterministic algorithms for decremental approximate shortest paths: Faster and simpler MP Gutenberg, C Wulff-Nilsen Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 33 | 2020 |

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 | 33 | 2017 |

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 | 31 | 2011 |