Finding all minimum cost flows and a faster algorithm for the K best flow problem. - David Könen; Daniel R. Schmidt 001; Christiane Spisla (Discret. Appl. Math., 2022)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems. - David Könen; Michael Stiglmayr (CoRR, 2023)

An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems. - David Könen; Michael Stiglmayr (Discret. Appl. Math., 2025)

On Supportedness in Multi-Objective Combinatorial Optimization. - David Könen; Michael Stiglmayr (CoRR, 2025)