#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2003

2017

- This year (0)
- Last 5 years (4)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sebastian Wernicke, Florian Rasche
- Bioinformatics
- 2006

SUMMARY
Motifs are small connected subnetworks that a network displays in significantly higher frequencies than would be expected for a random network. They have recently gathered much attention as aâ€¦ (More)

- Sebastian Wernicke
- IEEE/ACM Transactions on Computational Biologyâ€¦
- 2006

Motifs in a given network are small connected subnetworks that occur in significantly higher frequencies than would be expected in random networks. They have recently gathered much attention as aâ€¦ (More)

- Jiong Guo, Jens Gramm, Falk HÃ¼ffner, Rolf Niedermeier, Sebastian Wernicke
- J. Comput. Syst. Sci.
- 2006

We show that the NP-complete FEEDBACK VERTEX SET problem, which asks for the smallest set of vertices to remove from a graph to destroy all cycles, is deterministically solvable in O(ck Â· m) time.â€¦ (More)

- Sebastian Wernicke
- WABI
- 2005

Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful concept to uncoverâ€¦ (More)

- Falk HÃ¼ffner, Sebastian Wernicke, Thomas Zichner
- Algorithmica
- 2007

Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent on the actualâ€¦ (More)

- Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
- Networks
- 2010

We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are dual to each other:â€¦ (More)

- Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
- Theory of Computing Systems
- 2007

Important variants of theVERTEX COVER problem (among others, CONNECTED VERTEX COVER, CAPACITATED VERTEX COVER, and MAXIMUM PARTIAL VERTEX COVER) have been intensively studied in terms ofâ€¦ (More)

- Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
- WADS
- 2005

Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of approximability.â€¦ (More)

- Falk HÃ¼ffner, Sebastian Wernicke, Thomas Zichner
- APBC
- 2007

To identify linear signaling pathways, Scott et al. [R ECOMB, 2005] recently proposed to extract paths with high interaction probabilities from protein interact ion networks. They used an algorithmicâ€¦ (More)

SelbststÃ¤ndigkeitserklÃ¤rung Hiermit erklÃ¤re ich, dass ich die vorliegende Arbeit selbststÃ¤ndig und nur mit den angegebe-nen Hilfsmitteln angefertigt habe. Alle Stellen, die im Wortlaut oder dem Sinneâ€¦ (More)