Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs. - Ephraim Korach; Thành Nguyen; Britta Peis (SODA, 2006)

Two disjoint negative cycles in a signed graph. - Winfried Hochstättler; Robert Nickel; Britta Peis (Electron. Notes Discret. Math., 2006)

A two-phase greedy algorithm for modular lattice polyhedra. - Ulrich Faigle; Britta Peis (CTW, 2007)

Note on maximal split-stable subgraphs. - Ulrich Faigle; Bernhard Fuchs; Britta Peis (Discret. Appl. Math., 2007)

A Hierarchical Model for Cooperative Games. - Ulrich Faigle; Britta Peis (SAGT, 2008)

On a relation between the domination number and a strongly connected bidirection of an undirected graph. - Martin Lätsch; Britta Peis (Discret. Appl. Math., 2008)

Note on pseudolattices, lattices and submodular linear programs. - Ulrich Faigle; Britta Peis (Discret. Optim., 2008)

Real-Time Message Routing and Scheduling. - Ronald Koch; Britta Peis; Martin Skutella; Andreas Wiese (APPROX-RANDOM, 2009)

Packet Routing: Complexity and Algorithms. - Britta Peis; Martin Skutella; Andreas Wiese (WAOA, 2009)

Lattice Polyhedra and Submodular Flows. - Satoru Fujishige; Britta Peis (CTW, 2010)

Policies for Periodic Packet Routing. - Britta Peis; Sebastian Stiller; Andreas Wiese (ISAAC (2), 2010)

Packet Routing on the Grid. - Britta Peis; Martin Skutella; Andreas Wiese (LATIN, 2010)

Throughput Maximization for Periodic Packet Routing on Trees and Grids. - Britta Peis; Andreas Wiese (WAOA, 2010)

Lattices and Maximum Flow Algorithms in Planar Graphs. - Jannik Matuschke; Britta Peis (WG, 2010)

Two-phase greedy algorithms for some classes of combinatorial linear programs. - Ulrich Faigle; Britta Peis (ACM Trans. Algorithms, 2010)

A Primal-Dual Algorithm for Weighted Abstract Cut Packing. - S. Thomas McCormick; Britta Peis (IPCO, 2011)

Universal Packet Routing with Arbitrary Bandwidths and Transit Times. - Britta Peis; Andreas Wiese (IPCO, 2011)

On Greedy and Submodular Matrices. - Ulrich Faigle; Walter Kern; Britta Peis (TAPAS, 2011)

Flows over Time with Negative Transit Times and Arc Release Dates. - Sandro Bosio; Jan-Philipp W. Kappmeier; Jannik Matuschke; Britta Peis; Martin Skutella (CTW, 2012)

Abstract Flows over Time. - Jan-Philipp W. Kappmeier; Jannik Matuschke; Britta Peis (CTW, 2012)

Max-Flow on Regular Spaces - Ulrich Faigle; Walter Kern; Britta Peis (CoRR, 2012)

A ranking model for the greedy algorithm and discrete convexity. - Ulrich Faigle; Walter Kern; Britta Peis (Math. Program., 2012)

On generalizations of network design problems with degree bounds. - Nikhil Bansal 001; Rohit Khandekar; Jochen Könemann; Viswanath Nagarajan; Britta Peis (Math. Program., 2013)

Primal-Dual Algorithms for Precedence Constrained Covering Problems. - Andreas Wierz; Britta Peis; S. Thomas McCormick (WAOA, 2014)

Resource Competition on Integral Polymatroids. - Tobias Harks; Max Klimm; Britta Peis (WINE, 2014)

Resource Buying Games. - Tobias Harks; Britta Peis (Algorithmica, 2014)

Abstract flows over time: A first step towards solving dynamic packing problems. - Jan-Philipp W. Kappmeier; Jannik Matuschke; Britta Peis (Theor. Comput. Sci., 2014)

Resource Buying Games. - Tobias Harks; Britta Peis (Gems of Combinatorial Optimization and Graph Algorithms, 2015)

Submodular Function Maximization on the Bounded Integer Lattice. - Corinna Gottschalk; Britta Peis (WAOA, 2015)

Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412). - José R. Correa; Tobias Harks; Kai Nagel; Britta Peis; Martin Skutella (Dagstuhl Reports, 2015)

Finding small stabilizers for unstable graphs. - Adrian Bock; Karthekeyan Chandrasekaran; Jochen Könemann; Britta Peis; Laura Sanità (Math. Program., 2015)

