direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

List of all publications

2019

Däubel, K., Jäger, S., Mütze, T. and Scheucher, M..
On orthogonal symmetric chain decompositions.
Electronic Journal of Combinatorics, Vol. 26, pp. P3.64, 2019. Full version.

Link to original publication


2020

Felsner, S., Kleist, L., Mütze, T. and Sering, L..
Rainbow Cycles in Flip Graphs.
SIAM Journal on Discrete Mathematics, Vol. 34, pp. 1-39, 2020.

Link to original publication


Graf, L., Harks, T. and Sering, L..
Dynamic flows with adaptive route choice.
Mathematical Programming, Vol. 183, pp. 309–335, 2020.

Link to original publication


Israel, J. and Sering, L..
The Impact of Spillback on the Price of Anarchy for Flows over Time.
In International Symposium on Algorithmic Game Theory, pp. 114–129, 2020.

Link to original publication


Pham, H. M. and Sering, L..
Dynamic Equilibria in Time-Varying Networks.
In International Symposium on Algorithmic Game Theory, pp. 130–145, 2020.

Link to original publication


Marchetti-Spaccamela, A., Megow, N., Schlöter, J., Skutella, M. and Stougie, L..
On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems.
In Proceedings of the 34th IEEE International Parallel and Distributed Processing Symposium, 2020.


Klimm, M., Pfetsch, M. E., Raber, R. and Skutella, M..
Packing under Convex Quadratic Constraints.
In Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, Springer, 2020.


Morell, S. and Skutella, M..
Single source unsplittable flows with arc-wise lower and upper bounds.
In Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, Springer, 2020.


Däubel, K..
An Improved Upper Bound for the Ring Loading Problem.
In Springer International Publishing (ed.)Approximation and Online Algorithms, pp. 89–105, 2020.

Link to original publication


2021

Ziemke, T., Sering, L., Vargas Koch, L., Zimmer, M., Nagel, K. and Skutella, M..
Flows Over Time as Continuous Limits of Packet-Based Network Simulations.
Transportation Research Procedia, Vol. 52, pp. 123–130, 2021.


Morell, S., Seidel, I. and Weltge, S..
Minimum-cost integer circulations in given homology classes.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA21), 2021.

Link to publication


Zusatzinformationen / Extras