no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A bounded search tree algorithm for parameterized face cover
|
Abu-Khzam, Faisal N. |
|
2008 |
6 |
4 |
p. 541-552 12 p. |
article |
2 |
A fixed parameter algorithm for optimal convex partitions
|
Spillner, Andreas |
|
2008 |
6 |
4 |
p. 561-569 9 p. |
article |
3 |
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
|
Lozin, Vadim V. |
|
2008 |
6 |
4 |
p. 595-604 10 p. |
article |
4 |
Approximability of partitioning graphs with supply and demand
|
Ito, Takehiro |
|
2008 |
6 |
4 |
p. 627-650 24 p. |
article |
5 |
Approximating largest convex hulls for imprecise points
|
van Kreveld, Marc |
|
2008 |
6 |
4 |
p. 583-594 12 p. |
article |
6 |
A robust randomized algorithm to perform independent tasks
|
Chlebus, Bogdan S. |
|
2008 |
6 |
4 |
p. 651-665 15 p. |
article |
7 |
Editorial Board
|
|
|
2008 |
6 |
4 |
p. iii-iv nvt p. |
article |
8 |
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
|
Blin, Guillaume |
|
2008 |
6 |
4 |
p. 618-626 9 p. |
article |
9 |
On k-connectivity problems with sharpened triangle inequality
|
Böckenhauer, Hans-Joachim |
|
2008 |
6 |
4 |
p. 605-617 13 p. |
article |
10 |
Preface
|
Broersma, Hajo |
|
2008 |
6 |
4 |
p. 539- 1 p. |
article |
11 |
Semi-local longest common subsequences in subquadratic time
|
Tiskin, Alexander |
|
2008 |
6 |
4 |
p. 570-581 12 p. |
article |
12 |
Student-Project Allocation with preferences over Projects
|
Manlove, David F. |
|
2008 |
6 |
4 |
p. 553-560 8 p. |
article |