| Publication | Date of Publication | Type |
|---|
| An improved approximation algorithm for the Max-3-Section problem | 2025-01-06 | Paper |
| Approximation algorithms for the weighted Nash social welfare via convex and non-convex programs | 2024-11-28 | Paper |
| Heterogeneous Multi-resource Planning and Allocation Under Stochastic Demand | 2024-03-22 | Paper |
| Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875661 | 2023-02-03 | Paper |
| Adaptive Bin Packing with Overflow | 2023-01-09 | Paper |
| Heterogeneous Multi-resource Allocation with Subset Demand Requests | 2022-12-01 | Paper |
| Efficient Determinant Maximization for All Matroids | 2022-11-18 | Paper |
| Socially fair network design via iterative rounding | 2022-10-17 | Paper |
| Dynamic resource allocation in the cloud with near-optimal efficiency | 2022-09-19 | Paper |
| Tropicalization of graph profiles | 2022-08-31 | Paper |
| Structured Robust Submodular Maximization: Offline and Online Algorithms | 2022-06-28 | Paper |
| Proportional volume sampling and approximation algorithms for \(A\)-optimal design | 2022-06-27 | Paper |
| Heterogeneous Multi-Resource Allocation with Subset Demand Requests | 2022-03-04 | Paper |
| Effect of discrete breathers on the specific heat of a nonlinear chain | 2021-04-29 | Paper |
| Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems | 2021-02-02 | Paper |
| Simple graph density inequalities with no sum of squares proofs | 2021-01-25 | Paper |
| Approximation algorithms for \(D\)-optimal design | 2021-01-08 | Paper |
| Rank one tensor completion problem | 2020-09-18 | Paper |
| Timing matters: online dynamics in broadcast games | 2020-06-18 | Paper |
| Integrality gap of the vertex cover linear programming relaxation | 2020-02-10 | Paper |
| Proportional volume sampling and approximation algorithms for \(A\)-optimal design | 2019-10-15 | Paper |
| Approximating minimum cost connectivity orientation and augmentation | 2019-06-20 | Paper |
| \(k\)-trails: recognition, complexity, and approximations | 2018-10-26 | Paper |
| Efficient algorithms for discrepancy minimization in convex sets | 2018-09-25 | Paper |
| Symmetry in Turán sums of squares polynomials from flag algebras | 2018-06-08 | Paper |
| Nash social welfare, matrix permanent, and stable polynomials | 2018-05-03 | Paper |
| Random walks in polytopes and negative dependence | 2018-05-03 | Paper |
| Approximate positive correlated distributions and approximation algorithms for \(D\)-optimal design | 2018-03-15 | Paper |
| Approximating Minimum Cost Connectivity Orientation and Augmentation | 2018-03-09 | Paper |
| Symmetric sums of squares over \(k\)-subset hypercubes | 2018-02-28 | Paper |
| Maximizing determinants under partition constraints | 2017-09-29 | Paper |
| Minimum Birkhoff-von Neumann decomposition | 2017-08-31 | Paper |
| On weighted bipartite edge coloring | 2017-07-13 | Paper |
| Discrepancy without partial colorings | 2017-03-22 | Paper |
| LP-based algorithms for capacitated facility location | 2017-03-10 | Paper |
| \(k\)-trails: recognition, complexity, and approximations | 2016-08-10 | Paper |
| Approximating minimum bounded degree spanning trees to within one of optimal | 2015-08-14 | Paper |
| Entropy, optimization and counting | 2015-06-26 | Paper |
| New approaches to multi-objective optimization | 2014-08-29 | Paper |
| A Randomized Rounding Approach to the Traveling Salesman Problem | 2014-07-30 | Paper |
| Online node-weighted Steiner tree and related problems | 2014-07-30 | Paper |
| Short Tours through Large Linear Forests | 2014-06-02 | Paper |
| Degree bounded matroids and submodular flows | 2014-05-05 | Paper |
| Additive Approximation for Bounded Degree Survivable Network Design | 2014-04-11 | Paper |
| Set covering with our eyes closed | 2013-09-25 | Paper |
| A rounding by sampling approach to the minimum size \(k\)-arc connected subgraph problem | 2013-08-12 | Paper |
| Approximation algorithms for online weighted rank function maximization under matroid constraints | 2013-08-12 | Paper |
| Iterative methods in combinatorial optimization. | 2011-08-02 | Paper |
| Iterative rounding and relaxation | 2011-05-16 | Paper |
| Improving integrality gaps via Chvátal-Gomory rounding | 2010-09-10 | Paper |
| Approximating the k-multicut problem | 2010-08-16 | Paper |
| Survivable network design with degree or order constraints | 2010-07-07 | Paper |
| Simpler analysis of LP extreme points for traveling salesman and survivable network design problems | 2010-06-08 | Paper |
| Iterative Rounding for Multi-Objective Optimization Problems | 2009-10-29 | Paper |
| Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs | 2009-03-12 | Paper |
| Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs | 2009-02-17 | Paper |
| Approximating minimum bounded degree spanning trees to within one of optimal | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302101 | 2009-01-05 | Paper |
| Survivable network design with degree or order constraints | 2009-01-05 | Paper |
| Edge Coloring and Decompositions of Weighted Graphs | 2008-11-25 | Paper |
| Degree Bounded Matroids and Submodular Flows | 2008-06-10 | Paper |
| On Two-Stage Stochastic Minimum Spanning Trees | 2007-08-30 | Paper |
| Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree | 2007-05-29 | Paper |
| On an extremal problem related to a theorem of Whitney | 2007-03-08 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
