Tomáš Masařík
Tomáš Masařík
Simon Fraser University
Verified email at kam.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
Logical Methods in Computer Science 15 (4), 12:1-12:32, 2019
122019
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ý
35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 …, 2018
112018
Colouring (P_r+P_s)-Free Graphs
T Klimošová, J Malík, T Masařík, J Novotná, D Paulusma, V Slívová
Algorithmica 82 (7), 1833-1858, 2020
102020
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
44th International Symposium on Mathematical Foundations of Computer Science …, 2019
8*2019
On difference graphs and the local dimension of posets
J Kim, RR Martin, T Masařík, W Shull, HC Smith, A Uzzell, Z Wang
European Journal of Combinatorics 86, 103074:1-103074:13, 2020
72020
Notes on complexity of packing coloring
M Kim, B Lidický, T Masařík, F Pfender
Information Processing Letters 137, 6-10, 2018
72018
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
J Baste, MR Fellows, L Jaffke, T Masařík, MO Oliveira, G Philip, ...
29th International Joint Conference on Artificial Intelligence, IJCAI 2020 …, 2020
4*2020
Flexibility of planar graphs of girth at least six
Z Dvořák, T Masařík, J Musílek, O Pangrác
Journal of Graph Theory, 1-10, 2020
42020
Flexibility of triangle-free planar graphs
Z Dvořák, T Masařík, J Musílek, O Pangrác
arXiv preprint arXiv:1902.02971, 2019
42019
Duality Gap in Interval Linear Programming
J Novotná, M Hladík, T Masařík
Journal of Optimization Theory and Applications 184 (2), 565-580, 2020
32020
FPT Algorithms for Diverse Collections of Hitting Sets
J Baste, L Jaffke, T Masařík, G Philip, G Rote
Algorithms 12 (12), 254:1-254:18, 2019
32019
Flexibility of planar graphs without 4-cycles
T Masařík
Acta Mathematica Universitatis Comenianae 88 (3), 935-940, 2019
32019
Computational complexity of distance edge labeling
D Knop, T Masařík
Discrete Applied Mathematics 246, 80-98, 2018
22018
Anti-Path Cover on Sparse Graph Classes
P Dvořák, D Knop, T Masařík
11th Doctoral Workshop on Mathematical and Engineering Methods in Computer …, 2016
22016
Flexibility of Planar Graphs--Sharpening the Tools to Get Lists of Size Four
I Choi, FC Clemen, M Ferrara, P Horn, F Ma, T Masařík
arXiv preprint arXiv:2004.10917, 2020
12020
Optimal Discretization is Fixed-parameter Tractable
S Kratsch, T Masařík, I Muzi, M Pilipczuk, M Sorge
arXiv preprint arXiv:2003.02475, 2020
12020
U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited
J Kratochvíl, T Masařík, J Novotná
45th International Symposium on Mathematical Foundations of Computer Science …, 2020
12020
Jones' Conjecture in subcubic graphs
M Bonamy, F Dross, T Masařík, W Nadara, M Pilipczuk, M Pilipczuk
arXiv preprint arXiv:1912.01570, 2019
12019
Packing Directed Circuits Quarter-Integrally
T Masařík, I Muzi, M Pilipczuk, P Rzążewski, M Sorge
27th Annual European Symposium on Algorithms (ESA 2019) 144, 72:1-72:13, 2019
12019
The system can't perform the operation now. Try again later.
Articles 1–20