| 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
International Journal of Foundations of Computer Science | 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
INFORMS Journal on Computing | 2024-02-28 | Paper |
scientific article; zbMATH DE number 7758361 (Why is no real title available?)
| 2023-10-31 | Paper |
Probing a set of trajectories to maximize captured information
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650098 (Why is no real title available?)
| 2023-02-03 | Paper |
On small-depth tree augmentations
Operations Research Letters | 2022-12-12 | Paper |
Computing with spikes: the advantage of fine-grained timing
Neural Computation | 2021-10-12 | Paper |
A combinatorial model for dentate gyrus sparse coding
Neural Computation | 2019-06-06 | Paper |
Geometric hitting set for segments of few orientations
Theory of Computing Systems | 2018-04-12 | Paper |
Partial vertex cover and budgeted maximum coverage in bipartite graphs
SIAM Journal on Discrete Mathematics | 2017-09-27 | Paper |
The approximability of partial vertex covers in trees
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Geometric hitting set for segments of few orientations
Lecture Notes in Computer Science | 2016-02-26 | Paper |
Compacting cuts, a new linear formulation for minimum cut
| 2014-12-18 | Paper |
Compacting cuts. A new linear formulation for minimum cut
ACM Transactions on Algorithms | 2014-11-18 | Paper |
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Erratum to: ``Linear time algorithms for generalized edge dominating set problems
Algorithmica | 2012-04-26 | Paper |
Iterative packing for demand and hypergraph matching
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
A unified approach to approximating partial covering problems
Algorithmica | 2011-03-30 | Paper |
Approximation algorithms for \(k\)-hurdle problems
Algorithmica | 2011-03-02 | Paper |
Path hitting in acyclic graphs
Algorithmica | 2009-05-13 | Paper |
Approximation algorithms for partially covering with edges
Theoretical Computer Science | 2008-06-24 | Paper |
Linear time algorithms for generalized edge dominating set problems
Algorithmica | 2008-04-03 | Paper |
A Unified Approach to Approximating Partial Covering Problems
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Path Hitting in Acyclic Graphs
Lecture Notes in Computer Science | 2008-03-11 | Paper |
A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem
Operations Research Letters | 2008-01-15 | Paper |
Approximability of the capacitated \(b\)-edge dominating set problem
Theoretical Computer Science | 2007-10-18 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
On factor width and symmetric \(H\)-matrices
Linear Algebra and its Applications | 2005-08-01 | Paper |
An approximation algorithm for the edge-dilation \(k\)-center problem.
Operations Research Letters | 2005-01-11 | Paper |
scientific article; zbMATH DE number 2119674 (Why is no real title available?)
| 2004-11-29 | Paper |
Improved approximations for tour and tree covers
Algorithmica | 2004-09-22 | Paper |
scientific article; zbMATH DE number 2089224 (Why is no real title available?)
| 2004-08-12 | Paper |
Forestation in hypergraphs: Linear \(k\)-trees
The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
scientific article; zbMATH DE number 1947429 (Why is no real title available?)
| 2003-07-08 | Paper |
scientific article; zbMATH DE number 1670541 (Why is no real title available?)
| 2002-01-06 | Paper |
scientific article; zbMATH DE number 1670653 (Why is no real title available?)
| 2001-11-11 | Paper |
A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem
Journal of Combinatorial Optimization | 2001-01-01 | Paper |
