Publikationen

 

Unser Lehrstuhl besteht seit September 2013. Publikationen aus der Zeit vor der Entstehung des Lehrstuhls befinden sich auf der jeweiligen Seite der Teammitarbeiterin oder des Teammitarbeiters.

 

Publikationen

K. Chandrasekaran, C. Gottschalk, J. Könemann, B. Peis, D. Schmand und A. Wierz:
Additive Stabilizers for Unstable Graphs
Zur Publikation in Discrete Optimization angenommen.

T. Harks, M. Klimm und B. Peis:
Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids
SIAM Jounal on Optimization, 28 (3), pp. 2222–2245 (2018).

T. Harks, B. Peis, D. Schmand, B. Tauer und L. Vargas Koch:
Competitive Packet Routing with Priority Lists
ACM Transactions on Econonimcs and Computation, 6 (1), p. 4 (2018).

J. Correa, C. Guzman, T. Lianeas, E. Nikolova und M. Schröder:
Network pricing: how to induce optimal flows under strategic link operators
Proceedings of the 19th ACM conference on Economics and Computation (EC’18), pp. 375-392 (2018).

H. Peters, M. Schröder und D. Vermeulen:
Hotelling's location model with negative network externalities
International Journal of Game Theory, pp. 1-27 (2018).

M. Scarsini, M. Schröder und T. Tomala:
Dynamic atomic congestion games with seasonal flows
Operations Research, 66 (2), pp. 327-339 (2018).

J. Correa, R. Hoeksma und 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 und A. Wierz:
Robust Flows over Time: Models and Complexity Results
Mathematical Programming, 171(1-2), pp. 1-31 (2017).
U. Faigle, W. Kern und B. Peis:
Greedy Oriented Flows
Algorithmica,80(4), 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 und M. Skutella:
Protection of flows under targeted attacks
Operations Research Letters, 45 (1), pp. 53-59 (2017).

O. Schaudt und 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 und 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 und A. Wierz:
Primal–Dual Algorithms for Precedence Constrained Covering Problems
Algorithmica (2016).
C. Gottschalk, H. Lüthen, B. Peis und 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 und 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 und 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 und L. Sanità:
Finding small stabilizers for unstable graphs
Mathematical Programming, 154 (1-2), pp. 173-196 (2015).

S. Fujishige, M. X. Goemans, T. Harks, B. Peis und R. Zenklusen:
Congestion games viewed from M-convexity
Operations Research Letters, 43 (3), pp. 329-333 (2015).
M. Klimm und 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 und 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 und B. Peis:
Resource Buying Games
Algorithmica, 70 (3), pp. 493-512 (2014).
J. W. Kappmeier, J. Matuschke und B. Peis:
Abstract flows over time: A first step towards solving dynamic packing problems
Theoretical Computer Science, 544, pp. 74-83 (2014).
A. Wierz, P. Beis und 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 und B. Peis:
Resource Competition on Integral Polymatroids
Proceedings of the 10th International Conference on Web and Internet Economics (WINE), pp. 182-202 (2014).

 

Preprints

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

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

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