Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
- Britta Peis
RWTH Aachen University
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 80 matches
- 2024
- Britta Peis, Niklas Rieken:
A Simplified Analysis of the Ascending Auction to Sell a Matroid Base. CoRR abs/2404.12121 (2024) - 2023
- Katharina Eickhoff, Lennart Kauther, Britta Peis:
Stackelberg Vertex Cover on a Path. SAGT 2023: 22-39 - 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) - Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis:
Recoverable Robust Optimization with Commitment. CoRR abs/2306.08546 (2023) - Katharina Eickhoff, Lennart Kauther, Britta Peis:
Stackelberg Vertex Cover on a Path. CoRR abs/2307.06772 (2023) - 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
- Karsten Jungnitsch, Britta Peis, Marc Schröder:
Stackelberg Max Closure with Multiple Followers. Math. Oper. Res. 47(4): 3010-3024 (2022) - Stefan Lendl, Britta Peis, Veerle Timmermans:
Matroid bases with cardinality constraints on the intersection. Math. Program. 194(1): 661-684 (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): 92-111 (2022) - 2021
- 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) - 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) - 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
- 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) - 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) - 2019
- Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz:
Additive stabilizers for unstable graphs. Discret. Optim. 31: 56-78 (2019) - Stefan Lendl, Britta Peis, Veerle Timmermans:
Matroid Bases with Cardinality Constraints on the Intersection. CoRR abs/1907.04741 (2019) - 2018
- Ulrich Faigle, Walter Kern, Britta Peis:
Greedy Oriented Flows. Algorithmica 80(4): 1298-1314 (2018) - Corinna Gottschalk, Hendrik Lüthen, Britta Peis, Andreas Wierz:
Optimization problems with color-induced budget constraints. J. Comb. Optim. 36(3): 861-870 (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): 55-85 (2018) - Tobias Harks, Max Klimm, Britta Peis:
Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids. SIAM J. Optim. 28(3): 2222-2245 (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): 4:1-4:26 (2018) - Britta Peis, Bjoern Tauer, Veerle Timmermans, Laura Vargas Koch:
Oligopolistic Competitive Packet Routing. ATMOS 2018: 13:1-13:22 - 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
- S. Thomas McCormick, Britta Peis, José Verschae, Andreas Wierz:
Primal-Dual Algorithms for Precedence Constrained Covering Problems. Algorithmica 78(3): 771-787 (2017) - 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) - 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) - Fabian Mies, Britta Peis, Andreas Wierz:
Computational Methods for Path-based Robust Flows. CoRR abs/1705.08161 (2017) - Britta Peis, José Verschae, Andreas Wierz:
The Primal-Dual Greedy Algorithm for Weighted Covering Problems. CoRR abs/1704.08522 (2017) - 2016
- Corinna Gottschalk, Hendrik Lüthen, Britta Peis, Andreas Wierz:
Optimization Problems with Color-Induced Budget Constraints. ISCO 2016: 189-200 - Tobias Harks, Britta Peis, Daniel Schmand, Laura Vargas Koch:
Competitive Packet Routing with Priority Lists. MFCS 2016: 49:1-49:14
skipping 50 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-06-03 16:28 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint