Volume 41; Issue 3

Theory of Computing Systems

Volume 41; Issue 3
1

Some Hard Problems on Matroid Spikes

Petr Hlineny
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 241 KB
english, 2007
2

Parameterized Complexity of Vertex Cover Variants

Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 276 KB
english, 2007
3

Dynamic Programming for Minimum Steiner Trees

B. Fuchs, W. Kern, D. Molle, S. Richter, P. Rossmanith, X. Wang
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 180 KB
english, 2007
4

Algorithms in the W-Hierarchy

Jonathan F. Buss, Tarique Islam
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 196 KB
english, 2007
6

A Faster FPT Algorithm for the Maximum Agreement Forest Problem

Michael Hallett, Catherine McCartin
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 246 KB
english, 2007
9

Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems

Faisal N. Abu-Khzam
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 160 KB
english, 2007
11

The Complexity of Polynomial-Time Approximation

Liming Cai, Michael Fellows, David Juedes, Frances Rosamond
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 253 KB
english, 2007
13

Foreword

Rod Downey, Guest Editor
Journal:
Theory of Computing Systems
Year:
2007
Language:
english
File:
PDF, 85 KB
english, 2007