| 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 − ɛ | 2020-03-12 | Paper |
| A Simple O(log log(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 |
| https://portal.mardi4nfdi.de/entity/Q4612478 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4607930 | 2018-03-15 | Paper |
| A Simple O(log log(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 | 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 |
| https://portal.mardi4nfdi.de/entity/Q3191594 | 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 |
