Burton, Benjamin A.; Ozlen, Melih A tree traversal algorithm for decision problems in knot theory and 3-manifold topology. (English) Zbl 1270.57060 Algorithmica 65, No. 4, 772-801 (2013). MSC: 57N10 52B55 90C05 57N35 PDF BibTeX XML Cite \textit{B. A. Burton} and \textit{M. Ozlen}, Algorithmica 65, No. 4, 772--801 (2013; Zbl 1270.57060) Full Text: DOI arXiv
Calabro, Chris; Impagliazzo, Russell; Paturi, Ramamohan On the exact complexity of evaluating quantified \(k\)-cnf. (English) Zbl 1262.68047 Algorithmica 65, No. 4, 817-827 (2013). MSC: 68Q25 68Q15 PDF BibTeX XML Cite \textit{C. Calabro} et al., Algorithmica 65, No. 4, 817--827 (2013; Zbl 1262.68047) Full Text: DOI
Praveen, M. Small vertex cover makes Petri net coverability and boundedness easier. (English) Zbl 1410.68258 Algorithmica 65, No. 4, 713-753 (2013). MSC: 68Q85 05C70 68Q17 68Q25 68Q60 PDF BibTeX XML Cite \textit{M. Praveen}, Algorithmica 65, No. 4, 713--753 (2013; Zbl 1410.68258) Full Text: DOI
van ’t Hof, Pim; Villanger, Yngve Proper interval vertex deletion. (English) Zbl 1262.68052 Algorithmica 65, No. 4, 845-867 (2013). MSC: 68Q25 05C85 PDF BibTeX XML Cite \textit{P. van 't Hof} and \textit{Y. Villanger}, Algorithmica 65, No. 4, 845--867 (2013; Zbl 1262.68052) Full Text: DOI
Hermelin, Danny; Huang, Chien-Chung; Kratsch, Stefan; Wahlström, Magnus Parameterized two-player Nash equilibrium. (English) Zbl 1272.68142 Algorithmica 65, No. 4, 802-816 (2013). MSC: 68Q17 91A05 PDF BibTeX XML Cite \textit{D. Hermelin} et al., Algorithmica 65, No. 4, 802--816 (2013; Zbl 1272.68142) Full Text: DOI
Guillemot, Sylvain; Havet, Frédéric; Paul, Christophe; Perez, Anthony On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems. (English) Zbl 1262.68048 Algorithmica 65, No. 4, 900-926 (2013). MSC: 68Q25 90C35 05C85 PDF BibTeX XML Cite \textit{S. Guillemot} et al., Algorithmica 65, No. 4, 900--926 (2013; Zbl 1262.68048) Full Text: DOI
Havet, Frédéric; Sampaio, Leonardo On the Grundy and \(b\)-chromatic numbers of a graph. (English) Zbl 1263.05030 Algorithmica 65, No. 4, 885-899 (2013). MSC: 05C15 68Q17 PDF BibTeX XML Cite \textit{F. Havet} and \textit{L. Sampaio}, Algorithmica 65, No. 4, 885--899 (2013; Zbl 1263.05030) Full Text: DOI
Guillemot, Sylvain; Sikora, Florian Finding and counting vertex-colored subtrees. (English) Zbl 1263.05029 Algorithmica 65, No. 4, 828-844 (2013). MSC: 05C15 05C60 05C90 68R10 68Q17 PDF BibTeX XML Cite \textit{S. Guillemot} and \textit{F. Sikora}, Algorithmica 65, No. 4, 828--844 (2013; Zbl 1263.05029) Full Text: DOI
Kratsch, Stefan; Neumann, Frank Fixed-parameter evolutionary algorithms and the vertex cover problem. (English) Zbl 1262.68180 Algorithmica 65, No. 4, 754-771 (2013). MSC: 68W05 68T20 68W20 PDF BibTeX XML Cite \textit{S. Kratsch} and \textit{F. Neumann}, Algorithmica 65, No. 4, 754--771 (2013; Zbl 1262.68180) Full Text: DOI
Nederlof, Jesper Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems. (English) Zbl 1272.68148 Algorithmica 65, No. 4, 868-884 (2013). MSC: 68Q17 05C85 68R10 PDF BibTeX XML Cite \textit{J. Nederlof}, Algorithmica 65, No. 4, 868--884 (2013; Zbl 1272.68148) Full Text: DOI
Raman, Venkatesh (ed.); Saurabh, Saket (ed.) Special issue: Parameterized and exact computation, Part II. Selected and extended papers based on the presentations at the international symposium IPEC 2010, Chennai, India, December 13–15, 2010. (English) Zbl 1275.68028 Algorithmica 65, No. 4, 711-926 (2013). MSC: 68-06 00B25 PDF BibTeX XML Cite \textit{V. Raman} (ed.) and \textit{S. Saurabh} (ed.), Algorithmica 65, No. 4, 711--926 (2013; Zbl 1275.68028)