 | 2007 |
|---|
| 9 |       | Anand Srivastav,
Sören Werth:
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem.
FSTTCS 2007: 497-507 |
| 8 | | Ferdinando Cicalese,
Peter Damaschke,
Libertad Tansini,
Sören Werth:
Overlaps help: Improved bounds for group testing with interval queries.
Discrete Applied Mathematics 155(3): 288-299 (2007) |
| 7 | | Andreas Baltz,
Devdatt P. Dubhashi,
Anand Srivastav,
Libertad Tansini,
Sören Werth:
Probabilistic analysis for a multiple depot vehicle routing problem.
Random Struct. Algorithms 30(1-2): 206-225 (2007) |
| 2006 |
|---|
| 6 | | Benjamin Doerr,
Nils Hebbinghaus,
Sören Werth:
Improved Bounds and Schemes for the Declustering Problem
CoRR abs/cs/0603012: (2006) |
| 5 | | Benjamin Doerr,
Nils Hebbinghaus,
Sören Werth:
Improved bounds and schemes for the declustering problem.
Theor. Comput. Sci. 359(1-3): 123-132 (2006) |
| 2005 |
|---|
| 4 | | Ferdinando Cicalese,
Peter Damaschke,
Libertad Tansini,
Sören Werth:
Overlaps Help: Improved Bounds for Group Testing with Interval Queries.
COCOON 2005: 935-944 |
| 3 | | Andreas Baltz,
Devdatt P. Dubhashi,
Libertad Tansini,
Anand Srivastav,
Sören Werth:
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem.
FSTTCS 2005: 360-371 |
| 2004 |
|---|
| 2 | | Benjamin Doerr,
Nils Hebbinghaus,
Sören Werth:
Improved Bounds and Schemes for the Declustering Problem.
MFCS 2004: 760-771 |
| 1 | | Benjamin Doerr,
Nils Hebbinghaus,
Sören Werth:
An Improved Discrepancy Approach to Declustering.
Electronic Notes in Discrete Mathematics 17: 129-133 (2004) |
