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
D Knop, M Koutecký, T Masařík, T Toufar
International Workshop on Graph-Theoretic Concepts in Computer Science, 344-357, 2017
122017
Target set selection in dense graph classes
P Dvořák, D Knop, T Toufar
arXiv preprint arXiv:1610.07530, 2016
122016
Parameterized approximation schemes for steiner trees with small number of steiner vertices
P Dvořák, AE Feldmann, D Knop, T Masařík, T Toufar, P Veselý
arXiv preprint arXiv:1710.00668, 2017
112017
Parameterized complexity of fair deletion problems
T Masařík, T Toufar
Discrete Applied Mathematics 278, 51-61, 2020
82020
Parameterized complexity of fair vertex evaluation problems
D Knop, T Masařík, T Toufar
arXiv preprint arXiv:1803.06878, 2018
62018
Amalgam width of matroids
L Mach, T Toufar
International Symposium on Parameterized and Exact Computation, 268-280, 2013
22013
Parameterized complexity of fair deletion problems II
D Knop, T Masarík, T Toufar
CoRR abs/1803.06878, 2018
12018
Steiner Tree Heuristics for PACE 2018 Challenge Track C
R Hušek, T Toufar, D Knop, T Masařík, E Eiben
2018
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–9