Anti-Path Cover on Sparse Graph Classes. - Pavel Dvorák; Dusan Knop; Tomás Masarík (MEMICS, 2016)

Colouring (P_r+P_s)-Free Graphs. - Tereza Klimosová; Josef Malík; Tomás Masarík; Jana Novotná 001; Daniël Paulusma; Veronika Slívová (ISAAC, 2018)

Parameterized complexity of fair deletion problems II. - Dusan Knop; Tomás Masarík; Tomás Toufar (CoRR, 2018)

Computational complexity of distance edge labeling. - Dusan Knop; Tomás Masarík (Discret. Appl. Math., 2018)

Notes on complexity of packing coloring. - Minki Kim; Bernard Lidický; Tomás Masarík; Florian Pfender (Inf. Process. Lett., 2018)

Packing Directed Circuits Quarter-Integrally. - Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (ESA, 2019)

Parameterized Complexity of Fair Vertex Evaluation Problems. - Dusan Knop; Tomás Masarík; Tomás Toufar (MFCS, 2019)

FPT Algorithms for Diverse Collections of Hitting Sets. - Julien Baste; Lars Jaffke; Tomás Masarík; Geevarghese Philip; Günter Rote (Algorithms, 2019)

Flexibility of planar graphs without 4-cycles. - Tomás Masarík (CoRR, 2019)

Diversity in Combinatorial Optimization. - Julien Baste; Michael R. Fellows; Lars Jaffke; Tomás Masarík; Mateus de Oliveira Oliveira; Geevarghese Philip; Frances A. Rosamond (CoRR, 2019)

Jones' Conjecture in subcubic graphs. - Marthe Bonamy; François Dross; Tomás Masarík; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2019)

Triangle-free planar graphs with the smallest independence number. - Zdenek Dvorák 001; Tomás Masarík; Jan Musílek; Ondrej Pangrác (J. Graph Theory, 2019)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. - Dusan Knop; Martin Koutecký; Tomás Masarík; Tomás Toufar (Log. Methods Comput. Sci., 2019)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. - Radek Husek; Dusan Knop; Tomás Masarík (IPEC, 2020)

U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. - Jan Kratochvíl; Tomás Masarík; Jana Novotná 001 (MFCS, 2020)

Colouring (Pr + Ps)-Free Graphs. - Tereza Klimosová; Josef Malík; Tomás Masarík; Jana Novotná 001; Daniël Paulusma; Veronika Slívová (Algorithmica, 2020)

Note on 3-Coloring of (2P4, C5)-Free Graphs. - Vít Jelínek; Tereza Klimosová; Tomás Masarík; Jana Novotná 001; Aneta Pokorná (CoRR, 2020)

Parameterized complexity of fair deletion problems. - Tomás Masarík; Tomás Toufar (Discret. Appl. Math., 2020)

On difference graphs and the local dimension of posets. - Jinha Kim; Ryan R. Martin; Tomás Masarík; Warren Shull; Heather C. Smith; Andrew J. Uzzell; Zhiyu Wang (Eur. J. Comb., 2020)

Flexibility of planar graphs of girth at least six. - Zdenek Dvorák 001; Tomás Masarík; Jan Musílek; Ondrej Pangrác (J. Graph Theory, 2020)

Duality Gap in Interval Linear Programming. - Jana Novotná 001; Milan Hladík; Tomás Masarík (J. Optim. Theory Appl., 2020)

Optimal Discretization is Fixed-parameter Tractable. - Stefan Kratsch; Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Manuel Sorge (SODA, 2021)

U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. - Jan Kratochvíl; Tomás Masarík; Jana Novotná 001 (Algorithmica, 2021)

Jones' Conjecture in Subcubic Graphs. - Marthe Bonamy; François Dross; Tomás Masarík; Andrea Munaro; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk (Electron. J. Comb., 2021)

Random 2-cell embeddings of multistars. - Jesse Campion Loth; Kevin Halasz; Tomás Masarík; Bojan Mohar; Robert Sámal (CoRR, 2021)

Single-conflict colorings of degenerate graphs. - Peter Bradshaw; Tomás Masarík (CoRR, 2021)

Flexibility of triangle-free planar graphs. - Zdenek Dvorák 001; Tomás Masarík; Jan Musílek; Ondrej Pangrác (J. Graph Theory, 2021)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. - Pavel Dvorák; Andreas Emil Feldmann; Dusan Knop; Tomás Masarík; Tomás Toufar; Pavel Veselý 001 (SIAM J. Discret. Math., 2021)

List Locally Surjective Homomorphisms in Hereditary Graph Classes. - Pavel Dvorák; Tomás Masarík; Jana Novotná 001; Monika Krawczyk; Pawel Rzazewski; Aneta Zuk (ISAAC, 2022)

Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. - Julien Baste; Michael R. Fellows; Lars Jaffke; Tomás Masarík; Mateus de Oliveira Oliveira; Geevarghese Philip; Frances A. Rosamond (Artif. Intell., 2022)

On 3-Coloring of (2P4, C5)-Free Graphs. - Vít Jelínek; Tereza Klimosová; Tomás Masarík; Jana Novotná 001; Aneta Pokorná (Algorithmica, 2022)

