| Publication | Date of Publication | Type |
|---|
| Improved approximations for extremal eigenvalues of sparse Hamiltonians | 2024-11-20 | Paper |
| Approximation algorithms for partial vertex covers in trees | 2024-06-13 | Paper |
| Unique games hardness of quantum max-cut, and a conjectured vector-valued Borell's inequality | 2024-05-14 | Paper |
| An explicit vector algorithm for high-girth MaxCut | 2024-05-14 | Paper |
| Synergies Between Operations Research and Quantum Information Science | 2024-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6058189 | 2023-10-31 | Paper |
| Probing a set of trajectories to maximize captured information | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875485 | 2023-02-03 | Paper |
| On small-depth tree augmentations | 2022-12-12 | Paper |
| Computing with Spikes: The Advantage of Fine-Grained Timing | 2021-10-12 | Paper |
| A Combinatorial Model for Dentate Gyrus Sparse Coding | 2019-06-06 | Paper |
| Geometric hitting set for segments of few orientations | 2018-04-12 | Paper |
| Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs | 2017-09-27 | Paper |
| The Approximability of Partial Vertex Covers in Trees | 2017-04-04 | Paper |
| Geometric hitting set for segments of few orientations | 2016-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934581 | 2014-12-18 | Paper |
| Compacting cuts | 2014-11-18 | Paper |
| Compacting cuts. A new linear formulation for minimum cut | 2014-11-18 | Paper |
| On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs | 2014-09-15 | Paper |
| Erratum to: ``Linear time algorithms for generalized edge dominating set problems | 2012-04-26 | Paper |
| Iterative Packing for Demand and Hypergraph Matching | 2011-06-24 | Paper |
| A unified approach to approximating partial covering problems | 2011-03-30 | Paper |
| Approximation algorithms for \(k\)-hurdle problems | 2011-03-02 | Paper |
| Path hitting in acyclic graphs | 2009-05-13 | Paper |
| Approximation algorithms for partially covering with edges | 2008-06-24 | Paper |
| Linear time algorithms for generalized edge dominating set problems | 2008-04-03 | Paper |
| A Unified Approach to Approximating Partial Covering Problems | 2008-03-11 | Paper |
| Path Hitting in Acyclic Graphs | 2008-03-11 | Paper |
| A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem | 2008-01-15 | Paper |
| Approximability of the capacitated \(b\)-edge dominating set problem | 2007-10-18 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| On factor width and symmetric \(H\)-matrices | 2005-08-01 | Paper |
| An approximation algorithm for the edge-dilation \(k\)-center problem. | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828945 | 2004-11-29 | Paper |
| Improved approximations for tour and tree covers | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046493 | 2004-08-12 | Paper |
| Forestation in hypergraphs: Linear \(k\)-trees | 2003-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411398 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753739 | 2002-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753930 | 2001-11-11 | Paper |
| A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem | 2001-01-01 | Paper |
