| Publication | Date of Publication | Type |
|---|
| Streaming submodular maximization under matroid constraints | 2024-06-24 | Paper |
| Simple and asymptotically optimal online bipartite edge coloring | 2024-05-29 | Paper |
| The exact bipartite matching polytope has exponential extension complexity | 2024-05-14 | Paper |
| Towards non-uniform \(k\)-center with constant types of radii | 2024-05-14 | Paper |
| Polyhedral techniques in combinatorial optimization: matchings and tours | 2024-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147416 | 2024-01-15 | Paper |
| Flow time scheduling and prefix Beck-Fiala | 2023-12-08 | Paper |
| Semi-streaming algorithms for submodular matroid intersection | 2023-03-14 | Paper |
| A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem | 2022-12-08 | Paper |
| Fair colorful \(k\)-center clustering | 2022-10-14 | Paper |
| A simple LP-based approximation algorithm for the matching augmentation problem | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091151 | 2022-07-21 | Paper |
| A Framework for the Secretary Problem on the Intersection of Matroids | 2022-07-08 | Paper |
| On inequalities with bounded coefficients and pitch for the min knapsack polytope | 2022-06-09 | Paper |
| Fair colorful \(k\)-center clustering | 2022-03-22 | Paper |
| Semi-streaming algorithms for submodular matroid intersection | 2021-12-21 | Paper |
| Semi-supervised algorithms for approximately optimal and accurate clustering | 2021-07-28 | Paper |
| Lift-and-round to improve weighted completion time on unrelated machines | 2021-06-29 | Paper |
| Online contention resolution schemes with applications to Bayesian selection problems | 2021-03-24 | Paper |
| Weighted Matchings via Unweighted Augmentations | 2021-01-20 | Paper |
| The one-way communication complexity of submodular maximization with applications to streaming and robustness | 2021-01-19 | Paper |
| Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms | 2020-08-25 | Paper |
| No small linear program approximates vertex cover within a factor \(2 -\varepsilon\) | 2020-03-12 | Paper |
| A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem | 2020-03-12 | Paper |
| Beating greedy for stochastic bipartite matching | 2019-10-15 | Paper |
| A constant-factor approximation algorithm for the asymmetric traveling salesman problem | 2019-08-22 | Paper |
| Small extended formulation for knapsack cover inequalities from monotone circuits | 2019-01-31 | Paper |
| Combinatorial algorithm for restricted max-min fair allocation | 2018-11-05 | Paper |
| Dynamic facility location via exponential clocks | 2018-11-05 | Paper |
| Quasi-polynomial local search for restricted max-min fair allocation | 2018-10-30 | Paper |
| Constant factor approximation for ATSP with two edge weights | 2018-10-26 | Paper |
| Recent developments in approximation algorithms for facility location and clustering problems | 2018-10-16 | Paper |
| On bounded pitch inequalities for the MIN-knapsack polytope | 2018-08-17 | Paper |
| Removing and adding edges for the traveling salesman problem | 2018-08-02 | Paper |
| Online contention resolution schemes | 2018-07-16 | Paper |
| Small extended formulation for knapsack cover inequalities from monotone circuits | 2018-07-16 | Paper |
| Unrelated machine scheduling of jobs with uniform Smith ratios | 2018-07-16 | Paper |
| A framework for the secretary problem on the intersection of matroids | 2018-03-15 | Paper |
| A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem | 2017-10-05 | Paper |
| Combinatorial Algorithm for Restricted Max-Min Fair Allocation | 2017-10-05 | Paper |
| Dynamic facility location via exponential clocks | 2017-10-05 | Paper |
| Lift-and-round to improve weighted completion time on unrelated machines | 2017-09-29 | Paper |
| The Matching Problem in General Graphs is in Quasi-NC | 2017-04-06 | Paper |
| LP-based algorithms for capacitated facility location | 2017-03-10 | Paper |
| Constant factor approximation for ATSP with two edge weights (extended abstract) | 2016-08-10 | Paper |
| Approximating \(k\)-median via pseudo-approximation | 2016-05-12 | Paper |
| Centrality of trees for capacitated \(k\)-center | 2015-12-09 | Paper |
| Strong LP formulations for scheduling splittable jobs on unrelated machines | 2015-12-09 | Paper |
| On the configuration LP for maximum budgeted allocation | 2015-12-09 | Paper |
| Approximating linear threshold predicates | 2015-09-24 | Paper |
| Hardness of vertex deletion and project scheduling | 2014-10-06 | Paper |
| Tight approximation algorithms for scheduling with fixed jobs and nonavailability | 2014-09-09 | Paper |
| Conditional hardness of precedence constrained scheduling on identical machines | 2014-08-13 | Paper |
| Approximating k-median via pseudo-approximation | 2014-08-07 | Paper |
| Approximating Graphic TSP by Matchings | 2014-07-30 | Paper |
| Santa Claus schedules jobs on unrelated machines | 2014-06-05 | Paper |
| Centrality of trees for capacitated \(k\)-center | 2014-06-02 | Paper |
| Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines | 2014-06-02 | Paper |
| On the configuration LP for maximum budgeted allocation | 2014-06-02 | Paper |
| Hardness of approximating flow and job shop scheduling problems | 2014-02-17 | Paper |
| Overview of new approaches for approximating TSP | 2013-12-06 | Paper |
| Quasi-polynomial local search for restricted max-min fair allocation | 2013-08-12 | Paper |
| Single machine scheduling with scenarios | 2013-04-17 | Paper |
| Santa Claus schedules jobs on unrelated machines | 2013-02-04 | Paper |
| Hardness of vertex deletion and project scheduling | 2012-11-02 | Paper |
| On the approximability of single-machine scheduling with precedence constraints | 2012-05-24 | Paper |
| Hardness of precedence constrained scheduling on identical machines | 2012-02-11 | Paper |
| Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut | 2011-07-29 | Paper |
| Minimizing the sum of weighted completion times in a concurrent open shop | 2010-12-20 | Paper |
| Approximating linear threshold predicates | 2010-09-10 | Paper |
| Linear complementarity and P-matrices for stochastic games | 2010-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396634 | 2009-09-19 | Paper |
| Improved Bounds for Flow Shop Scheduling | 2009-07-14 | Paper |
| Approximating Single Machine Scheduling with Scenarios | 2008-11-27 | Paper |
| Linear Programming Polytope and Algorithm for Mean Payoff Games | 2008-01-04 | Paper |
| Scheduling with Precedence Constraints of Low Fractional Dimension | 2007-11-29 | Paper |
| Approximating Precedence-Constrained Single Machine Scheduling by Coloring | 2007-08-28 | Paper |
