Approximation and Complexity of k-Splittable Flows. - Ronald Koch; Martin Skutella; Ines Spenke (WAOA, 2005)

Complexity and approximability of k-splittable flows. - Ronald Koch; Ines Spenke (Theor. Comput. Sci., 2006)

Maximum k -Splittable s , t -Flows. - Ronald Koch; Martin Skutella; Ines Spenke (Theory Comput. Syst., 2008)

Real-Time Message Routing and Scheduling. - Ronald Koch; Britta Peis; Martin Skutella; Andreas Wiese (APPROX-RANDOM, 2009)

Strong Duality for the Maximum Borel Flow Problem. - Ronald Koch; Ebrahim Nasrabadi (INOC, 2011)

Continuous and discrete flows over time - A general model based on measure theory. - Ronald Koch; Ebrahim Nasrabadi; Martin Skutella (Math. Methods Oper. Res., 2011)

Nash Equilibria and the Price of Anarchy for Flows over Time. - Ronald Koch; Martin Skutella (Theory Comput. Syst., 2011)

Flows over time in time-varying networks. - Ebrahim Nasrabadi; Ronald Koch (CoRR, 2014)

Flows over time in time-varying networks: Optimality conditions and strong duality. - Ronald Koch; Ebrahim Nasrabadi (Eur. J. Oper. Res., 2014)

Continuous-Time Dynamic Shortest Path Problems with Negative Transit Times. - Ronald Koch; Ebrahim Nasrabadi (SIAM J. Control. Optim., 2014)