Document Search Results

Parameterized complexity of fair deletion problems. (English) Zbl 1437.05227

Discrete Appl. Math. 278, 51-61 (2020).

MSC: 05C99 68Q27

Cite Review PDF

Full Text: DOI arXiv

Knop, Dušan; Masařík, Tomáš; Toufar, Tomáš

Parameterized complexity of fair vertex evaluation problems. (English) Zbl 1541.68292

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 33, 16 p. (2019).

MSC: 68R10 03B70 05C70 68Q27

Cite Review PDF

Full Text: DOI arXiv

Knop, Dušan; Koutecký, Martin; Masařík, Tomáš; Toufar, Tomáš

Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. (English) Zbl 1427.68125

Log. Methods Comput. Sci. 15, No. 4, Paper No. 12, 32 p. (2019).

MSC: 68Q25 03B16 68Q60 68R10

Cite Review PDF

Full Text: arXiv

Found 3 Documents (Results 1–3)

Parameterized complexity of fair deletion problems. (English) Zbl 1437.05227

Parameterized complexity of fair vertex evaluation problems. (English) Zbl 1541.68292

Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. (English) Zbl 1427.68125

Filter Results by …

Document Type

Author

Serial

Year of Publication

Main Field