%0 Journal Article %1 journals/algorithmica/KaplanN11 %A Kaplan, Haim %A Nussbaum, Yahav %D 2011 %J Algorithmica %K dblp %N 1 %P 174-189 %T Maximum Flow in Directed Planar Graphs with Vertex Capacities. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica61.html#KaplanN11 %V 61

@article{journals/algorithmica/KaplanN11, added-at = {2011-06-17T00:00:00.000+0200}, author = {Kaplan, Haim and Nussbaum, Yahav}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2639f9c2fc32601f826f8a72fe882f1a9/dblp}, ee = {http://dx.doi.org/10.1007/s00453-010-9436-7}, interhash = {0cf4918c2746baacd7c5b8cf45c9c677}, intrahash = {639f9c2fc32601f826f8a72fe882f1a9}, journal = {Algorithmica}, keywords = {dblp}, number = 1, pages = {174-189}, timestamp = {2016-02-02T01:11:02.000+0100}, title = {Maximum Flow in Directed Planar Graphs with Vertex Capacities.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica61.html#KaplanN11}, volume = 61, year = 2011 }