Works matching IS 14324350 AND DT 2007 AND VI 41 AND IP 3

Results: 13

Parameterized Complexity of Vertex Cover Variants.

Published in:

Theory of Computing Systems, 2007, v. 41, n. 3, p. 501, doi. 10.1007/s00224-007-1309-3

By:

Jiong Guo;
Niedermeier, Rolf;
Wernicke, Sebastian

Publication type:

Article

Dynamic Programming for Minimum Steiner Trees.

Published in:

Theory of Computing Systems, 2007, v. 41, n. 3, p. 493, doi. 10.1007/s00224-007-1324-4

By:

Fuchs, B.;
Kern, W.;
Molle, D.;
Richter, S.;
Rossmanith, P.;
Wang, X.

Publication type:

Article

Some Hard Problems on Matroid Spikes.

Published in:

Theory of Computing Systems, 2007, v. 41, n. 3, p. 551, doi. 10.1007/s00224-007-1307-5

By:

Hlineny, Petr

Publication type:

Article

Algorithms in the W-Hierarchy.

Published in:

Theory of Computing Systems, 2007, v. 41, n. 3, p. 445, doi. 10.1007/s00224-007-1325-3

By:

Buss, Jonathan F.;
Islam, Tarique

Publication type:

Article

Crown Structures for Vertex Cover Kernelization.

Published in:

Theory of Computing Systems, 2007, v. 41, n. 3, p. 411, doi. 10.1007/s00224-007-1328-0

By:

Abu-Khzam, Faisal N.;
Fellows, Michael R.;
Langston, Michael A.;
Suters, W. Henry

Publication type:

Article

A Faster FPT Algorithm for the Maximum Agreement Forest Problem.

Published in:

Theory of Computing Systems, 2007, v. 41, n. 3, p. 539, doi. 10.1007/s00224-007-1329-z

By:

Hallett, Michael;
McCartin, Catherine

Publication type:

Article

The Linear Arrangement Problem Parameterized Above Guaranteed Value.

Published in:

Theory of Computing Systems, 2007, v. 41, n. 3, p. 521, doi. 10.1007/s00224-007-1330-6

By:

Gutin, Gregory;
Rafiey, Arash;
Szeider, Stefan;
Yeo, Anders

Publication type:

Article

Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques.

Published in:

Theory of Computing Systems, 2007, v. 41, n. 3, p. 563, doi. 10.1007/s00224-007-1334-2

By:

Raman, Venkatesh;
Saurabh, Saket;
Sikdar, Somnath

Publication type:

Article

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

Published in:

Theory of Computing Systems, 2007, v. 41, n. 3, p. 399, doi. 10.1007/s00224-007-1344-0

By:

Abu-Khzam, Faisal N.

Publication type:

Article

An O(2<sup>O(k)</sup>n<sup>3</sup>) FPT Algorithm for the Undirected Feedback Vertex Set Problem.

Published in:

Theory of Computing Systems, 2007, v. 41, n. 3, p. 479, doi. 10.1007/s00224-007-1345-z

By:

Dehne, Frank;
Fellows, Michael;
Langston, Michael;
Rosamond, Frances;
Stevens, Kim

Publication type:

Article

The Complexity of Polynomial-Time Approximation.

Published in:

Theory of Computing Systems, 2007, v. 41, n. 3, p. 459, doi. 10.1007/s00224-007-1346-y

By:

Cai, Liming;
Fellows, Michael;
Juedes, David;
Rosamond, Frances

Publication type:

Article

The Parameterized Approximability of TSP with Deadlines.

Published in:

Theory of Computing Systems, 2007, v. 41, n. 3, p. 431, doi. 10.1007/s00224-007-1347-x

By:

Bockenhauer, Hans-Joachim;
Hromkovic, Juraj;
Kneis, Joachim;
Kupke, Joachim

Publication type:

Article

Foreword.

Published in:

2007

By:

DOWNEY, ROD

Publication type:

Editorial