Prof. Dr. Britta Peis

  Foto von Prof. Dr. Britta Peis Urheberrecht: Privat

 

Publikationen (Journals)

mit S. Lendl und V. Timmermans
Matroid Bases with Cardinality Constraints on the Intersection
Accepted for publication in Math. Programming A, March 2021
mit K. Chandrasekaran, C. Gottschalk, J. Könemann, D. Schmand und A. Wierz:
Additive Stabilizers for Unstable Graphs
Discrete Optimization 31, pp. 56-78, 2019
mit B. Tauer, V. Timmermans und L. Vargas Koch:
Oligopolistic Competitive Packet Routing
Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), pp. 13:1-13:22 (2018).
mit T. Harks und M. Klimm:
Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids
SIAM Jounal on Optimization, 28 (3), pp. 2222-2245 (2018).
mit T. Harks, D. Schmand, B. Tauer und L. Vargas Koch:
Competitive Packet Routing with Priority Lists
ACM Trans. Econ. Comput. 6, 1, Article 4 (March 2018), 26 pages.
mit C. Gottschalk, A. M. C. A. Koster, F. Liers, B. Peis und A. Wierz:
Robust Flows over Time: Models and Complexity Results
Mathematical Programming, pp. 1-31 (2016).
mit U. Faigle und W. Kern:
Greedy Oriented Flows
Algorithmica, pp. 1-17 (2017).
mit J. Matuschke, S.T. McCormick, G. Oriolo und M. Skutella:
Protection of flows under targeted attacks
Operations Research Letters 45 (1), pp. 53-59 (2017).
mit S. Fujishige, M.X. Goemans, T. Harks und R. Zenklusen:
Matroids are immune to Braess paradox
Mathematics of Operations Research 42 (3), pp. 745-761 (2017).
mit S.T. McCormick, J. Verschae und A. Wierz:
Primal–Dual Algorithms for Precedence Constrained Covering Problems
Zur Publication in Agorithmica angenommen (2016).

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

mit S. Fujishige, M. X. Goemans, T. Harks und R. Zenklusen:
Congestion games viewed from M-convexity
Oper. Res. Lett. 43 (3), pp. 329-333 (2015).
mit T. Harks:
Resource Buying Games
Algorithmica 70 (3), pp. 493-512 (2014).
mit J. W. Kappmeier und J. Matuschke:
Abstract flows over time: A first step towards solving dynamic packing problems
Theor. Comput. Sci. 544, pp. 74-83 (2014).
mit N. Bansal, R. Khandekar, J. Könemann und V. Nagarajan:
On generalizations of network design problems with degree bounds
Math. Program. 141 (1-2), pp. 479-506 (2013).
mit U. Faigle und W. Kern:
A ranking model for the greedy algorithm and discrete convexity
Math. Program. 132 (1-2), pp. 393-407 (2012).
mit U. Faigle:
Two-phase greedy algorithms for some classes of combinatorial linear programs
ACM Trans. Algorithms 6 (4), pp. 65:1-65:13 (2010).

mit M. Lätsch:
On a relation between the domination number and a strongly connected bidirection of an undirected graph
Discrete Applied Mathematics 156 (17), pp. 3194-3202 (2008).

mit U. Faigle:
Note on pseudolattices, lattices and submodular linear programs
Discrete Optimization 5 (2), pp. 489-500 (2008).

mit U. Faigle und B. Fuchs:
Note on maximal split-stable subgraphs
Discrete Applied Mathematics 155 (15), pp. 2031-2038 (2007).

mit W. Hochstättler und R. Nickel:
Two disjoint negative cycles in a signed graph
Electronic Notes in Discrete Mathematics 25, pp. 107-111 (2006).

.

 

Publikationen (Workshops & Conferences)

mit C. Gottschalk, H. Lüthen und A. Wierz:
Optimization Problems with Color-Induced Budget Constraints
Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO), pp. 189-200 (2016).

mit T. Harks, D. Schmand 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).

mit C. Gottschalk:
Submodular Function Maximization on the Bounded Integer Lattice
Proceedings of the 13th International Workshop on Approximation and Online Algorithms (WAOA), pp. 133-144 (2015).
mit A. Wierz 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).
mit T. Harks und M. Klimm:
Resource Competition on Integral Polymatroids
Proceedings of the 10th International Conference on Web and Internet Economics (WINE), pp. 182-202 (2014).
mit S. T. McCormick:
A Primal-Dual Algorithm for Weighted Abstract Cut Packing
Proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 324-335 (2011).
mit 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. 362-375 (2011).
mit U. Faigle und 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. 116-126 (2011).
mit M. Skutella und A. Wiese:
Packet Routing on the Grid
Proceedings of the 9th Latin American Symposium on Theoretical Informatics (LATin), pp. 120-130 (2010).

mit S. Stiller und A. Wiese:
Policies for Periodic Packet Routing
Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC), pp. 266-278 (2010).

mit 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. 324-335 (2010).
mit M. Skutella und 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. 213-224 (2010).
mit R. Koch, M. Skutella und A. Wiese:
Real-Time 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 (APPROX-RANDOM), pp. 217-230 (2009).
mit M. Skutella und A. Wiese:
Packet Routing: Complexity and Algorithms
Proceedings of the 7th International Workshop on Approximation and Online Algorithms (WAOA), pp. 217-228 (2009).
mit U. Faigle:
A Hierarchical Model for Cooperative Games
Proceedings of the First International Symposium on Algorithmic Game Theory (SAGT), pp. 230-241 (2008).
mit U. Faigle:
Two-phase greedy algorithms for some classes of combinatorial linear programs
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 161-166 (2008).
mit E. Korach und N. Thành:
Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 842-850 (2006).

.

 

Sonstiges

Structure Analysis of Some Generalizations of Matchings and Matroids
Dissertation, University of Cologne (2006).

 

Alle Publikationen des Lehrstuhls für Management Science