default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBritta Peis
Person information
- affiliation: RWTH Aachen University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i25]Britta Peis, Niklas Rieken:
A Simplified Analysis of the Ascending Auction to Sell a Matroid Base. CoRR abs/2404.12121 (2024)- 2023
- [c27]Katharina Eickhoff
, Lennart Kauther, Britta Peis:
Stackelberg Vertex Cover on a Path. SAGT 2023: 22-39 - [i24]Katharina Eickhoff, S. Thomas McCormick, Britta Peis, Niklas Rieken, Laura Vargas Koch:
A flow-based ascending auction to compute buyer-optimal Walrasian prices. CoRR abs/2304.14262 (2023) - [i23]Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis:
Recoverable Robust Optimization with Commitment. CoRR abs/2306.08546 (2023) - [i22]Katharina Eickhoff, Lennart Kauther, Britta Peis:
Stackelberg Vertex Cover on a Path. CoRR abs/2307.06772 (2023) - [i21]Katharina Eickhoff, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh:
Faster Ascending Auctions via Polymatroid Sum. CoRR abs/2310.08454 (2023) - 2022
- [j25]Karsten Jungnitsch, Britta Peis, Marc Schröder:
Stackelberg Max Closure with Multiple Followers. Math. Oper. Res. 47(4): 3010-3024 (2022) - [j24]Stefan Lendl, Britta Peis, Veerle Timmermans:
Matroid bases with cardinality constraints on the intersection. Math. Program. 194(1): 661-684 (2022) - [i20]Martin Gairing, Carolina Osorio, Britta Peis, David P. Watling, Katharina Eickhoff:
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 22192). Dagstuhl Reports 12(5): 92-111 (2022) - 2021
- [j23]Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still:
In Memoriam Walter Kern. Discret. Appl. Math. 303: 2-3 (2021) - [j22]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): 2345-2356 (2021) - [e2]Jochen Könemann, Britta Peis:
Approximation and Online Algorithms - 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected Papers. Lecture Notes in Computer Science 12982, Springer 2021, ISBN 978-3-030-92701-1 [contents] - 2020
- [j21]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: 1 (2020) - [i19]S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin:
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices. CoRR abs/2004.07574 (2020)
2010 – 2019
- 2019
- [j20]Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz:
Additive stabilizers for unstable graphs. Discret. Optim. 31: 56-78 (2019) - [i18]Stefan Lendl, Britta Peis, Veerle Timmermans:
Matroid Bases with Cardinality Constraints on the Intersection. CoRR abs/1907.04741 (2019) - 2018
- [j19]Ulrich Faigle, Walter Kern, Britta Peis:
Greedy Oriented Flows. Algorithmica 80(4): 1298-1314 (2018) - [j18]Corinna Gottschalk, Hendrik Lüthen, Britta Peis, Andreas Wierz:
Optimization problems with color-induced budget constraints. J. Comb. Optim. 36(3): 861-870 (2018) - [j17]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): 55-85 (2018) - [j16]Tobias Harks, Max Klimm, Britta Peis:
Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids. SIAM J. Optim. 28(3): 2222-2245 (2018) - [j15]Tobias Harks, Britta Peis, Daniel Schmand, Bjoern Tauer, Laura Vargas Koch:
Competitive Packet Routing with Priority Lists. ACM Trans. Economics and Comput. 6(1): 4:1-4:26 (2018) - [c26]Britta Peis, Bjoern Tauer, Veerle Timmermans, Laura Vargas Koch:
Oligopolistic Competitive Packet Routing. ATMOS 2018: 13:1-13:22 - [i17]Roberto Cominetti, Tobias Harks, Carolina Osorio, Britta Peis:
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102). Dagstuhl Reports 8(3): 21-38 (2018) - 2017
- [j14]S. Thomas McCormick, Britta Peis, José Verschae, Andreas Wierz:
Primal-Dual Algorithms for Precedence Constrained Covering Problems. Algorithmica 78(3): 771-787 (2017) - [j13]Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Matroids Are Immune to Braess' Paradox. Math. Oper. Res. 42(3): 745-761 (2017) - [j12]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella:
Protection of flows under targeted attacks. Oper. Res. Lett. 45(1): 53-59 (2017) - [i16]Britta Peis, José Verschae, Andreas Wierz:
The Primal-Dual Greedy Algorithm for Weighted Covering Problems. CoRR abs/1704.08522 (2017) - [i15]Fabian Mies, Britta Peis, Andreas Wierz:
Computational Methods for Path-based Robust Flows. CoRR abs/1705.08161 (2017) - 2016
- [c25]Corinna Gottschalk, Hendrik Lüthen, Britta Peis, Andreas Wierz:
Optimization Problems with Color-Induced Budget Constraints. ISCO 2016: 189-200 - [c24]Tobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch:
Competitive Packet Routing with Priority Lists. MFCS 2016: 49:1-49:14 - [e1]Marco E. Lübbecke, Arie Koster, Peter Letmathe, Reinhard Madlener, Britta Peis, Grit Walther:
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. Springer 2016, ISBN 978-3-319-28695-2 [contents] - [i14]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella:
Protection of flows under targeted attacks. CoRR abs/1601.03603 (2016) - [i13]Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz:
Robust Flows over Time: Models and Complexity Results. CoRR abs/1608.06520 (2016) - [i12]Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz:
Additive Stabilizers for Unstable Graphs. CoRR abs/1608.06797 (2016) - [i11]Tobias Harks, Max Klimm, Britta Peis:
Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids. CoRR abs/1611.05372 (2016) - 2015
- [j11]Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità:
Finding small stabilizers for unstable graphs. Math. Program. 154(1-2): 173-196 (2015) - [j10]Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Congestion games viewed from M-convexity. Oper. Res. Lett. 43(3): 329-333 (2015) - [c23]Corinna Gottschalk, Britta Peis:
Submodular Function Maximization on the Bounded Integer Lattice. WAOA 2015: 133-144 - [p1]Tobias Harks, Britta Peis:
Resource Buying Games. Gems of Combinatorial Optimization and Graph Algorithms 2015: 103-111 - [i10]Corinna Gottschalk, Britta Peis:
Submodular Function Maximization on the Bounded Integer Lattice. CTW 2015: 16-19 - [i9]Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Matroids are Immune to Braess Paradox. CoRR abs/1504.07545 (2015) - [i8]Corinna Gottschalk, Britta Peis:
Submodular Function Maximization on the Bounded Integer Lattice. CoRR abs/1505.05423 (2015) - [i7]José R. Correa, Tobias Harks, Kai Nagel, Britta Peis, Martin Skutella:
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412). Dagstuhl Reports 5(10): 19-34 (2015) - 2014
- [j9]Tobias Harks, Britta Peis:
Resource Buying Games. Algorithmica 70(3): 493-512 (2014) - [j8]Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis:
Abstract flows over time: A first step towards solving dynamic packing problems. Theor. Comput. Sci. 544: 74-83 (2014) - [c22]Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità:
Finding Small Stabilizers for Unstable Graphs. IPCO 2014: 150-161 - [c21]Andreas Wierz, Britta Peis, S. Thomas McCormick:
Primal-Dual Algorithms for Precedence Constrained Covering Problems. WAOA 2014: 260-272 - [c20]Tobias Harks, Max Klimm, Britta Peis:
Resource Competition on Integral Polymatroids. WINE 2014: 189-202 - [i6]Tobias Harks, Max Klimm, Britta Peis:
Resource Competition on Integral Polymatroids. CoRR abs/1407.7650 (2014) - 2013
- [j7]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): 479-506 (2013) - 2012
- [j6]Ulrich Faigle, Walter Kern, Britta Peis:
A ranking model for the greedy algorithm and discrete convexity. Math. Program. 132(1-2): 393-407 (2012) - [c19]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: 30-33 - [c18]Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis:
Abstract Flows over Time. CTW 2012: 157-161 - [c17]Tobias Harks, Britta Peis:
Resource Buying Games. ESA 2012: 563-574 - [c16]Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis:
Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems. ISAAC 2012: 433-443 - [i5]Tobias Harks, Britta Peis:
Resource Buying Games. CoRR abs/1204.4111 (2012) - [i4]Ulrich Faigle, Walter Kern, Britta Peis:
Max-Flow on Regular Spaces. CoRR abs/1206.5167 (2012) - [i3]Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis:
Abstract flows over time: A first step towards solving dynamic packing problems. CoRR abs/1211.2177 (2012) - [i2]Jannik Matuschke, Britta Peis:
Lattices and maximum flow algorithms in planar graphs. CoRR abs/1211.2189 (2012) - 2011
- [c15]S. Thomas McCormick, Britta Peis:
A Primal-Dual Algorithm for Weighted Abstract Cut Packing. IPCO 2011: 324-335 - [c14]Britta Peis, Andreas Wiese:
Universal Packet Routing with Arbitrary Bandwidths and Transit Times. IPCO 2011: 362-375 - [c13]Ulrich Faigle, Walter Kern, Britta Peis:
On Greedy and Submodular Matrices. TAPAS 2011: 116-126 - 2010
- [j5]Ulrich Faigle, Britta Peis:
Two-phase greedy algorithms for some classes of combinatorial linear programs. ACM Trans. Algorithms 6(4): 65:1-65:13 (2010) - [c12]Satoru Fujishige, Britta Peis:
Lattice Polyhedra and Submodular Flows. CTW 2010: 55-59 - [c11]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123 - [c10]Britta Peis, Sebastian Stiller, Andreas Wiese:
Policies for Periodic Packet Routing. ISAAC (2) 2010: 266-278 - [c9]Britta Peis, Martin Skutella, Andreas Wiese:
Packet Routing on the Grid. LATIN 2010: 120-130 - [c8]Britta Peis, Andreas Wiese:
Throughput Maximization for Periodic Packet Routing on Trees and Grids. WAOA 2010: 213-224 - [c7]Jannik Matuschke, Britta Peis:
Lattices and Maximum Flow Algorithms in Planar Graphs. WG 2010: 324-335 - [i1]Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On Generalizations of Network Design Problems with Degree Bounds. CoRR abs/1003.2977 (2010)
2000 – 2009
- 2009
- [c6]Ronald Koch, Britta Peis, Martin Skutella, Andreas Wiese:
Real-Time Message Routing and Scheduling. APPROX-RANDOM 2009: 217-230 - [c5]Britta Peis, Martin Skutella, Andreas Wiese:
Packet Routing: Complexity and Algorithms. WAOA 2009: 217-228 - 2008
- [j4]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): 3194-3202 (2008) - [j3]Ulrich Faigle, Britta Peis:
Note on pseudolattices, lattices and submodular linear programs. Discret. Optim. 5(2): 489-500 (2008) - [c4]Ulrich Faigle, Britta Peis:
A Hierarchical Model for Cooperative Games. SAGT 2008: 230-241 - [c3]Ulrich Faigle, Britta Peis:
Two-phase greedy algorithms for some classes of combinatorial linear programs. SODA 2008: 161-166 - 2007
- [j2]Ulrich Faigle, Bernhard Fuchs, Britta Peis:
Note on maximal split-stable subgraphs. Discret. Appl. Math. 155(15): 2031-2038 (2007) - [c2]Ulrich Faigle, Britta Peis:
A two-phase greedy algorithm for modular lattice polyhedra. CTW 2007: 33-37 - 2006
- [j1]Winfried Hochstättler, Robert Nickel, Britta Peis:
Two disjoint negative cycles in a signed graph. Electron. Notes Discret. Math. 25: 107-111 (2006) - [c1]Ephraim Korach, Thành Nguyen, Britta Peis:
Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs. SODA 2006: 842-850
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
