Publications

Kappmeier, Jan-Philipp W. and Matuschke, Jannik and Peis, Britta.
Abstract flows over time: A first step towards solving dynamic packing problems.
Theoretical Computer Science, Vol. 544, pp. 74-85, 2014.

Link to publication Link to original publication

Kappmeier, Jan-Philipp W. and Matuschke, Jannik and Peis, Britta.
Abstract flows over time: A first step towards solving dynamic packing problems.
In Kun-Mao Chao, Tsan-sheng Hsu, and Der-Tsai Lee (ed.), Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings, Lecture Notes in Computer Science, pp. 433-443, Springer, 2012.

Link to publication Link to original publication

Groß, Martin and Kappmeier, Jan-Philipp W. and Schmidt, Melanie and Schmidt, Daniel.
Approximating Earliest Arrival Flows in Arbitrary Networks.
In Epstein, Leah and Ferragina, Paolo (ed.), Algorithms – ESA 2012, pp. 551-562, Springer Berlin / Heidelberg, 2012.

Link to original publication

Dressler, Daniel and Groß, Martin and Kappmeier, Jan-Philipp and Kelter, Timon and Kulbatzki, Joscha and Plümpe, Daniel and Schlechter, Gordon and Schmidt, Melanie and Skutella, Martin and Temme, Sylvie.
On the use of network flow techniques for assigning evacuees to exits.
In Hoogendoorn, S.P. and Pel, A.J. and Taylor, M.A.P. and Mahmassani, H. (ed.), Proceedings of the International Conference on Evacuation Modeling and Management, Procedia Engineering, Vol. 3, pp. 205–215, Elsevier Ltd, 2010.

Link to original publication

Groß, Martin and Kappmeier, Jan-Philipp and Plümpe, Daniel and Schmidt, Melanie.
Kreuzzahlrätsel.
Mitteilungen der DMV, Vol. 18, pp. 118, 2010.

Groß, Martin and Kappmeier, Jan-Philipp and Plümpe, Daniel and Schmidt, Melanie.
Kreuzzahlrätsel.
Mitteilungen der DMV, Vol. 17, pp. 96, 2009.

Kappmeier, Jan-Philipp.
Berechnung maximaler Flüsse unter Vermeidung von Residualnetzwerken.
Diploma thesis, TU Dortmund, 2009. In German.

Link to publication