Tomáš Masařík
Tomáš Masařík
University of Warsaw
Verified email at - Homepage
Cited by
Cited by
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
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ý
SIAM Journal on Discrete Mathematics 35 (1), 546-574, 2021
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
Colouring -Free Graphs
T Klimošová, J Malík, T Masařík, J Novotná, D Paulusma, V Slívová
Algorithmica 82 (7), 1833-1858, 2020
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
Parameterized Complexity of Fair Deletion Problems
T Masařík, T Toufar
Discrete Applied Mathematics 278, 51-61, 2020
Parameterized Complexity of Fair Vertex Evaluation Problems
D Knop, T Masařík, T Toufar
44th International Symposium on Mathematical Foundations of Computer Science …, 2019
Notes on Complexity of Packing Coloring
M Kim, B Lidický, T Masařík, F Pfender
Information Processing Letters 137, 6-10, 2018
Flexibility of Triangle-Free Planar Graphs
Z Dvořák, T Masařík, J Musílek, O Pangrác
Journal of Graph Theory 96 (4), 619-641, 2021
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 95 (3), 457-466, 2020
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
Flexibility of Planar Graphs without 4-Cycles
T Masařík
Acta Mathematica Universitatis Comenianae 88 (3), 935-940, 2019
-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited
J Kratochvíl, T Masařík, J Novotná
Algorithmica, 1-32, 2021
Flexible List Colorings in Graphs with Special Degeneracy Conditions
P Bradshaw, T Masařík, L Stacho
31st International Symposium on Algorithms and Computation (ISAAC 2020), 2020
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
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
Packing Directed Circuits Quarter- and Half-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
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
Optimal Discretization is Fixed-Parameter Tractable
S Kratsch, T Masařík, I Muzi, M Pilipczuk, M Sorge
32nd ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021, 1702-1719, 2021
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
R Hušek, D Knop, T Masařík
15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020
The system can't perform the operation now. Try again later.
Articles 1–20