Linear Bounds for Cycle-Free Saturation Games. - Sean English; Tomás Masarík; Grace McCourt; Erin Meger; Michael S. Ross; Sam Spiro (Electron. J. Comb., 2022)

Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4. - Linda Cook; Tomás Masarík; Marcin Pilipczuk; Amadeus Reinald; Uéverton S. Souza (CoRR, 2022)

Flexibility of planar graphs - Sharpening the tools to get lists of size four. - Ilkyoo Choi; Felix Christian Clemen; Michael Ferrara; Paul Horn; Fuhong Ma; Tomás Masarík (Discret. Appl. Math., 2022)

Tuza's Conjecture for Threshold Graphs. - Marthe Bonamy; Lukasz Bozyk; Andrzej Grzesik; Meike Hatzel; Tomás Masarík; Jana Novotná 001; Karolina Okrasa (Discret. Math. Theor. Comput. Sci., 2022)

On Weak Flexibility in Planar Graphs. - Bernard Lidický; Tomás Masarík; Kyle Murphy; Shira Zerbib (Graphs Comb., 2022)

Flexible list colorings in graphs with special degeneracy conditions. - Peter Bradshaw; Tomás Masarík; Ladislav Stacho (J. Graph Theory, 2022)

Robust Connectivity of Graphs on Surfaces. - Peter Bradshaw; Tomás Masarík; Jana Novotná 001; Ladislav Stacho (SIAM J. Discret. Math., 2022)

Constant Congestion Brambles in Directed Graphs. - Tomás Masarík; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (SIAM J. Discret. Math., 2022)

Packing Directed Cycles Quarter- and Half-Integrally. - Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (Comb., 2022)

Minimizing an Uncrossed Collection of Drawings. - Petr Hlinený; Tomás Masarík (GD (1), 2023)

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ás Masarík; Marcin Pilipczuk; Roohani Sharma; Manuel Sorge (SODA, 2023)

A tight quasi-polynomial bound for Global Label Min-Cut. - Lars Jaffke; Paloma T. Lima; Tomás Masarík; Marcin Pilipczuk; Uéverton S. Souza (SODA, 2023)

Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$. - Linda Cook; Tomás Masarík; Marcin Pilipczuk; Amadeus Reinald; Uéverton S. Souza (Electron. J. Comb., 2023)

Group Fairness in Social Choice. - Tomás Masarík; Grzegorz Pierczynski; Piotr Skowron 001 (CoRR, 2023)

Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor. - Édouard Bonnet; Jedrzej Hodor; Tuukka Korhonen; Tomás Masarík (CoRR, 2023)

The Phase Transition of Discrepancy in Random Hypergraphs. - Calum MacRury; Tomás Masarík; Leilani Pai; Xavier Pérez-Giménez (SIAM J. Discret. Math., 2023)

Clique-width: Harnessing the power of atoms. - Konrad K. Dabrowski; Tomás Masarík; Jana Novotná 001; Daniël Paulusma; Pawel Rzazewski (J. Graph Theory, 2023)

On the Uncrossed Number of Graphs. - Martin Balko; Petr Hlinený; Tomás Masarík; Joachim Orthaber; Birgit Vogtenhuber; Mirko H. Wagner (GD, 2024)

A Generalised Theory of Proportionality in Collective Decision Making. - Tomás Masarík; Grzegorz Pierczynski; Piotr Skowron 001 (EC, 2024)

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. - Jesse Campion Loth; Kevin Halasz; Tomás Masarík; Bojan Mohar; Robert Sámal (SODA, 2024)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. - Peter Gartland; Daniel Lokshtanov; Tomás Masarík; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (STOC, 2024)

Proper Rainbow Saturation Numbers for Cycles. - Anastasia Halfpap; Bernard Lidický; Tomás Masarík (CoRR, 2024)

Finding Diverse Solutions Parameterized by Cliquewidth. - Karolina Drabik; Tomás Masarík (CoRR, 2024)

Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. - Konrad Majewski; Tomás Masarík; Jana Masaríková; Karolina Okrasa; Marcin Pilipczuk; Pawel Rzazewski; Marek Sokolowski 001 (ACM Trans. Comput. Theory, 2024)

On Weighted Graph Separation Problems and Flow Augmentation. - Eun Jung Kim 002; Tomás Masarík; Marcin Pilipczuk; Roohani Sharma; Magnus Wahlström (SIAM J. Discret. Math., 2024)

A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs. - Linda Cook; Eun Jung Kim 002; Tomás Masarík (PODC, 2025)

Fair Vertex Problems Parameterized by Cluster Vertex Deletion. - Tomás Masarík; Jedrzej Olkowski; Anna Zych-Pawlewicz (CoRR, 2025)

Unbent Collections of Orthogonal Drawings. - Todor Antic; Giuseppe Liotta; Tomás Masarík; Giacomo Ortali; Matthias Pfretzschner; Peter Stumpf; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2025)

Path Eccentricity and Forbidden Induced Subgraphs. - Sylwia Cichacz; Claire Hilaire; Tomás Masarík; Jana Masaríková; Martin Milanic (CoRR, 2025)

A Tight Meta-theorem for LOCAL Certification of MSO2 Properties within Bounded Treewidth Graphs. - Linda Cook; Eun Jung Kim 002; Tomás Masarík (CoRR, 2025)

General Strong Bound on the Uncrossed Number which is Tight for the Edge Crossing Number. - Gaspard Charvy; Tomás Masarík (CoRR, 2025)