![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Sören Werth
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Beate Gericke, Finn Degner, Tom Hüttmann, Sören Werth, Carsten Fortmann-Grote:
Performance Review of Retraining and Transfer Learning of DeLTA2 for Image Segmentation for Pseudomonas Fluorescens SBW25. BIOSTEC (1) 2024: 273-280 - 2020
- [c6]Michael Pilgermann, Sören Werth, Reiner Creutzburg
:
Towards sector specific security operation. MOBMU 2020: 1-10
2000 – 2009
- 2007
- [j4]Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth:
Overlaps help: Improved bounds for group testing with interval queries. Discret. Appl. Math. 155(3): 288-299 (2007) - [j3]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) - [c5]Anand Srivastav, Sören Werth:
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. FSTTCS 2007: 497-507 - 2006
- [b1]Sören Werth:
Probabilistic analysis of euclidean multi depot vehicle routing and related problems. Kiel University, Germany, 2006 - [j2]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved bounds and schemes for the declustering problem. Theor. Comput. Sci. 359(1-3): 123-132 (2006) - [i1]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved Bounds and Schemes for the Declustering Problem. CoRR abs/cs/0603012 (2006) - 2005
- [c4]Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth:
Overlaps Help: Improved Bounds for Group Testing with Interval Queries. COCOON 2005: 935-944 - [c3]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
- [j1]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
An Improved Discrepancy Approach to Declustering. Electron. Notes Discret. Math. 17: 129-133 (2004) - [c2]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
An Improved Discrepancy Approach to Declustering. CTW 2004: 114-118 - [c1]Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved Bounds and Schemes for the Declustering Problem. MFCS 2004: 760-771
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint