Prof. Dr. Britta Peis
Copyright: Private
Publications (Journals)
with S. Lendl and V. Timmermans Matroid Bases with Cardinality Constraints on the Intersection Accepted for publication in Math. Programming A, March 2021 
with K. Chandrasekaran, C. Gottschalk, J. Könemann, D. Schmand and A. Wierz: Additive Stabilizers for Unstable Graphs Discrete Optimization 31, pp. 5678, 2019 
with B. Tauer, V. Timmermans and L. Vargas Koch: Oligopolistic Competitive Packet Routing Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), pp. 13:113:22 (2018). 
with T. Harks and M. Klimm: Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids SIAM Jounal on Optimization, 28 (3), pp. 22222245 (2018). 
with T. Harks, 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. 
with C. Gottschalk, A. M. C. A. Koster, F. Liers, B. Peis and A. Wierz: Robust Flows over Time: Models and Complexity Results Mathematical Programming, pp. 131 (2016). 
with U. Faigle and W. Kern: Greedy Oriented Flows Algorithmica, pp. 117 (2017). 
with J. Matuschke, S.T. McCormick, G. Oriolo and M. Skutella: Protection of flows under targeted attacks Operations Research Letters 45 (1), pp. 5359 (2017). 
with S. Fujishige, M.X. Goemans, T. Harks and R. Zenklusen: Matroids are immune to Braess paradox Mathematics of Operations Research 42 (3), pp. 745761 (2017). 
with S.T. McCormick, J. Verschae and A. Wierz: Primal–Dual Algorithms for Precedence Constrained Covering Problems Zur Publication in Agorithmica angenommen (2016). 
with A. Bock, K. Chandrasekaran, J. Könemann and L. Sanità:

with S. Fujishige, M. X. Goemans, T. Harks and R. Zenklusen:
Congestion games viewed from Mconvexity Oper. Res. Lett. 43 (3), pp. 329333 (2015). 
with T. Harks:
Resource Buying Games Algorithmica 70 (3), pp. 493512 (2014). 
with J. W. Kappmeier and J. Matuschke:
Abstract flows over time: A first step towards solving dynamic packing problems Theor. Comput. Sci. 544, pp. 7483 (2014). 
with N. Bansal, R. Khandekar, J. Könemann and V. Nagarajan:
On generalizations of network design problems with degree bounds Math. Program. 141 (12), pp. 479506 (2013). 
with U. Faigle and W. Kern:
A ranking model for the greedy algorithm and discrete convexity Math. Program. 132 (12), pp. 393407 (2012). 
with U. Faigle:
Twophase greedy algorithms for some classes of combinatorial linear programs ACM Trans. Algorithms 6 (4), pp. 65:165:13 (2010). 
with M. Lätsch:

with U. Faigle:
Note on pseudolattices, lattices and submodular linear programs Discrete Optimization 5 (2), pp. 489500 (2008). 
with U. Faigle and B. Fuchs:

with W. Hochstättler and R. Nickel: 
.
Publications (Workshops & Conferences)
with C. Gottschalk, H. Lüthen and A. Wierz: 
with T. Harks, D. Schmand and L. Vargas Koch: 
with C. Gottschalk: Submodular Function Maximization on the Bounded Integer Lattice Proceedings of the 13th International Workshop on Approximation and Online Algorithms (WAOA), pp. 133144 (2015). 
with A. Wierz 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). 
with T. Harks and M. Klimm: Resource Competition on Integral Polymatroids Proceedings of the 10th International Conference on Web and Internet Economics (WINE), pp. 182202 (2014). 
with S. T. McCormick: A PrimalDual Algorithm for Weighted Abstract Cut Packing Proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 324335 (2011). 
with A. Wiese: Universal Packet Routing with Arbitrary Bandwidths and Transit Times Proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 362375 (2011). 
with U. Faigle and W. Kern: On Greedy and Submodular Matrices Proceedings of the First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS), pp. 116126 (2011). 
with M. Skutella and A. Wiese: Packet Routing on the Grid Proceedings of the 9th Latin American Symposium on Theoretical Informatics (LATin), pp. 120130 (2010). 
with S. Stiller and A. Wiese: 
with J. Matuschke: Lattices and Maximum Flow Algorithms in Planar Graphs Proceedings of the 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG), pp. 324335 (2010). 
with M. Skutella and A. Wiese: Throughput Maximization for Periodic Packet Routing on Trees and Grids Proceedings of the 8th International Workshop on Approximation and Online Algorithms (WAOA), pp. 213224 (2010). 
with R. Koch, M. Skutella and A. Wiese: RealTime Message Routing and Scheduling Proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 13th International Workshop on Randomization and Computation (APPROXRANDOM), pp. 217230 (2009). 
with M. Skutella and A. Wiese: Packet Routing: Complexity and Algorithms Proceedings of the 7th International Workshop on Approximation and Online Algorithms (WAOA), pp. 217228 (2009). 
with U. Faigle: A Hierarchical Model for Cooperative Games Proceedings of the First International Symposium on Algorithmic Game Theory (SAGT), pp. 230241 (2008). 
with U. Faigle: Twophase greedy algorithms for some classes of combinatorial linear programs Proceedings of the Nineteenth Annual ACMSIAM Symposium on Discrete Algorithms (SODA), pp. 161166 (2008). 
with E. Korach and N. Thành: Subgraph characterization of Red/BlueSplit Graph and König Egerváry Graphs Proceedings of the Seventeenth Annual ACMSIAM Symposium on Discrete Algorithms (SODA), pp. 842850 (2006). 
.
Others
Structure Analysis of Some Generalizations of Matchings and Matroids
Dissertation, University of Cologne (2006). 