Publications
Our chair was formed in September 2013. Papers pubished at an earlier date can be found on the page of the respective team member.
Publications
T. Harks, M. Klimm and B. Peis: Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids Accepted for publication in SIAM Jounal on Optimization. 
T. Harks, B. Peis, D. Schmand, B. Tauer and L. Vargas Koch: Competitive Packet Routing with Priority Lists ACM Trans. Econ. Comput. 6, 1, Article 4 (March 2018), 26 pages. 
J. Correa, C. Guzman, T. Lianeas, E. Nikolova and M. Schröder: Network pricing: how to induce optimal flows under strategic link operators Accepted for publication in The 19th ACM conference on Economics and Computation (EC’18). 
H. Peters, M. Schröder and D. Vermeulen: Hotelling's location model with negative network externalities International Journal of Game Theory, pp. 127 (2018). 
M. Scarsini, M. Schröder and T. Tomala: Dynamic atomic congestion games with seasonal flows Operations Research, Volume 66 (2), pp. 327339 (2018). 
J. Correa, R. Hoeksma and M. Schröder: Network congestion games are robust to variable demand Proceedings of the 13th International Conference on Web and Internet Economics (WINE), p. 397 (2017). 
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. 131 (2017). 
U. Faigle, W. Kern and B. Peis: Greedy Oriented Flows Algorithmica, pp. 117 (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. 227229 (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. 5359 (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. 228234 (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. 745761 (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 ColorInduced Budget Constraints Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO), pp. 189200 (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:149:14 (2016). 
C. Gottschalk and J. Vygen: Better stTours by Gao Trees Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 126137 (2016). 
A. Bock, K. Chandrasekaran, J. Könemann, B. Peis and L. Sanità:

S. Fujishige, M. X. Goemans, T. Harks, B. Peis and R. Zenklusen:
Congestion games viewed from Mconvexity Oper. Res. Lett. 43 (3), pp. 329333 (2015). 
M. Klimm and D. Schmand: Sharing Nonanonymous Costs of Multiple Resources Optimally Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC), pp. 274287 (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. 133144 (2015). 
T. Harks and B. Peis:
Resource Buying Games Algorithmica 70 (3), pp. 493512 (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. 7483 (2014). 
A. Wierz, B. Peis and S. T. McCormick: PrimalDual Algorithms for Precedence Constrained Covering Problems Proceedings of the 12th International Workshop on Approximation and Online Algorithms (WAOA), pp. 260272 (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. 182202 (2014). 
.
Preprints
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: 
K. Chandrasekaran, C. Gottschalk, J. Könemann, B. Peis, D. Schmand and A. Wierz: 
F. Mies and B. Peis and A. Wierz: Computational Methods for PathBased Robust Flows preprint (2016). 
J. Verschae, B. Peis and A. Wierz: The PrimalDual Greedy Algorithm for Weighted Covering Problems preprint (2017). 