default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Wernicke 0001
Person information
- affiliation: Universität Jena, Germany
Other persons with the same name
- Sebastian Wernicke 0002
![[0000-0003-0799-2412]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-0799-2412")
— TU Dortmund University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j12]Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Fixed-parameter tractability results for full-degree spanning tree and its dual. Networks 56(2): 116-130 (2010)
2000 – 2009
- 2008
- [j11]Falk Hüffner, Sebastian Wernicke, Thomas Zichner:
Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection. Algorithmica 52(2): 114-132 (2008) - [j10]Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke:
Techniques for Practical Fixed-Parameter Algorithms. Comput. J. 51(1): 7-25 (2008) - [j9]Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Red-blue covering problems and the consecutive ones property. J. Discrete Algorithms 6(3): 393-407 (2008) - [j8]Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke:
Combinatorial network abstraction by trees and distances. Theor. Comput. Sci. 407(1-3): 1-20 (2008) - 2007
- [j7]Falk Hüffner, Sebastian Wernicke, Thomas Zichner:
FASPAD: fast signaling pathway detection. Bioinform. 23(13): 1708-1709 (2007) - [j6]Sebastian Wernicke, Florian Rasche:
Simple and fast alignment of metabolic pathways by exploiting local diversity. Bioinform. 23(15): 1978-1985 (2007) - [j5]Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Parameterized Complexity of Vertex Cover Variants. Theory Comput. Syst. 41(3): 501-520 (2007) - [c9]Falk Hüffner, Sebastian Wernicke, Thomas Zichner:
Algorithm Engineering for Color-Coding to Facilitate Signaling Pathway Detection. APBC 2007: 277-286 - [c8]Sebastian Wernicke, Florian Rasche:
Simple and Fast Alignment of Metabolic Pathways by Exploiting Local Diversity. APBC 2007: 353-362 - 2006
- [b1]Sebastian Wernicke:
Combinatorial algorithms to cope with the complexity of biological networks. Friedrich Schiller University of Jena, 2006, ISBN 978-3-89963-444-0, pp. 1-189 - [j4]Sebastian Wernicke, Florian Rasche:
FANMOD: a tool for fast network motif detection. Bioinform. 22(9): 1152-1153 (2006) - [j3]Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions. Int. J. Found. Comput. Sci. 17(6): 1467-1484 (2006) - [j2]Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke:
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8): 1386-1396 (2006) - [j1]Sebastian Wernicke:
Efficient Detection of Network Motifs. IEEE ACM Trans. Comput. Biol. Bioinform. 3(4): 347-359 (2006) - [c7]Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. IWPEC 2006: 203-214 - [c6]Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Minimum Membership Set Covering and the Consecutive Ones Property. SWAT 2006: 339-350 - 2005
- [c5]Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke:
Combinatorial Network Abstraction by Trees and Distances. ISAAC 2005: 1100-1109 - [c4]Sebastian Wernicke:
A Faster Algorithm for Detecting Network Motifs. WABI 2005: 165-177 - [c3]Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Parameterized Complexity of Generalized Vertex Cover Problems. WADS 2005: 36-48 - [c2]Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke:
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. WADS 2005: 158-168 - 2004
- [c1]Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Avoiding Forbidden Submatrices by Row Deletions. SOFSEM 2004: 349-360
Coauthor Index
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-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
