| Publication | Date of Publication | Type |
|---|
| A flow-based ascending auction to compute buyer-optimal Walrasian prices | 2024-09-05 | Paper |
| Oligopolistic competitive packet routing | 2024-08-27 | Paper |
| Stackelberg Vertex Cover on a Path | 2023-07-13 | Paper |
| Stackelberg Max Closure with Multiple Followers | 2023-01-09 | Paper |
| Matroid bases with cardinality constraints on the intersection | 2022-06-29 | Paper |
| A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices | 2021-11-04 | Paper |
| In memoriam Walter Kern | 2021-09-15 | Paper |
| A polynomial time algorithm for solving the closest vector problem in zonotopal lattices | 2020-04-16 | Paper |
| Additive stabilizers for unstable graphs | 2019-06-13 | Paper |
| Protection of flows under targeted attacks | 2019-02-21 | Paper |
| Optimization problems with color-induced budget constraints | 2018-12-06 | Paper |
| Congestion games viewed from M-convexity | 2018-09-28 | Paper |
| Robust flows over time: models and complexity results | 2018-09-28 | Paper |
| Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids | 2018-08-21 | Paper |
| Greedy oriented flows | 2018-05-23 | Paper |
| Competitive Packet Routing with Priority Lists | 2018-03-21 | Paper |
| Primal-dual algorithms for precedence constrained covering problems | 2017-10-09 | Paper |
| Matroids Are Immune to Braess’ Paradox | 2017-09-22 | Paper |
| Optimization Problems with Color-Induced Budget Constraints | 2016-11-30 | Paper |
| Submodular Function Maximization on the Bounded Integer Lattice | 2016-02-26 | Paper |
| Finding small stabilizers for unstable graphs | 2015-12-09 | Paper |
| Primal-Dual Algorithms for Precedence Constrained Covering Problems | 2015-11-20 | Paper |
| Resource buying games | 2015-01-19 | Paper |
| Resource Competition on Integral Polymatroids | 2015-01-07 | Paper |
| Two-phase greedy algorithms for some classes of combinatorial linear programs | 2014-11-18 | Paper |
| Structure analysis of some generalizations of matchings and matroids under algorithmic aspects | 2014-09-28 | Paper |
| Abstract flows over time: a first step towards solving dynamic packing problems | 2014-07-07 | Paper |
| Finding Small Stabilizers for Unstable Graphs | 2014-06-02 | Paper |
| On generalizations of network design problems with degree bounds | 2013-11-11 | Paper |
| Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems | 2013-03-21 | Paper |
| Lattice polyhedra and submodular flows | 2012-12-28 | Paper |
| Resource Buying Games | 2012-09-25 | Paper |
| A ranking model for the greedy algorithm and discrete convexity | 2012-04-27 | Paper |
| A Primal-Dual Algorithm for Weighted Abstract Cut Packing | 2011-06-24 | Paper |
| Universal Packet Routing with Arbitrary Bandwidths and Transit Times | 2011-06-24 | Paper |
| On Greedy and Submodular Matrices | 2011-05-12 | Paper |
| Throughput Maximization for Periodic Packet Routing on Trees and Grids | 2011-02-15 | Paper |
| Policies for Periodic Packet Routing | 2010-12-09 | Paper |
| Lattices and Maximum Flow Algorithms in Planar Graphs | 2010-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579441 | 2010-08-06 | Paper |
| On generalizations of network design problems with degree bounds | 2010-06-22 | Paper |
| Packet Routing: Complexity and Algorithms | 2010-05-11 | Paper |
| Packet Routing on the Grid | 2010-04-27 | Paper |
| Real-Time Message Routing and Scheduling | 2009-10-28 | Paper |
| On a relation between the domination number and a strongly connected bidirection of an undirected graph | 2009-03-04 | Paper |
| Note on pseudolattices, lattices and submodular linear programs | 2008-10-29 | Paper |
| A Hierarchical Model for Cooperative Games | 2008-05-02 | Paper |
| Note on maximal split-stable subgraphs | 2007-09-19 | Paper |
| Two disjoint negative cycles in a signed graph | 2007-05-29 | Paper |
