Britta Peis

From MaRDI portal
Person:378105

Available identifiers

zbMath Open peis.brittaMaRDI QIDQ378105

List of research outcomes

PublicationDate of PublicationType
Stackelberg Vertex Cover on a Path2023-07-13Paper
Stackelberg Max Closure with Multiple Followers2023-01-09Paper
Matroid bases with cardinality constraints on the intersection2022-06-29Paper
A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices2021-11-04Paper
In memoriam Walter Kern2021-09-15Paper
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices2020-04-16Paper
Additive stabilizers for unstable graphs2019-06-13Paper
Protection of flows under targeted attacks2019-02-21Paper
Optimization problems with color-induced budget constraints2018-12-06Paper
Robust flows over time: models and complexity results2018-09-28Paper
Congestion games viewed from M-convexity2018-09-28Paper
Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids2018-08-21Paper
Greedy oriented flows2018-05-23Paper
https://portal.mardi4nfdi.de/entity/Q46086112018-03-21Paper
Primal-dual algorithms for precedence constrained covering problems2017-10-09Paper
Matroids Are Immune to Braess’ Paradox2017-09-22Paper
Optimization Problems with Color-Induced Budget Constraints2016-11-30Paper
Submodular Function Maximization on the Bounded Integer Lattice2016-02-26Paper
Finding small stabilizers for unstable graphs2015-12-09Paper
Primal-Dual Algorithms for Precedence Constrained Covering Problems2015-11-20Paper
Resource buying games2015-01-19Paper
Resource Competition on Integral Polymatroids2015-01-07Paper
Two-phase greedy algorithms for some classes of combinatorial linear programs2014-11-18Paper
https://portal.mardi4nfdi.de/entity/Q29207592014-09-28Paper
Abstract flows over time: a first step towards solving dynamic packing problems2014-07-07Paper
Finding Small Stabilizers for Unstable Graphs2014-06-02Paper
On generalizations of network design problems with degree bounds2013-11-11Paper
Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems2013-03-21Paper
Lattice polyhedra and submodular flows2012-12-28Paper
Resource Buying Games2012-09-25Paper
A ranking model for the greedy algorithm and discrete convexity2012-04-27Paper
A Primal-Dual Algorithm for Weighted Abstract Cut Packing2011-06-24Paper
Universal Packet Routing with Arbitrary Bandwidths and Transit Times2011-06-24Paper
On Greedy and Submodular Matrices2011-05-12Paper
Throughput Maximization for Periodic Packet Routing on Trees and Grids2011-02-15Paper
Policies for Periodic Packet Routing2010-12-09Paper
Lattices and Maximum Flow Algorithms in Planar Graphs2010-11-16Paper
https://portal.mardi4nfdi.de/entity/Q35794412010-08-06Paper
On generalizations of network design problems with degree bounds2010-06-22Paper
Packet Routing: Complexity and Algorithms2010-05-11Paper
Packet Routing on the Grid2010-04-27Paper
Real-Time Message Routing and Scheduling2009-10-28Paper
On a relation between the domination number and a strongly connected bidirection of an undirected graph2009-03-04Paper
Note on pseudolattices, lattices and submodular linear programs2008-10-29Paper
A Hierarchical Model for Cooperative Games2008-05-02Paper
Note on maximal split-stable subgraphs2007-09-19Paper
Two disjoint negative cycles in a signed graph2007-05-29Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Britta Peis