Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Werth, S{\"o}ren"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Probabilistic analysis of the degree bounded minimum spanning tree problem
Anand Srivastav
,
Sören Werth
Lecture Notes in Computer Science
4855
, 2007, pp. 497-507
Improved bounds and schemes for the declustering problem
Benjamin Doerr
,
Nils Hebbinghaus
,
Sören Werth
Theoretical Computer Science
359
(1-3), 2006, pp. 123-132
Probabilistic analysis for a multiple depot vehicle routing problem
Andreas Baltz
,
Devdatt Dubhashi
,
Libertad Tansini
,
Anand Srivastav
,
Sören Werth
Lecture Notes in Computer Science
3821
, 2005, pp. 360-371
Overlaps help: Improved bounds for group testing with interval queries
Ferdinando Cicalese
,
Peter Damaschke
,
Libertad Tansini
,
Sören Werth
Lecture Notes in Computer Science
3595
, 2005, pp. 935-944
Improved bounds and schemes for the declustering problem
Benjamin Doerr
,
Nils Hebbinghaus
,
Sören Werth
Lecture Notes in Computer Science
3153
, 2004, pp. 760-771