| Publication | Date of Publication | Type |
|---|
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
A stochastic process on the hypercube with applications to peer-to-peer networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Increasing the power of association studies by imputation-based sparse tag SNP selection
Communications in Information and Systems | 2010-04-15 | Paper |
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
Automata, Languages and Programming | 2009-03-12 | Paper |
Asymmetric k -center is log * n -hard to approximate
Journal of the ACM | 2008-12-21 | Paper |
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
Computational Science – ICCS 2006 | 2008-12-09 | Paper |
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees
SIAM Journal on Computing | 2007-10-22 | Paper |
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences | 2006-01-10 | Paper |
The minimum-entropy set cover problem
Theoretical Computer Science | 2006-01-09 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Performance aspects of distributed caches using TTL-based consistency
Theoretical Computer Science | 2005-04-06 | Paper |
MAX CUT in cubic graphs
Journal of Algorithms | 2005-02-16 | Paper |
| scientific article; zbMATH DE number 2119758 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119704 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2079350 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2038708 (Why is no real title available?) | 2004-02-08 | Paper |
Reachability and Distance Queries via 2-Hop Labels
SIAM Journal on Computing | 2003-09-28 | Paper |
| Combinatorial approximation algorithms for the maximum directed cut problem | 2003-09-15 | Paper |
| scientific article; zbMATH DE number 1947055 (Why is no real title available?) | 2003-07-07 | Paper |
Coloring -colorable graphs using relatively small palettes
Journal of Algorithms | 2003-05-14 | Paper |
Approximation algorithms for MAX-4-SAT and rounding procedures for semidefinite programs
Journal of Algorithms | 2002-12-01 | Paper |
| Coloring \(k\)-colorable graphs using smaller palettes | 2002-10-24 | Paper |
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
SIAM Journal on Computing | 2002-09-29 | Paper |
| scientific article; zbMATH DE number 1762086 (Why is no real title available?) | 2002-07-01 | Paper |
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
Random Structures & Algorithms | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1754633 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1445320 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1342131 (Why is no real title available?) | 1999-09-22 | Paper |
Bipartite subgraphs of integer weighted graphs
Discrete Mathematics | 1998-04-01 | Paper |
