Prof. Dr. Britta Peis

  Photo of Prof. Dr. Britta Peis Private

 

Publications (Journals)

wiit U. Faigle and W. Kern:
Greedy Oriented Flows
Algorithmica (2017).
with J. Matuschke, S.T. McCormick, G. Oriolo and M. Skutella:
Protection of flows under targeted attacks
Accepted for publication in Operations Research Letters (2016).
with S. Fujishige, M.X. Goemans, T. Harks and R. Zenklusen:
Matroids are immune to Braess paradox
Accepted for publication in Mathematics of Operations Research (2016).

with S.T. McCormick, J. Verschae and A. Wierz
Primal–Dual Algorithms for Precedence Constrained Covering Problems
Accepted for publication in Agorithmica (2016).

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

with S. Fujishige, M. X. Goemans, T. Harks and R. Zenklusen:
Congestion games viewed from M-convexity
Oper. Res. Lett. 43 (3), pp. 329-333 (2015).
with T. Harks:
Resource Buying Games
Algorithmica 70 (3), pp. 493-512 (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. 74-83 (2014).
with N. Bansal, R. Khandekar, J. Könemann and V. Nagarajan:
On generalizations of network design problems with degree bounds
Math. Program. 141 (1-2), pp. 479-506 (2013).
with U. Faigle and W. Kern:
A ranking model for the greedy algorithm and discrete convexity
Math. Program. 132 (1-2), pp. 393-407 (2012).
with U. Faigle:
Two-phase greedy algorithms for some classes of combinatorial linear programs
ACM Trans. Algorithms 6 (4), pp. 65:1-65:13 (2010).

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

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

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

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

.

 

Publications (Workshops & Conferences)

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

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

with 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).
with A. Wierz 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).
with T. Harks and M. Klimm:
Resource Competition on Integral Polymatroids
Proceedings of the 10th International Conference on Web and Internet Economics (WINE), pp. 182-202 (2014).
with 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).
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. 362-375 (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. 116-126 (2011).
with M. Skutella and A. Wiese:
Packet Routing on the Grid
Proceedings of the 9th Latin American Symposium on Theoretical Informatics (LATin), pp. 120-130 (2010).

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

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. 324-335 (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. 213-224 (2010).
with R. Koch, M. Skutella and 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).
with M. Skutella and A. Wiese:
Packet Routing: Complexity and Algorithms
Proceedings of the 7th International Workshop on Approximation and Online Algorithms (WAOA), pp. 217-228 (2009).
with U. Faigle:
A Hierarchical Model for Cooperative Games
Proceedings of the First International Symposium on Algorithmic Game Theory (SAGT), pp. 230-241 (2008).
with 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).
with E. Korach and 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).

.

 

Others

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

 

All publications of the Chair of Management Science