Congestion games viewed from M-convexity. - Satoru Fujishige; Michel X. Goemans; Tobias Harks; Britta Peis; Rico Zenklusen (Oper. Res. Lett., 2015)

Competitive Packet Routing with Priority Lists. - Tobias Harks; Britta Peis; Daniel Schmand; Laura Vargas Koch (MFCS, 2016)

Primal-Dual Algorithms for Precedence Constrained Covering Problems. - S. Thomas McCormick; Britta Peis; José Verschae; Andreas Wierz (Algorithmica, 2017)

Computational Methods for Path-based Robust Flows. - Fabian Mies; Britta Peis; Andreas Wierz (CoRR, 2017)

The Primal-Dual Greedy Algorithm for Weighted Covering Problems. - Britta Peis; José Verschae; Andreas Wierz (CoRR, 2017)

Matroids Are Immune to Braess' Paradox. - Satoru Fujishige; Michel X. Goemans; Tobias Harks; Britta Peis; Rico Zenklusen (Math. Oper. Res., 2017)

Protection of flows under targeted attacks. - Jannik Matuschke; S. Thomas McCormick; Gianpaolo Oriolo; Britta Peis; Martin Skutella (Oper. Res. Lett., 2017)

Oligopolistic Competitive Packet Routing. - Britta Peis; Bjoern Tauer; Veerle Timmermans; Laura Vargas Koch (ATMOS, 2018)

Greedy Oriented Flows. - Ulrich Faigle; Walter Kern; Britta Peis (Algorithmica, 2018)

Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102). - Roberto Cominetti; Tobias Harks; Carolina Osorio; Britta Peis (Dagstuhl Reports, 2018)

Optimization problems with color-induced budget constraints. - Corinna Gottschalk; Hendrik Lüthen; Britta Peis; Andreas Wierz (J. Comb. Optim., 2018)

Robust flows over time: models and complexity results. - Corinna Gottschalk; Arie M. C. A. Koster; Frauke Liers; Britta Peis; Daniel Schmand; Andreas Wierz (Math. Program., 2018)

Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids. - Tobias Harks; Max Klimm; Britta Peis (SIAM J. Optim., 2018)

Competitive Packet Routing with Priority Lists. - Tobias Harks; Britta Peis; Daniel Schmand; Bjoern Tauer; Laura Vargas Koch (ACM Trans. Economics and Comput., 2018)

Additive stabilizers for unstable graphs. - Karthekeyan Chandrasekaran; Corinna Gottschalk; Jochen Könemann; Britta Peis; Daniel Schmand; Andreas Wierz (Discret. Optim., 2019)

Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). - Britta Peis; Oliver Schaudt; Heiko Röglin; Bert Randerath; Rainer Schrader; Frank Vallentin (Discret. Appl. Math., 2020)

In Memoriam Walter Kern. - Winfried Hochstättler; Johann L. Hurink; Bodo Manthey; Daniël Paulusma; Britta Peis; Georg Still (Discret. Appl. Math., 2021)

A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices. - S. Thomas McCormick; Britta Peis; Robert Scheidweiler; Frank Vallentin (SIAM J. Discret. Math., 2021)

Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 22192). - Martin Gairing; Carolina Osorio; Britta Peis; David P. Watling; Katharina Eickhoff (Dagstuhl Reports, 2022)

Matroid bases with cardinality constraints on the intersection. - Stefan Lendl; Britta Peis; Veerle Timmermans (Math. Program., 2022)

Stackelberg Max Closure with Multiple Followers. - Karsten Jungnitsch; Britta Peis; Marc Schröder 002 (Math. Oper. Res., 2022)

Stackelberg Vertex Cover on a Path. - Katharina Eickhoff; Lennart Kauther; Britta Peis (SAGT, 2023)

Recoverable Robust Optimization with Commitment. - Felix Hommelsheim; Nicole Megow; Komal Muluk; Britta Peis (CoRR, 2023)

Faster Ascending Auctions via Polymatroid Sum. - Katharina Eickhoff; Britta Peis; Niklas Rieken; Laura Vargas Koch; László A. Végh (CoRR, 2023)

A Simplified Analysis of the Ascending Auction to Sell a Matroid Base. - Britta Peis; Niklas Rieken (CoRR, 2024)

A flow-based ascending auction to compute buyer-optimal Walrasian prices. - Katharina Eickhoff; S. Thomas McCormick; Britta Peis; Niklas Rieken; Laura Vargas Koch (Networks, 2024)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem. - Umang Bhaskar; Katharina Eickhoff; Lennart Kauther; Jannik Matuschke; Britta Peis; Laura Vargas Koch (CoRR, 2025)