Sebastian Wernicke

Affiliations:
  • Universität Jena, Germany


According to our database1, Sebastian Wernicke authored at least 19 papers between 2004 and 2010.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2010
Fixed-parameter tractability results for full-degree spanning tree and its dual.
Networks, 2010

2008
Combinatorial network abstraction by trees and distances.
Theor. Comput. Sci., 2008

Red-blue covering problems and the consecutive ones property.
J. Discrete Algorithms, 2008

Techniques for Practical Fixed-Parameter Algorithms.
Comput. J., 2008

Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection.
Algorithmica, 2008

2007
Parameterized Complexity of Vertex Cover Variants.
Theory Comput. Syst., 2007

Simple and fast alignment of metabolic pathways by exploiting local diversity.
Bioinform., 2007

FASPAD: fast signaling pathway detection.
Bioinform., 2007

Algorithm Engineering for Color-Coding to Facilitate Signaling Pathway Detection.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006
Combinatorial algorithms to cope with the complexity of biological networks.
PhD thesis, 2006

Efficient Detection of Network Motifs.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization.
J. Comput. Syst. Sci., 2006

The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions.
Int. J. Found. Comput. Sci., 2006

FANMOD: a tool for fast network motif detection.
Bioinform., 2006

Minimum Membership Set Covering and the Consecutive Ones Property.
Proceedings of the Algorithm Theory, 2006

2005
Parameterized Complexity of Generalized Vertex Cover Problems.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

A Faster Algorithm for Detecting Network Motifs.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

2004
Avoiding Forbidden Submatrices by Row Deletions.
Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004


  Loading...