direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications

Journals and Refereed Conference Proceedings
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.
In Khaled Elbassioni and Kazuhisa Makino, editors, Algorithms and Computation, volume 9472 of Lecture Notes in Computer Science, pages 176–187. Springer Berlin Heidelberg, 2015.

Graph orientation and flows over time.
Networks, 66(3):196–209, 2015.

Mathematische Modellierung, Simulation und Optimierung von Gastransportnetzwerken.
gwf-Gas/Erdgas, 11:880–885, 2015.

A tight bound on the speed-up through storage for quickest multi-commodity flows.
Operations Research Letters, 43(1):93–95, 2015.

Graph Orientation and Flows over Time.
In Hee-Kap Ahn and Chan-Su Shin, editors, Algorithms and Computation, volume 8889 of Lecture Notes in Computer Science, pages 741–752. Springer International Publishing, 2014.

Approximating Earliest Arrival Flows in Arbitrary Networks.
In L. Epstein and P. Ferragina, editors, Algorithms – ESA 2012, volume 7501 of Lecture Notes in Computer Science, pages 551–562. Springer Berlin Heidelberg, 2012.

Maximum Multicommodity Flows over Time without Intermediate Storage.
In L. Epstein and P. Ferragina, editors, Algorithms – ESA 2012, volume 7501 of Lecture Notes in Computer Science, pages 539–550. Springer Berlin Heidelberg, 2012.

Generalized Maximum Flows over Time.
In P. Persiano and R. Solis-Oba, editors, Proceedings of the 9th Workshop on Approximation and Online Algorithms (WAOA '11), volume 7164 of Lecture Notes in Computer Science, pages 247–260. Springer, 2012.

On the Use of Network Flow Techniques for Assigning Evacuees to Exits.
Daniel Dressler, Martin Groß, Jan-Philipp Kappmeier, Timon Kelter, Joscha Kulbatzki, Daniel Plümpe, Gordon Schlechter, Melanie Schmidt, Martin Skutella and Sylvie Temme.
In Proceedings of the International Conference on Evacuation Modeling and Management (ICEM '09), volume 3 of Procedia Engineering, pages 205–215. Elsevier Ltd, 2010.

Preprints
Many-to-one matchings with lower quotas: Algorithms and complexity.
arXiv preprint arXiv:1412.0325, 2014.

Graph Orientation and Flows over Time.
arXiv preprint arXiv:1409.3081, 2014.

A Tight Bound on the Speed-Up Through Storage for Quickest Multi-Commodity Flows.
arXiv preprint arXiv:1406.4799, 2014.

PhD Thesis
Approximation Algorithms for Complex Network Flow Over Time Problems.
TU Berlin, 2014.

Diploma Thesis
Flows over Time with Commodity-Dependent Transit Times.
TU Dortmund, 2009.

Miscellaneous
Kreuzzahlrätsel.
Mitteilungen der DMV, 18(2):118, 2010.

Kreuzzahlrätsel – Sudokus waren gestern.
Informatik-Spektrum, 32(6):538-545, 2009.

Kreuzzahlrätsel.
Mitteilungen der DMV, 17(2):96, 2009.

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.

Browse publications using Google Scholar