Britta Peis

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