| Publication | Date of Publication | Type |
|---|
Coloring number and on-line Ramsey theory for graphs and hypergraphs
Combinatorica | 2022-06-29 | Paper |
On pleat rearrangements in pureland tessellations
Origami⁶ | 2022-05-24 | Paper |
Scale-free compact routing schemes in networks of low doubling dimension
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Optimal-stretch name-independent compact routing in doubling metrics
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
On the establishment of distinct identities in overlay networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| Optimal scale-free compact routing schemes in networks of low doubling dimension | 2014-12-18 | 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 |
Compact routing with slack in low doubling dimension
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Effective storage capacity of labeled graphs
Information and Computation | 2014-02-11 | Paper |
On the establishment of distinct identities in overlay networks
Distributed Computing | 2013-06-20 | Paper |
Randomized post-optimization of covering arrays
European Journal of Combinatorics | 2012-11-15 | Paper |
| Engineering label-constrained shortest-path algorithms | 2010-07-09 | Paper |
Folding a better checkerboard
Algorithms and Computation | 2009-12-17 | Paper |
Randomized postoptimization of covering arrays
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
Lecture Notes in Computer Science | 2008-11-20 | Paper |
On Sampling in Higher-Dimensional Peer-to-Peer Systems
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Engineering Label-Constrained Shortest-Path Algorithms
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Budget constrained minimum cost connected medians
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Robust optimization of contaminant sensor placement for community water systems
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Improved approximations for tour and tree covers
Algorithmica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2086247 (Why is no real title available?) | 2004-08-11 | Paper |
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 | 2004-01-29 | Paper |
| scientific article; zbMATH DE number 1947387 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1696540 (Why is no real title available?) | 2002-07-22 | Paper |
On approximating planar metrics by tree metrics.
Information Processing Letters | 2002-07-14 | Paper |
Approximation algorithms for the covering Steiner problem
Random Structures & Algorithms | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1757956 (Why is no real title available?) | 2002-06-20 | 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 |
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
Journal of Algorithms | 2000-11-05 | Paper |
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Theoretical Computer Science | 2000-06-04 | Paper |
| scientific article; zbMATH DE number 1445322 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1445328 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1445321 (Why is no real title available?) | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1303564 (Why is no real title available?) | 1999-06-17 | Paper |
