Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity D Knop, M Koutecký, T Masařík, T Toufar Logical Methods in Computer Science 15, 2019 | 46 | 2019 |
Target set selection in dense graph classes P Dvořák, D Knop, T Toufar arXiv preprint arXiv:1610.07530, 2016 | 28* | 2016 |
Parameterized complexity of fair deletion problems T Masařík, T Toufar Discrete Applied Mathematics 278, 51-61, 2020 | 21 | 2020 |
Parameterized complexity of fair vertex evaluation problems D Knop, T Masařík, T Toufar arXiv preprint arXiv:1803.06878, 2018 | 18 | 2018 |
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 Veselý Leibniz International Proceedings in Informatics, LIPIcs 96, 26, 2018 | 17 | 2018 |
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 | 11 | 2021 |
Amalgam width of matroids L Mach, T Toufar Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013 | 5 | 2013 |
Parameterized complexity of fair deletion problems II D Knop, T Masarík, T Toufar CoRR abs/1803.06878, 2018 | 4 | 2018 |
Steiner Tree Heuristics for PACE 2018 Challenge Track C R Hušek, T Toufar, D Knop, T Masařík, E Eiben | 1 | 2018 |
29th International Symposium on Algorithms and Computation (ISAAC 2018) SH Teng, C Stein, A Björklund, T Klimosová, J Malík, T Masarík, J Novotná, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018 | | 2018 |
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) B Salvy, M Mahajan, D Pous, GJ Woeginger, A Adamaszek, A Antoniadis, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018 | | 2018 |
Algorithmic metatheorems for matroids T Toufar Univerzita Karlova, Matematicko-fyzikální fakulta, 2015 | | 2015 |