Tomáš Masařík

Most-cited papers

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
Julien Baste, M. Fellows, Lars Jaffke, Tomáš Masařík +3 more
2019International Joint Conference on Artificial Intelligence73 citations Open access
Semantic Scholar
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
D. Knop, Martin Koutecký, Tomáš Masařík, T. Toufar
2017International Workshop on Graph-Theoretic Concepts in Computer Science44 citations Open access
Semantic Scholar
FPT Algorithms for Diverse Collections of Hitting Sets
Julien Baste, Lars Jaffke, Tomáš Masařík, Geevarghese Philip +1 more
2019Algorithms33 citations Open access
Semantic Scholar
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
Peter Gartland, D. Lokshtanov, Tomáš Masařík, M. Pilipczuk +2 more
2023Symposium on the Theory of Computing27 citations Open access
Semantic Scholar
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
Pavel Dvořák, Andreas Emil Feldmann, D. Knop, Tomáš Masařík +2 more
2017Symposium on Theoretical Aspects of Computer Science24 citations
Semantic Scholar
Colouring $(P_r+P_s)$-Free Graphs
Tereza Klimošová, J. Malík, Tomáš Masařík, Jana Novotná +2 more
201821 citations
Semantic Scholar
Parameterized Complexity of Fair Deletion Problems
Tomáš Masařík, T. Toufar
2016Theory and Applications of Models of Computation20 citations Open access
Semantic Scholar
A Generalised Theory of Proportionality in Collective Decision Making
Tomáš Masařík, Grzegorz Pierczynski, P. Skowron
2023ACM Conference on Economics and Computation19 citations Open access
Semantic Scholar
On difference graphs and the local dimension of posets
Jinha Kim, Ryan R. Martin, Tomáš Masařík, Warren Shull +3 more
2018European journal of combinatorics (Print)19 citations Open access
Semantic Scholar
Parameterized Complexity of Fair Vertex Evaluation Problems
D. Knop, Tomáš Masařík, T. Toufar
2018International Symposium on Mathematical Foundations of Computer Science18 citations
Semantic Scholar
A Tight Quasi-Polynomial Bound for Global Label Min-Cut
Lars Jaffke, Paloma T. Lima, Tomáš Masařík, M. Pilipczuk +1 more
2022ACM-SIAM Symposium on Discrete Algorithms16 citations Open access
Semantic Scholar
Flexible list colorings in graphs with special degeneracy conditions
Peter Bradshaw, Tomáš Masařík, L. Stacho
2020International Symposium on Algorithms and Computation14 citations Open access
Semantic Scholar
Flexibility of triangle‐free planar graphs
Z. Dvořák, Tomáš Masařík, Jan Musílek, Ondrej Pangrác
2019Journal of Graph Theory14 citations Open access
Semantic Scholar
Flexibility of planar graphs of girth at least six
Z. Dvořák, Tomáš Masařík, Jan Musílek, Ondrej Pangrác
2019Journal of Graph Theory14 citations Open access
Semantic Scholar
Colouring ( P r + P s ) -Free Graphs ∗ † 1
Tereza Klimošová, Tomáš Masařík, Jana Novotná, Veronika Slívová
201812 citations
Semantic Scholar
Duality Gap in Interval Linear Programming
Jana Novotná, M. Hladík, Tomáš Masařík
2018Journal of Optimization Theory and Applications12 citations Open access
Semantic Scholar
Notes on complexity of packing coloring
Minki Kim, B. Lidický, Tomáš Masařík, Florian Pfender
2017Information Processing Letters12 citations Open access
Semantic Scholar
A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs
Linda Cook, Eun Jung Kim, Tomáš Masařík
2025ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing11 citations Open access
Semantic Scholar
Finding Diverse Solutions Parameterized by Cliquewidth
Karolina Drabik, Tomáš Masařík
2024AAAI Conference on Artificial Intelligence11 citations Open access
Semantic Scholar
Flexibility of Planar Graphs - Sharpening the Tools to Get Lists of Size Four
Ilkyoo Choi, Felix Christian Clemen, M. Ferrara, P. Horn +2 more
2020Discrete Applied Mathematics11 citations Open access
Semantic Scholar
On weighted graph separation problems and flow-augmentation
Eun Jung Kim, Tomáš Masařík, M. Pilipczuk, Roohani Sharma +1 more
2022SIAM Journal on Discrete Mathematics10 citations Open access
Semantic Scholar
Random 2-cell embeddings of multistars
Jesse Campion Loth, Kevin Halasz, Tomáš Masařík, B. Mohar +1 more
2021Trends in Mathematics10 citations
Semantic Scholar
Flexibility of planar graphs without 4-cycles
Tomáš Masařík
2019arXiv.org10 citations
Semantic Scholar
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument
Konrad Majewski, Tomáš Masařík, Jana Masaříková, Karolina Okrasa +3 more
2022International Colloquium on Automata, Languages and Programming9 citations
Semantic Scholar
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomáš Masařík +3 more
2022ACM-SIAM Symposium on Discrete Algorithms8 citations Open access
Semantic Scholar
The Phase Transition of Discrepancy in Random Hypergraphs
Calum MacRury, Tomáš Masařík, Leilani Pai, X. Pérez-Giménez
2021SIAM Journal on Discrete Mathematics8 citations Open access
Semantic Scholar
Minimizing an Uncrossed Collection of Drawings
Petr Hliněný, Tomáš Masařík
2023International Symposium Graph Drawing and Network Visualization7 citations Open access
Semantic Scholar
Tuza's Conjecture for Threshold Graphs
Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik, Meike Hatzel +3 more
2021Discrete Mathematics & Theoretical Computer Science7 citations Open access
Semantic Scholar
U\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {U}}$$\end{document}-Bubble Model for Mixed Unit Interval G
Jan Kratochvíl, Tomáš Masařík, Jana Novotná
2020Algorithmica7 citations
Semantic Scholar
Separator Theorem for Minor-Free Graphs in Linear Time
Édouard Bonnet, T. Korhonen, H. Le, Jason Li +1 more
2025Symposium on the Theory of Computing6 citations Open access
Semantic Scholar
Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4
Linda Cook, Tomáš Masařík, M. Pilipczuk, Amadeus Reinald +1 more
2022Electronic Journal of Combinatorics6 citations
Semantic Scholar
Optimal Discretization is Fixed-parameter Tractable
Stefan Kratsch, Tomáš Masařík, I. Muzi, M. Pilipczuk +1 more
2020ACM-SIAM Symposium on Discrete Algorithms6 citations Open access
Semantic Scholar
On Weak Flexibility in Planar Graphs
B. Lidický, Tomáš Masařík, K. Murphy, Shira Zerbib
2020Graphs and Combinatorics6 citations Open access
Semantic Scholar
Packing Directed Cycles Quarter- and Half-Integrally
Tomáš Masařík, I. Muzi, M. Pilipczuk, Paweł Rzaͅżewski +1 more
2019Combinatorica5 citations Open access
Semantic Scholar
Single‐conflict colorings of degenerate graphs
Peter Bradshaw, Tomáš Masařík
2021Journal of Graph Theory4 citations Open access
Semantic Scholar
Robust Connectivity of Graphs on Surfaces
Peter Bradshaw, Tomáš Masařík, Jana Novotná, L. Stacho
2021SIAM Journal on Discrete Mathematics4 citations
Semantic Scholar
Constant congestion brambles in directed graphs
Tomáš Masařík, M. Pilipczuk, Pawel Rzka.zewski, Manuel Sorge
2021SIAM Journal on Discrete Mathematics4 citations
Semantic Scholar
Diversity in Combinatorial Optimization
Julien Baste, M. Fellows, Lars Jaffke, Tomáš Masařík +3 more
2019arXiv.org4 citations
Semantic Scholar
Anti-Path Cover on Sparse Graph Classes
Pavel Dvořák, D. Knop, Tomáš Masařík
2016Doctoral Workshop on Mathematical and Engineering Methods in Computer Science4 citations Open access
Semantic Scholar
Unbent Collections of Orthogonal Drawings
Todor Antic, G. Liotta, Tomáš Masařík, Giacomo Ortali +4 more
2025International Workshop on Graph-Theoretic Concepts in Computer Science3 citations Open access
Semantic Scholar
Proper Rainbow Saturation Numbers for Cycles
Anastasia Halfpap, Bernard Lidick'y, Tomáš Masařík
2024Discrete Mathematics3 citations Open access
Semantic Scholar
List Locally Surjective Homomorphisms in Hereditary Graph Classes
Pavel Dvořák, M. Krawczyk, Tomáš Masařík, Jana Novotná +2 more
2022International Symposium on Algorithms and Computation3 citations
Semantic Scholar
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
Radek Husek, D. Knop, Tomáš Masařík
2020International Symposium on Parameterized and Exact Computation3 citations
Semantic Scholar
Packing directed circuits quarter-integrally
Tomáš Masařík, I. Muzi, M. Pilipczuk, Paweł Rzaͅżewski +1 more
2019Embedded Systems and Applications3 citations Open access
Semantic Scholar
Jones' Conjecture in subcubic graphs
Marthe Bonamy, François Dross, Tomáš Masařík, Andrea Munaro +3 more
2019Electronic Journal of Combinatorics3 citations Open access
Semantic Scholar
Computational Complexity of Distance Edge Labeling
D. Knop, Tomáš Masařík
2015International Workshop on Combinatorial Algorithms3 citations Open access
Semantic Scholar
Constricting the Computational Complexity Gap of the 4-Coloring Problem in (Pt,C3)-free Graphs
Justyna Jaworska, Bartłomiej Kielak, Tomáš Masařík, Jana Masaríková
2025arXiv.org2 citations
Semantic Scholar
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
Jesse Campion Loth, Kevin Halasz, Tomáš Masařík, B. Mohar +1 more
2022ACM-SIAM Symposium on Discrete Algorithms2 citations Open access
Semantic Scholar
Triangle‐free planar graphs with the smallest independence number
Z. Dvořák, Tomáš Masařík, Jan Musílek, Ondrej Pangrác
2016Journal of Graph Theory2 citations Open access
Semantic Scholar
Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor
Édouard Bonnet, Jȩdrzej Hodor, T. Korhonen, Tomáš Masařík
2023arXiv.org1 citations
Semantic Scholar