Tomás Toufar

12 papers B 3C 1Journal 8
YearRankTypeTitle / Venue / Authors
2022 J jnl
Target Set Selection in Dense Graph Classes.
SIAM J. Discret. Math.
Pavel Dvorák, Dusan Knop, Tomás Toufar
2021 J jnl
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.
SIAM J. Discret. Math.
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
2020 J jnl
Parameterized complexity of fair deletion problems.
Discret. Appl. Math.
Tomás Masarík, Tomás Toufar
2019 B conf
Parameterized Complexity of Fair Vertex Evaluation Problems.
MFCS
Dusan Knop, Tomás Masarík, Tomás Toufar
2019 J jnl
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.
Log. Methods Comput. Sci.
Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
2018 J jnl
Parameterized complexity of fair deletion problems II.
CoRR
Dusan Knop, Tomás Masarík, Tomás Toufar
2018 B conf
Target Set Selection in Dense Graph Classes.
ISAAC
Pavel Dvorák, Dusan Knop, Tomás Toufar
2017 J jnl
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.
CoRR
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
2017 C conf
Parameterized Complexity of Fair Deletion Problems.
TAMC
Tomás Masarík, Tomás Toufar
2017 B conf
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.
WG
Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
2017 J jnl
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.
CoRR
Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
2016 J jnl
Target Set Selection in Dense Graph Classes.
CoRR
Pavel Dvorák, Dusan Knop, Tomás Toufar