| Publication | Date of Publication | Type |
|---|
| Finding almost tight witness trees | 2024-11-14 | Paper |
| Stabilization of capacitated matching games | 2023-11-09 | Paper |
| Node connectivity augmentation via iterative randomized rounding | 2023-05-02 | Paper |
| Finding Almost Tight Witness Trees | 2022-11-22 | Paper |
| Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization | 2022-09-14 | Paper |
| On the Simplex method for 0/1 polytopes | 2021-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009558 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002762 | 2021-07-28 | Paper |
| Stabilizing Weighted Graphs | 2021-01-08 | Paper |
| An efficient characterization of submodular spanning tree games | 2020-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111735 | 2020-05-27 | Paper |
| Opposite Elements in Clutters | 2020-03-12 | Paper |
| An efficient characterization of submodular spanning tree games | 2020-02-06 | Paper |
| On the Circuit Diameter of Some Combinatorial Polytopes | 2019-01-07 | Paper |
| Stabilizing network bargaining games by blocking players | 2018-10-26 | Paper |
| On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space | 2018-09-28 | Paper |
| The diameter of the fractional matching polytope and its hardness implications | 2018-06-08 | Paper |
| Fast Approximation Algorithms for the Generalized Survivable Network Design Problem | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607935 | 2018-03-15 | Paper |
| Improved Region-Growing and Combinatorial Algorithms for k-Route Cut Problems (Extended Abstract) | 2017-10-05 | Paper |
| 0/1 Polytopes with Quadratic Chvátal Rank | 2017-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969617 | 2017-03-22 | Paper |
| On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree | 2016-11-25 | Paper |
| Stabilizing Network Bargaining Games by Blocking Players | 2016-08-10 | Paper |
| Lehman's Theorem and the Directed Steiner Tree Problem | 2016-01-15 | Paper |
| Finding small stabilizers for unstable graphs | 2015-12-09 | Paper |
| Approximate Deadline-Scheduling with Precedence Constraints | 2015-11-19 | Paper |
| The interval constrained 3-coloring problem | 2015-10-08 | Paper |
| Exponentiality of the exchange algorithm for finding another room-partitioning | 2015-09-22 | Paper |
| The capacitated orienteering problem | 2015-09-21 | Paper |
| An improved LP-based approximation for Steiner tree | 2014-08-13 | Paper |
| Finding small stabilizers for unstable graphs | 2014-06-02 | Paper |
| Network design with a discrete set of traffic matrices | 2014-05-14 | Paper |
| Steiner tree approximation via iterative randomized rounding | 2014-02-17 | Paper |
| The school bus problem on trees | 2013-11-11 | Paper |
| On finding another room-partitioning of the vertices | 2013-11-08 | Paper |
| Better approximation algorithms for technology diffusion | 2013-09-17 | Paper |
| Stable routing and unique-max coloring on trees | 2013-06-27 | Paper |
| 0/1 polytopes with quadratic Chvátal rank | 2013-03-19 | Paper |
| From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk | 2012-05-24 | Paper |
| The school bus problem on trees | 2011-12-16 | Paper |
| An exact algorithm for robust network design | 2011-09-09 | Paper |
| Set Covering with Ordered Replacement: Additive and Multiplicative Gaps | 2011-06-24 | Paper |
| The VPN Problem with Concave Costs | 2011-06-17 | Paper |
| Stable routing under the Spanning Tree Protocol | 2010-12-20 | Paper |
| The interval constrained 3-coloring problem | 2010-04-27 | Paper |
| On the Complexity of the Asymmetric VPN Problem | 2009-10-28 | Paper |
| The Virtual Private Network Design Problem with Concave Costs (Oberwolfach abstract) | 2008-12-12 | Paper |
| The VPN Tree Routing Conjecture for Outerplanar Networks | 2007-11-16 | Paper |
| Capacitated Network Bargaining Games: Stability and Structure | N/A | Paper |
| On the Number of Degenerate Simplex Pivots | N/A | Paper |
| On the Hardness of Short and Sign-Compatible Circuit Walks | N/A | Paper |
