Document Search Results

An improved parameterized algorithm for treewidth. (English) Zbl 07844610

Saha, Barna (ed.) et al., Proceedings of the 55th annual ACM SIGACT symposium on theory of computing, STOC ’23, Orlando, FL, USA, June 20–23, 2023. New York, NY: Association for Computing Machinery (ACM). 528-541 (2023).

MSC: 68Qxx

Cite Review PDF

Full Text: DOI arXiv

Magne, Loïc; Paul, Christophe; Sharma, Abhijat; Thilikos, Dimitrios M.

Edge-treewidth: algorithmic and combinatorial properties. (English) Zbl 1526.05131

Discrete Appl. Math. 341, 40-54 (2023).

MSC: 05C83 68Q17 05C05

Cite Review PDF

Full Text: DOI arXiv

Kanté, Mamadou M.; Paul, Christophe; Thilikos, Dimitrios M.

A linear fixed parameter tractable algorithm for connected pathwidth. (English) Zbl 1485.05172

SIAM J. Discrete Math. 36, No. 1, 411-435 (2022).

Reviewer: V. Yegnanarayanan (Chennai)

MSC: 05C85 05C70

Cite Review PDF

Full Text: DOI arXiv

Kanté, Mamadou Moustapha; Paul, Christophe; Thilikos, Dimitrios M.

A linear fixed parameter tractable algorithm for connected pathwidth. (English) Zbl 07651203

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 64, 16 p. (2020).

MSC: 68Wxx

Cite Review PDF

Full Text: DOI

Found 4 Documents (Results 1–4)

An improved parameterized algorithm for treewidth. (English) Zbl 07844610

Edge-treewidth: algorithmic and combinatorial properties. (English) Zbl 1526.05131

A linear fixed parameter tractable algorithm for connected pathwidth. (English) Zbl 1485.05172

A linear fixed parameter tractable algorithm for connected pathwidth. (English) Zbl 07651203

Filter Results by …

Document Type

Author

Serial

Year of Publication

Main Field