Our chair was formed in September 2013. Papers pubished at an earlier date can be found on the page of the respective team member.



C. Gottschalk, A. M. C. A. Koster, F. Liers, B. Peis, D. Schmand and A. Wierz:
Robust Flows over Time: Models and Complexity Results
Mathematical Programming, pp. 1-31 (2016).
U. Faigle, W. Kern and B. Peis:
Greedy Oriented Flows
Algorithmica, pp. 1-17 (2017).
A. Bjelde, M. Klimm und D. Schmand:
Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 227-229 (2017).
J. Matuschke, S.T. McCormick, G. Oriolo, B. Peis and M. Skutella:
Protection of flows under targeted attacks
Operations Research Letters 45 (1), pp. 53-59 (2017).
O. Schaudt and V. Weil:
On bounding the difference between the maximum degree and the chromatic number by a constant
Discrete Applied Mathematics 231, pp. 228-234 (2017).
S. Fujishige, M.X. Goemans, T. Harks, B. Peis and R. Zenklusen:
Matroids are immune to Braess paradox
Mathematics of Operations Research 42 (3), pp. 745-761 (2017).
S.T. McCormick, B. Peis, J. Verschae and A. Wierz:
Primal–Dual Algorithms for Precedence Constrained Covering Problems
Algorithmica (2016).
C. Gottschalk, H. Lüthen, B. Peis and A. Wierz:
Optimization Problems with Color-Induced Budget Constraints
Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO), pp. 189-200 (2016).
T. Harks, D. Schmand, B. Peis and L. Vargas Koch:
Competitive Packet Routing with Priority Lists
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 49:1-49:14 (2016).
C. Gottschalk and J. Vygen:
Better s-t-Tours by Gao Trees
Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 126-137 (2016).

A. Bock, K. Chandrasekaran, J. Könemann, B. Peis and L. Sanità:
Finding small stabilizers for unstable graphs
Math. Program. 154 (1-2), pp. 173-196 (2015).

S. Fujishige, M. X. Goemans, T. Harks, B. Peis and R. Zenklusen:
Congestion games viewed from M-convexity
Oper. Res. Lett. 43 (3), pp. 329-333 (2015).
M. Klimm and D. Schmand:
Sharing Non-anonymous Costs of Multiple Resources Optimally
Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC), pp. 274-287 (2015).
C. Gottschalk and B. Peis:
Submodular Function Maximization on the Bounded Integer Lattice
Proceedings of the 13th International Workshop on Approximation and Online Algorithms (WAOA), pp. 133-144 (2015).
T. Harks and B. Peis:
Resource Buying Games
Algorithmica 70 (3), pp. 493-512 (2014).
J. W. Kappmeier, J. Matuschke and B. Peis:
Abstract flows over time: A first step towards solving dynamic packing problems
Theor. Comput. Sci. 544, pp. 74-83 (2014).
A. Wierz, B. Peis and S. T. McCormick:
Primal-Dual Algorithms for Precedence Constrained Covering Problems
Proceedings of the 12th International Workshop on Approximation and Online Algorithms (WAOA), pp. 260-272 (2014).
T. Harks, M. Klimm and B. Peis:
Resource Competition on Integral Polymatroids
Proceedings of the 10th International Conference on Web and Internet Economics (WINE), pp. 182-202 (2014).




Vera Weil
A note on Reed's Conjecture about ω, Δ and χ with respect to vertices of high degree
submitted to Discrete Mathematics (2016).

Y. Disser, J. Fearnley, M. Gairing, O. Göbel, M. Klimm, D. Schmand, A. Skopalik and A. Tönnis:
Hiring Secretaries over Time: The Benefit of Concurrent Employment
preprint (2016).

K. Chandrasekaran, C. Gottschalk, J. Könemann, B. Peis, D. Schmand and A. Wierz:
Additive Stabilizers for Unstable Graphs
preprint (2016).

F. Mies and B. Peis and A. Wierz:
Computational Methods for Path-Based Robust Flows
preprint (2016).
J. Verschae, B. Peis and A. Wierz:
The Primal-Dual Greedy Algorithm for Weighted Covering Problems
preprint (2017).