×

Found 3 Documents (Results 1–3)

Newest Citations Relevance
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 1484.68072

Bodlaender, Hans L. (ed.) et al., Graph-theoretic concepts in computer science. 43rd international workshop, WG 2017, Eindhoven, The Netherlands, June 21–23, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10520, 344-357 (2017).
MSC:  68Q25 03B16 68Q60 68R10
Cite Review PDF
Full Text: DOI arXiv

Filter Results by …

Document Type

Author

Year of Publication

Main Field