| Publication | Date of Publication | Type |
|---|
| Coloring number and on-line Ramsey theory for graphs and hypergraphs | 2022-06-29 | Paper |
| On pleat rearrangements in pureland tessellations | 2022-05-24 | Paper |
| Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension | 2018-11-05 | Paper |
| On the establishment of distinct identities in overlay networks | 2015-03-10 | Paper |
| Optimal-stretch name-independent compact routing in doubling metrics | 2015-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934581 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934685 | 2014-12-18 | Paper |
| Compacting cuts. A new linear formulation for minimum cut | 2014-11-18 | Paper |
| Compact routing with slack in low doubling dimension | 2014-03-13 | Paper |
| Effective storage capacity of labeled graphs | 2014-02-11 | Paper |
| On the establishment of distinct identities in overlay networks | 2013-06-20 | Paper |
| Randomized post-optimization of covering arrays | 2012-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574272 | 2010-07-09 | Paper |
| Folding a Better Checkerboard | 2009-12-17 | Paper |
| Randomized Postoptimization of Covering Arrays | 2009-12-11 | Paper |
| Dynamic Routing and Location Services in Metrics of Low Doubling Dimension | 2008-11-20 | Paper |
| On Sampling in Higher-Dimensional Peer-to-Peer Systems | 2008-09-18 | Paper |
| Engineering Label-Constrained Shortest-Path Algorithms | 2008-07-10 | Paper |
| A Tight Lower Bound for the Steiner Point Removal Problem on Trees | 2007-08-28 | Paper |
| Budget constrained minimum cost connected medians | 2007-04-26 | Paper |
| Robust optimization of contaminant sensor placement for community water systems | 2006-06-14 | Paper |
| Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty | 2005-08-17 | Paper |
| Improved approximations for tour and tree covers | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044346 | 2004-08-11 | Paper |
| Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems | 2004-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411352 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766688 | 2002-07-22 | Paper |
| On approximating planar metrics by tree metrics. | 2002-07-14 | Paper |
| Approximation algorithms for the covering Steiner problem | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537744 | 2002-06-20 | 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 |
| A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem | 2000-11-05 | Paper |
| Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952637 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952645 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952636 | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250189 | 1999-06-17 | Paper |
