Found 7 Documents (Results 1–7)
Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. (English) Zbl 1462.68138
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).
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. (English) Zbl 1427.68125
Target set selection in dense graph classes. (English) Zbl 1533.68234
Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 18, 13 p. (2018).
Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. (English) Zbl 1487.68175
Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 26, 15 p. (2018).
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).
Filter Results by …
Document Type
- Journal Articles (3)
- Collection Articles (4)
all
top 5
Author
- Knop, Dušan (7)
- Toufar, Tomáš (7)
- Masařík, Tomáš (5)
- Dvořák, Pavel (4)
- Feldmann, Andreas Emil (2)
- Koutecký, Martin (2)
- Veselý, Pavel (2)
Serial
Software
- GitHub (1)
