Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim The parameterized approximability of TSP with deadlines. (English) Zbl 1148.68052 Theory Comput. Syst. 41, No. 3, 431-444 (2007). MSC: 68W25 68W05 90C35 90C59 PDF BibTeX XML Cite \textit{H.-J. Böckenhauer} et al., Theory Comput. Syst. 41, No. 3, 431--444 (2007; Zbl 1148.68052) Full Text: DOI
Cai, Liming; Fellows, Michael; Juedes, David; Rosamond, Frances The complexity of polynomial-time approximation. (English) Zbl 1202.68481 Theory Comput. Syst. 41, No. 3, 459-477 (2007). MSC: 68W25 68Q15 68Q25 PDF BibTeX XML Cite \textit{L. Cai} et al., Theory Comput. Syst. 41, No. 3, 459--477 (2007; Zbl 1202.68481) Full Text: DOI
Dehne, Frank; Fellows, Michael; Langston, Michael; Rosamond, Frances; Stevens, Kim An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem. (English) Zbl 1148.68037 Theory Comput. Syst. 41, No. 3, 479-492 (2007). MSC: 68R10 05C85 68Q25 68W05 PDF BibTeX XML Cite \textit{F. Dehne} et al., Theory Comput. Syst. 41, No. 3, 479--492 (2007; Zbl 1148.68037) Full Text: DOI
Abu-Khzam, Faisal N. Pseudo-kernelization: A branch-then-Reduce approach for FPT problems. (English) Zbl 1147.68528 Theory Comput. Syst. 41, No. 3, 399-410 (2007). MSC: 68Q17 68W05 PDF BibTeX XML Cite \textit{F. N. Abu-Khzam}, Theory Comput. Syst. 41, No. 3, 399--410 (2007; Zbl 1147.68528) Full Text: DOI
Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath Efficient exact algorithms through enumerating maximal independent sets and other techniques. (English) Zbl 1148.68054 Theory Comput. Syst. 41, No. 3, 563-587 (2007). MSC: 68W40 PDF BibTeX XML Cite \textit{V. Raman} et al., Theory Comput. Syst. 41, No. 3, 563--587 (2007; Zbl 1148.68054) Full Text: DOI
Gutin, Gregory; Rafiey, Arash; Szeider, Stefan; Yeo, Anders The linear arrangement problem parameterized above guaranteed value. (English) Zbl 1148.68039 Theory Comput. Syst. 41, No. 3, 521-538 (2007); corrigendum ibid. 53, No. 4, 690-691 (2013). MSC: 68R10 05C78 05C85 68Q25 68W05 PDF BibTeX XML Cite \textit{G. Gutin} et al., Theory Comput. Syst. 41, No. 3, 521--538 (2007; Zbl 1148.68039) Full Text: DOI
Hallett, Michael; McCartin, Catherine A faster FPT algorithm for the maximum agreement forest problem. (English) Zbl 1148.68049 Theory Comput. Syst. 41, No. 3, 539-550 (2007). MSC: 68W05 05C05 05C85 68Q25 68R10 92D15 PDF BibTeX XML Cite \textit{M. Hallett} and \textit{C. McCartin}, Theory Comput. Syst. 41, No. 3, 539--550 (2007; Zbl 1148.68049) Full Text: DOI
Abu-Khzam, Faisal N.; Fellows, Michael R.; Langston, Michael A.; Suters, W. Henry Crown structures for vertex cover kernelization. (English) Zbl 1148.68035 Theory Comput. Syst. 41, No. 3, 411-430 (2007). MSC: 68R10 05C70 05C85 68Q25 68W05 PDF BibTeX XML Cite \textit{F. N. Abu-Khzam} et al., Theory Comput. Syst. 41, No. 3, 411--430 (2007; Zbl 1148.68035) Full Text: DOI
Buss, Jonathan F.; Islam, Tarique Algorithms in the W-hierarchy. (English) Zbl 1148.68022 Theory Comput. Syst. 41, No. 3, 445-457 (2007). MSC: 68Q15 68Q05 68W05 PDF BibTeX XML Cite \textit{J. F. Buss} and \textit{T. Islam}, Theory Comput. Syst. 41, No. 3, 445--457 (2007; Zbl 1148.68022) Full Text: DOI
Fuchs, B.; Kern, W.; Molle, D.; Richter, S.; Rossmanith, P.; Wang, X. Dynamic programming for minimum Steiner trees. (English) Zbl 1148.68038 Theory Comput. Syst. 41, No. 3, 493-500 (2007). MSC: 68R10 68W25 90C39 PDF BibTeX XML Cite \textit{B. Fuchs} et al., Theory Comput. Syst. 41, No. 3, 493--500 (2007; Zbl 1148.68038) Full Text: DOI
Guo, Jiong; Niedermeier, Rolf; Wernicke, Sebastian Parameterized complexity of Vertex Cover variants. (English) Zbl 1147.68607 Theory Comput. Syst. 41, No. 3, 501-520 (2007). MSC: 68R10 PDF BibTeX XML Cite \textit{J. Guo} et al., Theory Comput. Syst. 41, No. 3, 501--520 (2007; Zbl 1147.68607) Full Text: DOI
Hliněný, Petr Some hard problems on matroid spikes. (English) Zbl 1126.05030 Theory Comput. Syst. 41, No. 3, 551-562 (2007). MSC: 05B35 68Q17 PDF BibTeX XML Cite \textit{P. Hliněný}, Theory Comput. Syst. 41, No. 3, 551--562 (2007; Zbl 1126.05030) Full Text: DOI
Downey, Rod (ed.) Special issue: Fixed-parameter tractability. Selected papers based on the presentations at the seminar ‘Exact algorithms and fixed-parameter tractability’, Dagstuhl, Germany, July 2005. (English) Zbl 1141.68313 Theory Comput. Syst. 41, No. 3, 397-587 (2007). MSC: 68-06 90-06 00B25 PDF BibTeX XML Cite \textit{R. Downey} (ed.), Theory Comput. Syst. 41, No. 3, 397--587 (2007; Zbl 1141.68313)