Britta Peis

424 total citations
26 papers, 87 citations indexed

About

Britta Peis is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Britta Peis has authored 26 papers receiving a total of 87 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 9 papers in Computer Networks and Communications and 8 papers in Management Science and Operations Research. Recurrent topics in Britta Peis's work include Advanced Graph Theory Research (13 papers), Complexity and Algorithms in Graphs (11 papers) and Game Theory and Voting Systems (8 papers). Britta Peis is often cited by papers focused on Advanced Graph Theory Research (13 papers), Complexity and Algorithms in Graphs (11 papers) and Game Theory and Voting Systems (8 papers). Britta Peis collaborates with scholars based in Germany, United States and Netherlands. Britta Peis's co-authors include Ephraim Korach, Tobias Harks, Jochen Könemann, Thanh Hung Nguyen, Laura Sanità, Ulrich Faigle, Rohit Khandekar, Arie M. C. A. Koster, Nikhil Bansal and Viswanath Nagarajan and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Optimization and Mathematics of Operations Research.

In The Last Decade

Britta Peis

20 papers receiving 83 citations

Peers

Britta Peis
Meghana Nasre India
Katarzyna Paluch Poland
Shiva Kintali United States
Mickaël Randour Belgium
Sergey Norin Canada
Umang Bhaskar United States
Oliver Friedmann Germany
Guru Guruganesh United States
Lan Xu China
Konstantinos N. Pantazopoulos United States
Meghana Nasre India
Britta Peis
Citations per year, relative to Britta Peis Britta Peis (= 1×) peers Meghana Nasre

Countries citing papers authored by Britta Peis

Since Specialization
Citations

This map shows the geographic impact of Britta Peis's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Britta Peis with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Britta Peis more than expected).

Fields of papers citing papers by Britta Peis

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Britta Peis. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Britta Peis. The network helps show where Britta Peis may publish in the future.

Co-authorship network of co-authors of Britta Peis

This figure shows the co-authorship network connecting the top 25 collaborators of Britta Peis. A scholar is included among the top collaborators of Britta Peis based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Britta Peis. Britta Peis is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Peis, Britta, et al.. (2025). Faster Dynamic Auctions via Polymatroid Sum. LSE Research Online. 13(3). 1–47.
2.
McCormick, S. Thomas, et al.. (2024). A flow‐based ascending auction to compute buyer‐optimal Walrasian prices. Networks. 84(2). 161–180. 2 indexed citations
3.
Peis, Britta, et al.. (2022). Stackelberg Max Closure with Multiple Followers. Mathematics of Operations Research. 47(4). 3010–3024. 1 indexed citations
4.
Hochstättler, Winfried, Johann L. Hurink, Bodo Manthey, et al.. (2021). In Memoriam Walter Kern. Discrete Applied Mathematics. 303. 2–3.
5.
Harks, Tobias, Max Klimm, & Britta Peis. (2018). Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids. SIAM Journal on Optimization. 28(3). 2222–2245. 5 indexed citations
6.
Harks, Tobias, et al.. (2018). Competitive Packet Routing with Priority Lists. OPUS (Augsburg University). 6(1). 1–26. 2 indexed citations
7.
Peis, Britta, et al.. (2017). Optimization problems with color-induced budget constraints. Journal of Combinatorial Optimization. 36(3). 861–870.
8.
Peis, Britta, et al.. (2017). A Combinatorial Proof of a König-type Theorem for Unimodular Hypergraphs.
9.
Lübbecke, Marco E., et al.. (2016). Operations Research Proceedings 2014. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 3 indexed citations
10.
Rossmanith, Peter, et al.. (2016). Online resource allocation on stochastic input models. RWTH Publications (RWTH Aachen). 1 indexed citations
11.
Harks, Tobias & Britta Peis. (2015). Resource Buying Games. arXiv (Cornell University). 103–111. 1 indexed citations
12.
Könemann, Jochen, et al.. (2014). Finding small stabilizers for unstable graphs. Mathematical Programming. 154(1-2). 173–196. 13 indexed citations
13.
Bansal, Nikhil, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, & Britta Peis. (2012). On generalizations of network design problems with degree bounds. Mathematical Programming. 141(1-2). 479–506. 8 indexed citations
14.
Peis, Britta & Andreas Wiese. (2011). Throughput Maximization for Periodic Packet Routing on Trees and Grids. Lecture notes in computer science. 1 indexed citations
15.
Faigle, Ulrich, Walter Kern, & Britta Peis. (2010). A ranking model for the greedy algorithm and discrete convexity. Mathematical Programming. 132(1-2). 393–407. 2 indexed citations
16.
Faigle, Ulrich & Britta Peis. (2008). Two-phase greedy algorithms for some classes of combinatorial linear programs. Symposium on Discrete Algorithms. 161–166. 4 indexed citations
17.
Peis, Britta, et al.. (2008). On a relation between the domination number and a strongly connected bidirection of an undirected graph. Discrete Applied Mathematics. 156(17). 3194–3202. 1 indexed citations
18.
Peis, Britta. (2007). Structure Analysis of Some Generalizations of Matchings and Matroids Under Algorithmic Aspects. 2 indexed citations
19.
Korach, Ephraim, et al.. (2006). Subgraph characterization of red/blue-split graph and konig egerváry graphs. Symposium on Discrete Algorithms. 842–850. 13 indexed citations
20.
Hochstättler, Winfried, et al.. (2006). Two disjoint negative cycles in a signed graph. Electronic Notes in Discrete Mathematics. 25. 107–111. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Meghana Nasre Breakdown of academic impact, for papers by Katarzyna Paluch Breakdown of academic impact, for papers by Shiva Kintali Breakdown of academic impact, for papers by Mickaël Randour Breakdown of academic impact, for papers by Sergey Norin Breakdown of academic impact, for papers by Umang Bhaskar Breakdown of academic impact, for papers by Oliver Friedmann Breakdown of academic impact, for papers by Guru Guruganesh Breakdown of academic impact, for papers by Lan Xu Breakdown of academic impact, for papers by Konstantinos N. Pantazopoulos
Rankless by CCL
2026