| Publication | Date of Publication | Type |
|---|
| A constant-factor approximation for weighted bond cover | 2025-01-27 | Paper |
| Fitting metrics and ultrametrics with minimum disagreements | 2025-01-23 | Paper |
| A PTAS for \(\ell_0\)-low rank approximation: solving dense CSPs over reals | 2024-11-28 | Paper |
| Matroid-based TSP rounding for half-integral solutions | 2024-08-20 | Paper |
| Johnson coverage hypothesis: inapproximability of \(k\)-means and \(k\)-median in \(\ell_p\)-metrics | 2024-07-19 | Paper |
| Improved approximation algorithms and lower bounds for search-diversification problems | 2024-06-24 | Paper |
| Breaching the 2 LMP approximation barrier for facility location with applications to \(k\)-median | 2024-05-14 | Paper |
| A local search-based approach for set covering | 2024-05-14 | Paper |
| On the fine-grained complexity of approximating \(k\)-center in sparse graphs | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126248 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147253 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147414 | 2024-01-15 | Paper |
| A characterization of approximability for biased CSPs | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090877 | 2023-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065472 | 2023-11-14 | Paper |
| A framework for quadratic form maximization over convex sets through nonconvex relaxations | 2023-11-14 | Paper |
| Maximum Matching in the Online Batch-arrival Model | 2023-04-26 | Paper |
| Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms | 2023-04-04 | Paper |
| Strong hardness of approximation for tree transversals | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875460 | 2023-02-03 | Paper |
| Matroid-based TSP rounding for half-integral solutions | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091192 | 2022-07-21 | Paper |
| Optimal Bounds for the k -cut Problem | 2022-03-31 | Paper |
| On some variants of Euclidean \(k\)-supplier | 2022-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009622 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002634 | 2021-07-28 | Paper |
| Global and fixed-terminal cuts in digraphs | 2021-07-28 | Paper |
| The Karger-Stein algorithm is optimal for k-cut | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136324 | 2020-11-25 | Paper |
| Improved Hardness for Cut, Interdiction, and Firefighter Problems | 2020-05-27 | Paper |
| The number of minimum k -cuts: improving the Karger-Stein bound | 2020-01-30 | Paper |
| A PTAS for ℓp-Low Rank Approximation | 2019-10-15 | Paper |
| Losing Treewidth by Separating Subsets | 2019-10-15 | Paper |
| Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness | 2019-10-15 | Paper |
| Partitioning a graph into small pieces with applications to path transversal | 2019-08-06 | Paper |
| Beating the 2-approximation factor for global bicut | 2019-08-06 | Paper |
| Clustering Affine Subspaces: Hardness and Algorithms | 2019-05-15 | Paper |
| Strong inapproximability results on balanced rainbow-colorable hypergraphs | 2019-02-01 | Paper |
| LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes | 2018-09-14 | Paper |
| Partitioning a Graph into Small Pieces with Applications to Path Transversal | 2018-07-16 | Paper |
| Nearly Optimal NP-Hardness of Unique Coverage | 2018-07-16 | Paper |
| Approximating Operator Norms via Generalized Krivine Rounding | 2018-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608074 | 2018-03-15 | Paper |
| APX-hardness of maximizing Nash social welfare with indivisible items | 2017-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368904 | 2017-10-11 | Paper |
| LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes | 2017-10-05 | Paper |
| Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs | 2017-10-05 | Paper |
| Minimum Birkhoff-von Neumann decomposition | 2017-08-31 | Paper |
| Inapproximability of H-Transversal/Packing | 2017-08-31 | Paper |
| Approximate Hypergraph Coloring under Low-discrepancy and Related Promises | 2017-08-31 | Paper |
| Maximum matching in the online batch-arrival model | 2017-08-31 | Paper |
| Towards a Characterization of Approximation Resistance for Symmetric CSPs | 2017-08-31 | Paper |
| Inapproximability of $H$-Transversal/Packing | 2017-08-14 | Paper |
| Nearly Optimal NP-Hardness of Unique Coverage | 2017-06-28 | Paper |
| Complexity of approximating CSP with balance / hard constraints | 2017-05-19 | Paper |
| Complexity of approximating CSP with balance/hard constraints | 2016-09-21 | Paper |
| Simple proof of hardness of feedback vertex set | 2016-08-22 | Paper |
| Hardness of Graph Pricing Through Generalized Max-Dicut | 2015-08-21 | Paper |
