8 citations · 14 across the 18 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Min-Cost Flow in Unit-Capacity Planar Graphs
Adam Karczmarz, Piotr Sankowski
In this paper we give an time algorithm for computing min-cost flow (or min-cost circulation) in unit capacity planar multigraphs where edge costs…
cs.DS2019
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
Adam Karczmarz, Jakub Łącki
We give new partially-dynamic algorithms for the all-pairs shortest paths problem in weighted directed graphs. Most importantly, we give a new deterministic incremental algorithm f…