 | Up a level |
2022
Konen, David 
ORCID: 0000-0003-1747-8791, Schmidt, Daniel and Spisla, Christiane
(2022).
Finding all minimum cost flows and a faster algorithm for the K best flow problem.
Discret Appl. Math., 321.
S. 333 - 350.
AMSTERDAM:
ELSEVIER.
ISSN 1872-6771
2019
Spisla, Christiane (2019). Compaction of Orthogonal and Hierarchical Graph Drawings Using Constraint Graphs and Minimum Cost Flows. Thesis Abstract, Universität zu Köln.
2018
Juenger, Michael, Mutzel, Petra ORCID: 0000-0001-7621-971X and Spisla, Christiane
(2018).
More Compact Orthogonal Drawings by Allowing Additional Bends.
Information, 9 (7).
BASEL:
MDPI.
ISSN 2078-2489