Follow
Tomáš Toufar
Tomáš Toufar
Computer Science Institute of Charles University
Verified email at iuuk.mff.cuni.cz - Homepage
Title
Cited by
Cited by
Year
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
T Toufar, T Masařík, M Koutecký, D Knop
Logical Methods in Computer Science 15, 2019
262019
Parameterized approximation schemes for steiner trees with small number of steiner vertices
P Dvorák, AE Feldmann, D Knop, T Masarík, T Toufar, P Vesely
SIAM Journal on Discrete Mathematics 35 (1), 546-574, 2021
212021
Target set selection in dense graph classes
P Dvořák, D Knop, T Toufar
arXiv preprint arXiv:1610.07530, 2016
152016
Parameterized complexity of fair deletion problems
T Masařík, T Toufar
Discrete Applied Mathematics 278, 51-61, 2020
132020
Parameterized complexity of fair vertex evaluation problems
D Knop, T Masařík, T Toufar
arXiv preprint arXiv:1803.06878, 2018
122018
Amalgam width of matroids
L Mach, T Toufar
International Symposium on Parameterized and Exact Computation, 268-280, 2013
22013
Steiner Tree Heuristics for PACE 2018 Challenge Track C
R Hušek, T Toufar, D Knop, T Masařík, E Eiben
12018
Parameterized complexity of fair deletion problems II
D Knop, T Masarík, T Toufar
CoRR abs/1803.06878, 2018
12018
Target Set Selection in Dense Graph Classes
P Dvořák, D Knop, T Toufar
SIAM Journal on Discrete Mathematics 36 (1), 536-572, 2022
2022
Algorithmic metatheorems for matroids
T Toufar
Univerzita Karlova, Matematicko-fyzikální fakulta, 2015
2015
The system can't perform the operation now. Try again later.
Articles 1–10