Britta Peis

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 40

Top Topics

Combinatorial Optimization

Top Venues

Dagstuhl Reports

Publications

Britta Peis, Niklas Rieken
A Simplified Analysis of the Ascending Auction to Sell a Matroid Base. CoRR (2024)
Katharina Eickhoff, Lennart Kauther, Britta Peis
Stackelberg Vertex Cover on a Path. CoRR (2023)
Katharina Eickhoff, Lennart Kauther, Britta Peis
Stackelberg Vertex Cover on a Path. SAGT (2023)
Katharina Eickhoff, S. Thomas McCormick, Britta Peis, Niklas Rieken, Laura Vargas Koch
A flow-based ascending auction to compute buyer-optimal Walrasian prices. CoRR (2023)
Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis
Recoverable Robust Optimization with Commitment. CoRR (2023)
Katharina Eickhoff, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh
Faster Ascending Auctions via Polymatroid Sum. CoRR (2023)
Stefan Lendl, Britta Peis, Veerle Timmermans
Matroid bases with cardinality constraints on the intersection. Math. Program. 194 (1) (2022)
Karsten Jungnitsch, Britta Peis, Marc Schröder
Stackelberg Max Closure with Multiple Followers. Math. Oper. Res. 47 (4) (2022)
Martin Gairing, Carolina Osorio, Britta Peis, David P. Watling, Katharina Eickhoff
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 22192). Dagstuhl Reports 12 (5) (2022)
Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still
In Memoriam Walter Kern. Discret. Appl. Math. 303 (2021)
S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin
A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices. SIAM J. Discret. Math. 35 (4) (2021)
S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices. CoRR (2020)
Britta Peis, Oliver Schaudt, Heiko Röglin, Bert Randerath, Rainer Schrader, Frank Vallentin
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret. Appl. Math. 272 (2020)
Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz
Additive stabilizers for unstable graphs. Discret. Optim. 31 (2019)
Stefan Lendl, Britta Peis, Veerle Timmermans
Matroid Bases with Cardinality Constraints on the Intersection. CoRR (2019)
Tobias Harks, Max Klimm, Britta Peis
Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids. SIAM J. Optim. 28 (3) (2018)
Tobias Harks, Britta Peis, Daniel Schmand, Bjoern Tauer, Laura Vargas Koch
Competitive Packet Routing with Priority Lists. ACM Trans. Economics and Comput. 6 (1) (2018)
Ulrich Faigle, Walter Kern, Britta Peis
Greedy Oriented Flows. Algorithmica 80 (4) (2018)
Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz
Robust flows over time: models and complexity results. Math. Program. 171 (1-2) (2018)
Britta Peis, Bjoern Tauer, Veerle Timmermans, Laura Vargas Koch
Oligopolistic Competitive Packet Routing. ATMOS (2018)
Roberto Cominetti, Tobias Harks, Carolina Osorio, Britta Peis
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102). Dagstuhl Reports 8 (3) (2018)
Corinna Gottschalk, Hendrik Lüthen, Britta Peis, Andreas Wierz
Optimization problems with color-induced budget constraints. J. Comb. Optim. 36 (3) (2018)
S. Thomas McCormick, Britta Peis, José Verschae, Andreas Wierz
Primal-Dual Algorithms for Precedence Constrained Covering Problems. Algorithmica 78 (3) (2017)
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella
Protection of flows under targeted attacks. Oper. Res. Lett. 45 (1) (2017)
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
Matroids Are Immune to Braess' Paradox. Math. Oper. Res. 42 (3) (2017)
Britta Peis, José Verschae, Andreas Wierz
The Primal-Dual Greedy Algorithm for Weighted Covering Problems. CoRR (2017)
Fabian Mies, Britta Peis, Andreas Wierz
Computational Methods for Path-based Robust Flows. CoRR (2017)
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella
Protection of flows under targeted attacks. CoRR (2016)
Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz
Robust Flows over Time: Models and Complexity Results. CoRR (2016)
Tobias Harks, Max Klimm, Britta Peis
Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids. CoRR (2016)
Tobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch
Competitive Packet Routing with Priority Lists. MFCS (2016)
Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz
Additive Stabilizers for Unstable Graphs. CoRR (2016)
Corinna Gottschalk, Hendrik Lüthen, Britta Peis, Andreas Wierz
Optimization Problems with Color-Induced Budget Constraints. ISCO (2016)
Corinna Gottschalk, Britta Peis
Submodular Function Maximization on the Bounded Integer Lattice. CTW (2015)
Corinna Gottschalk, Britta Peis
Submodular Function Maximization on the Bounded Integer Lattice. WAOA (2015)
Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
Finding small stabilizers for unstable graphs. Math. Program. 154 (1-2) (2015)
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
Congestion games viewed from M-convexity. Oper. Res. Lett. 43 (3) (2015)
Corinna Gottschalk, Britta Peis
Submodular Function Maximization on the Bounded Integer Lattice. CoRR (2015)
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
Matroids are Immune to Braess Paradox. CoRR (2015)
José R. Correa, Tobias Harks, Kai Nagel, Britta Peis, Martin Skutella
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412). Dagstuhl Reports 5 (10) (2015)
Tobias Harks, Britta Peis
Resource Buying Games. Algorithmica 70 (3) (2014)
Tobias Harks, Max Klimm, Britta Peis
Resource Competition on Integral Polymatroids. WINE (2014)
Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis
Abstract flows over time: A first step towards solving dynamic packing problems. Theor. Comput. Sci. 544 (2014)
Tobias Harks, Max Klimm, Britta Peis
Resource Competition on Integral Polymatroids. CoRR (2014)
Andreas Wierz, Britta Peis, S. Thomas McCormick
Primal-Dual Algorithms for Precedence Constrained Covering Problems. WAOA (2014)
Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
Finding Small Stabilizers for Unstable Graphs. IPCO (2014)
Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
On generalizations of network design problems with degree bounds. Math. Program. 141 (1-2) (2013)
Jannik Matuschke, Britta Peis
Lattices and maximum flow algorithms in planar graphs CoRR (2012)
Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis
Abstract Flows over Time. CTW (2012)
Ulrich Faigle, Walter Kern, Britta Peis
A ranking model for the greedy algorithm and discrete convexity. Math. Program. 132 (1-2) (2012)
Ulrich Faigle, Walter Kern, Britta Peis
Max-Flow on Regular Spaces CoRR (2012)
Tobias Harks, Britta Peis
Resource Buying Games CoRR (2012)
Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis
Abstract flows over time: A first step towards solving dynamic packing problems CoRR (2012)
Sandro Bosio, Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis, Martin Skutella
Flows over Time with Negative Transit Times and Arc Release Dates. CTW (2012)
Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis
Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems. ISAAC (2012)
Tobias Harks, Britta Peis
Resource Buying Games. ESA (2012)
S. Thomas McCormick, Britta Peis
A Primal-Dual Algorithm for Weighted Abstract Cut Packing. IPCO (2011)
Britta Peis, Andreas Wiese
Universal Packet Routing with Arbitrary Bandwidths and Transit Times. IPCO (2011)
Ulrich Faigle, Walter Kern, Britta Peis
On Greedy and Submodular Matrices. TAPAS (2011)
Satoru Fujishige, Britta Peis
Lattice Polyhedra and Submodular Flows. CTW (2010)
Ulrich Faigle, Britta Peis
Two-phase greedy algorithms for some classes of combinatorial linear programs. ACM Trans. Algorithms 6 (4) (2010)
Britta Peis, Martin Skutella, Andreas Wiese
Packet Routing on the Grid. LATIN (2010)
Jannik Matuschke, Britta Peis
Lattices and Maximum Flow Algorithms in Planar Graphs. WG (2010)
Britta Peis, Sebastian Stiller, Andreas Wiese
Policies for Periodic Packet Routing. ISAAC (2) (2010)
Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
On Generalizations of Network Design Problems with Degree Bounds CoRR (2010)
Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
On Generalizations of Network Design Problems with Degree Bounds. IPCO (2010)
Britta Peis, Andreas Wiese
Throughput Maximization for Periodic Packet Routing on Trees and Grids. WAOA (2010)
Ronald Koch, Britta Peis, Martin Skutella, Andreas Wiese
Real-Time Message Routing and Scheduling. APPROX-RANDOM (2009)
Britta Peis, Martin Skutella, Andreas Wiese
Packet Routing: Complexity and Algorithms. WAOA (2009)
Ulrich Faigle, Britta Peis
Note on pseudolattices, lattices and submodular linear programs. Discret. Optim. 5 (2) (2008)
Ulrich Faigle, Britta Peis
A Hierarchical Model for Cooperative Games. SAGT (2008)
Ulrich Faigle, Britta Peis
Two-phase greedy algorithms for some classes of combinatorial linear programs. SODA (2008)
Martin Lätsch, Britta Peis
On a relation between the domination number and a strongly connected bidirection of an undirected graph. Discret. Appl. Math. 156 (17) (2008)
Ulrich Faigle, Bernhard Fuchs, Britta Peis
Note on maximal split-stable subgraphs. Discret. Appl. Math. 155 (15) (2007)
Ulrich Faigle, Britta Peis
A two-phase greedy algorithm for modular lattice polyhedra. CTW (2007)
Ephraim Korach, Thành Nguyen, Britta Peis
Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs. SODA (2006)
Winfried Hochstättler, Robert Nickel, Britta Peis
Two disjoint negative cycles in a signed graph. Electron. Notes Discret. Math. 25 (2006)