| Publication | Date of Publication | Type |
|---|
| Bridging the gap between tree and connectivity augmentation: unified and stronger approaches | 2023-11-14 | Paper |
| Advances on strictly \(\varDelta \)-modular IPs | 2023-11-09 | Paper |
| Constant-competitiveness for random assignment matroid secretary without knowing the matroid | 2023-11-09 | Paper |
| Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information | 2022-11-28 | Paper |
| A Simple Combinatorial Algorithm for Robust Matroid Center | 2022-11-07 | Paper |
| A Technique for Obtaining True Approximations for k-Center with Covering Constraints | 2022-10-14 | Paper |
| A Framework for the Secretary Problem on the Intersection of Matroids | 2022-07-08 | Paper |
| An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint | 2022-03-22 | Paper |
| A technique for obtaining true approximations for \(k\)-center with covering constraints | 2022-03-22 | Paper |
| Reducing Path TSP to TSP | 2021-11-19 | Paper |
| Online Contention Resolution Schemes with Applications to Bayesian Selection Problems | 2021-03-24 | Paper |
| Reducing path TSP to TSP | 2021-01-19 | Paper |
| The one-way communication complexity of submodular maximization with applications to streaming and robustness | 2021-01-19 | Paper |
| Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the F\"uredi, Kahn, and Seymour Conjecture | 2020-09-01 | Paper |
| Approximate multi-matroid intersection via iterative refinement | 2020-08-28 | Paper |
| A new contraction technique with applications to congruency-constrained cuts | 2020-08-28 | Paper |
| Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes | 2020-05-31 | Paper |
| Submodular Maximization Through the Lens of Linear Programming | 2020-04-30 | Paper |
| An Improved Analysis of Local Search for Max-Sum Diversification | 2020-04-30 | Paper |
| A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem | 2020-03-12 | Paper |
| Submodular minimization under congruency constraints | 2020-02-26 | Paper |
| Approximate multi-matroid intersection via iterative refinement | 2020-02-06 | Paper |
| A new contraction technique with applications to congruency-constrained cuts | 2020-02-06 | Paper |
| A 1.5-Approximation for Path TSP | 2019-10-15 | Paper |
| A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond | 2019-10-15 | Paper |
| Improved approximation for tree augmentation: saving by rewiring | 2019-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743495 | 2019-05-10 | Paper |
| Firefighting on Trees Beyond Integrality Gaps | 2019-03-28 | Paper |
| Refuting a conjecture of goemans on bounded degree spanning trees | 2019-01-15 | Paper |
| \(k\)-trails: recognition, complexity, and approximations | 2018-10-26 | Paper |
| Connectivity interdiction | 2018-09-28 | Paper |
| Congestion games viewed from M-convexity | 2018-09-28 | Paper |
| On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants | 2018-07-18 | Paper |
| Online Contention Resolution Schemes | 2018-07-16 | Paper |
| Local Search for Max-Sum Diversification | 2018-07-16 | Paper |
| Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations | 2018-07-16 | Paper |
| Firefighting on Trees Beyond Integrality Gaps | 2018-07-16 | Paper |
| Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix | 2018-06-25 | Paper |
| Hardness and approximation for network flow interdiction | 2018-04-27 | Paper |
| The Submodular Secretary Problem Goes Linear | 2018-04-24 | Paper |
| Submodular minimization under congruency constraints | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607930 | 2018-03-15 | Paper |
| Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting | 2018-03-15 | Paper |
| Chain-constrained spanning trees | 2018-02-28 | Paper |
| Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem | 2018-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132860 | 2018-01-30 | Paper |
| A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365101 | 2017-09-29 | Paper |
| Matroids Are Immune to Braess’ Paradox | 2017-09-22 | Paper |
| Extension complexities of Cartesian products involving a pyramid | 2017-09-19 | Paper |
| A strongly polynomial algorithm for bimodular integer linear programming | 2017-08-17 | Paper |
| Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives | 2017-04-13 | Paper |
| k-Trails: Recognition, Complexity, and Approximations | 2016-08-10 | Paper |
| Approximate dynamic programming for stochastic linear control problems on compact state spaces | 2016-06-23 | Paper |
| Bulk-robust combinatorial optimization | 2015-02-09 | Paper |
| New approaches to multi-objective optimization | 2014-08-29 | Paper |
| Time-Expanded Packings | 2014-07-01 | Paper |
| Submodular function maximization via the multilinear relaxation and contention resolution schemes | 2014-06-05 | Paper |
| Network design with a discrete set of traffic matrices | 2014-05-14 | Paper |
| Matroids and integrality gaps for hypergraphic steiner tree relaxations | 2014-05-13 | Paper |
| An adaptive routing approach for personal rapid transit | 2013-08-02 | Paper |
| Stable Routing and Unique-Max Coloring on Trees | 2013-06-27 | Paper |
| Advances on Matroid Secretary Problems: Free Order Model and Laminar Case | 2013-03-19 | Paper |
| Chain-Constrained Spanning Trees | 2013-03-19 | Paper |
| Bisections above Tight Lower Bounds | 2012-11-06 | Paper |
| A flow model based on polylinking system | 2012-10-15 | Paper |
| A note on chromatic properties of threshold graphs | 2012-05-30 | Paper |
| Approximation Algorithms for Conflict-Free Vehicle Routing | 2011-09-16 | Paper |
| High-confidence estimation of small s -t reliabilities in directed acyclic networks | 2011-08-16 | Paper |
| Stochastic convergence of random search methods to fixed size Pareto front approximations | 2011-06-22 | Paper |
| An \(s\)-\(t\) connection problem with adaptability | 2011-05-17 | Paper |
| A 2-approximation for the maximum satisfying bisection problem | 2011-04-29 | Paper |
| A Simple Proof for a Characterization of Sign-Central Matrices Using Linear Duality | 2011-04-07 | Paper |
| Combinatorial Aspects of Move-Up Crews for Spreading Processes on Networks | 2011-04-07 | Paper |
| Matching interdiction | 2010-11-05 | Paper |
| Approximation Schemes for Multi-Budgeted Independence Systems | 2010-09-06 | Paper |
| Network flow interdiction on planar graphs | 2010-08-13 | Paper |
| Computational complexity of impact size estimation for spreading processes on networks | 2010-06-23 | Paper |
| Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid | 2009-12-15 | Paper |
| Blockers and transversals | 2009-12-10 | Paper |
| A tight bound on the collection of edges in MSTs of induced subgraphs | 2009-03-04 | Paper |
