# 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. Götte, V. Ravindran Vijayalakshmi and C. Scheideler:
Always be Two Steps Ahead of Your Enemy
IEEE International Parallel and Distributed Processing Symposium (IPDPS 2019). |

V. Ravindran Vijayalakshmi, M. Schröder and T. Tamir:
Scheduling Games with Machine-Dependent Priority Lists
Accepted for WINE 2019. |

R. Cominetti, M. Scarsini, M. Schröder and N. Stier-Moses:Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs
Proceedings of the 2019 ACM Conference on Economics and Computation (EC'19). |

D. Schmand, M. Schröder and A. Skopalik:Network Investment Games with Wardrop Followers
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). |

T. Harks, M. Schröder and D. Vermeulen:Toll Caps in Privatized Road Networks
European Journal of Operational Research, 276 (3), pp. 947-956 (2019). |

M. Groß, M. E. Pfetsch, L. Schewe, M. Schmidt, M. Skutella:Algorithmic results for potential-based flows: Easy and hard cases
Networks, 73(3), pp. 306-324 (2019). |

R. Burlacu, H. Egger, M. Groß, A. Martin, M. E. Pfetsch, L. Schewe, M. Sirvent, M. Skutella:Maximizing the storage capacity of gas networks: a global MINLP approach
Optimization and Engineering 20(2), pp. 543-57 (2019). |

I. O. Bercea, M. Groß, S. Khuller, A. Kumar, C. Rösner, D. R. Schmidt, M. Schmidt:On the cost of essentially fair clusterings
CoRR abs/1811.10319 (2018). |

M. Groß, M. E. Pfetsch, M. Skutella:On the complexity of instationary gas flows
Operations Research Letters, 46(3), pp. 286-290 (2018). |

S. Fiorini, M. Groß, J. Könemann, L. Sanità:Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts
Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. |

M. Groß, A. Gupta, A. Kumar, J. Matuschke, D. R. Schmidt, M. Schmidt, J. Verschae:A Local-Search Algorithm for Steiner Forest
Leibniz International Proceedings in Informatics (2018). |

A. Arulselvan, Á. Cseh, M. Groß, D. F. Manlove, J. Matuschke:Matchings with Lower Quotas: Algorithms and Complexity
Algorithmica 80(1), pp. 185-208 (2018). |

L. Sering and L. Vargas Koch:Nash Flows over Time with Spillback
Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019). |

M. Strehler, R. Schefler and L. Vargas Koch:Equilibria in Routing Games with Edge Priorities
International Conference on Web and Internet Economics (WINE 2018). |

J. Correa, R. Hoeksma and M. Schröder:
Network congestion games are robust to variable demand
Transportation Research Part B: Methodological, 119, pp.69-78 (2019). |

H. Peters, M. Schröder and D. Vermeulen:Claim Games for Estate Division Problems
Games and Economic Behavior, 116, 105-115 (2019). |

K. Chandrasekaran, C. Gottschalk, J. Könemann, B. Peis, D. Schmand and A. Wierz:Additive Stabilizers for Unstable Graphs
Discrete Optimization, 31, pp. 56-78 (2019). |

T. Harks and V. Timmermans:Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
Journal of Combinatorial Optimization, 36 (3), pp. 812-830 (2018). |

B. Peis, B. Tauer, V. Timmermans and L. Vargas Koch: |

T. Harks, M. Klimm and 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 and 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 and 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 and D. Vermeulen:
Hotelling's location model with negative network externalities
International Journal of Game Theory, 47 (3), pp. 811-837 (2018). |

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

T. Harks and V. Timmermans:
Equilibrium Computation in Atomic Splittable Singleton Congestion Games
Proceedings of the 19th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 442-454 (2017). |

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, 171 (1-2), pp. 1-31 (2017). |

U. Faigle, W. Kern and 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 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à: |

S. Fujishige, M. X. Goemans, T. Harks, B. Peis and R. Zenklusen:Congestion games viewed from M-convexity
Operations Research Letters 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
Theoretical Computer Science 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). |

.

## Preprints

Vera WeilA 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: |

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). |