| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection
|
Hüffner, Falk
|
|
2007
|
52 |
2 |
p. 114-132
|
artikel
|
| 2 |
An Improved (and Practical) Parameterized Algorithm for the Individual Haplotyping Problem MFR with Mate-Pairs
|
Xie, Minzhu
|
|
2007
|
52 |
2 |
p. 250-266
|
artikel
|
| 3 |
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
|
Björklund, Andreas
|
|
2007
|
52 |
2 |
p. 226-249
|
artikel
|
| 4 |
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
|
Fellows, M. R.
|
|
2007
|
52 |
2 |
p. 167-176
|
artikel
|
| 5 |
Fixed-Parameter Complexity of Minimum Profile Problems
|
Gutin, Gregory
|
|
2007
|
52 |
2 |
p. 133-152
|
artikel
|
| 6 |
Foreword from the Guest Editors
|
Chen, Jianer
|
|
2007
|
52 |
2 |
p. 113
|
artikel
|
| 7 |
Improved Algorithms and Complexity Results for Power Domination in Graphs
|
Guo, Jiong
|
|
2007
|
52 |
2 |
p. 177-202
|
artikel
|
| 8 |
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
|
Fomin, Fedor V.
|
|
2007
|
52 |
2 |
p. 293-307
|
artikel
|
| 9 |
On the Parameterized Complexity of Layered Graph Drawing
|
Dujmović, Vida
|
|
2007
|
52 |
2 |
p. 267-292
|
artikel
|
| 10 |
Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles
|
Raman, Venkatesh
|
|
2007
|
52 |
2 |
p. 203-225
|
artikel
|
| 11 |
Solving Connected Dominating Set Faster than 2n
|
Fomin, Fedor V.
|
|
2007
|
52 |
2 |
p. 153-166
|
artikel
|
Tijdschrift beschrijving