Tomás Masarík

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 93

Top Topics

Independent Set

Parameterized Complexity

Monadic Datalog

Top Venues

SIAM J. Discret. Math.

J. Graph Theory

Publications

Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
On Weighted Graph Separation Problems and Flow Augmentation. SIAM J. Discret. Math. 38 (1) (2024)
Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. SODA (2024)
Martin Balko, Petr Hlinený, Tomás Masarík, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner
On the Uncrossed Number of Graphs. CoRR (2024)
Anastasia Halfpap, Bernard Lidický, Tomás Masarík
Proper Rainbow Saturation Numbers for Cycles. CoRR (2024)
Karolina Drabik, Tomás Masarík
Finding Diverse Solutions Parameterized by Cliquewidth. CoRR (2024)
Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. STOC (2024)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-width: Harnessing the power of atoms. J. Graph Theory 104 (4) (2023)
Édouard Bonnet, Jedrzej Hodor, Tuukka Korhonen, Tomás Masarík
Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor. CoRR (2023)
Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza
Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$. Electron. J. Comb. 30 (3) (2023)
Petr Hlinený, Tomás Masarík
Minimizing an Uncrossed Collection of Drawings. CoRR (2023)
Calum MacRury, Tomás Masarík, Leilani Pai, Xavier Pérez-Giménez
The Phase Transition of Discrepancy in Random Hypergraphs. SIAM J. Discret. Math. 37 (3) (2023)
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. SODA (2023)
Tomás Masarík, Grzegorz Pierczynski, Piotr Skowron
Group Fairness in Social Choice. CoRR (2023)
Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza
A tight quasi-polynomial bound for Global Label Min-Cut. SODA (2023)
Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. CoRR (2023)
Petr Hlinený, Tomás Masarík
Minimizing an Uncrossed Collection of Drawings. GD (1) (2023)
Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. CoRR (2022)
Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Constant Congestion Brambles in Directed Graphs. SIAM J. Discret. Math. 36 (2) (2022)
Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík
Flexibility of planar graphs - Sharpening the tools to get lists of size four. Discret. Appl. Math. 306 (2022)
Pavel Dvorák, Tomás Masarík, Jana Novotná, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk
List Locally Surjective Homomorphisms in Hereditary Graph Classes. ISAAC (2022)
Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Packing Directed Cycles Quarter- and Half-Integrally. Comb. 42 (Supplement 2) (2022)
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. CoRR (2022)
Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
)-Free Graphs. Algorithmica 84 (6) (2022)
Pavel Dvorák, Monika Krawczyk, Tomás Masarík, Jana Novotná, Pawel Rzazewski, Aneta Zuk
List Locally Surjective Homomorphisms in Hereditary Graph Classes. CoRR (2022)
Bernard Lidický, Tomás Masarík, Kyle Murphy, Shira Zerbib
On Weak Flexibility in Planar Graphs. Graphs Comb. 38 (6) (2022)
Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza
A tight quasi-polynomial bound for Global Label Min-Cut. CoRR (2022)
Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
Tuza's Conjecture for Threshold Graphs. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ICALP (2022)
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artif. Intell. 303 (2022)
Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho
Robust Connectivity of Graphs on Surfaces. SIAM J. Discret. Math. 36 (2) (2022)
Peter Bradshaw, Tomás Masarík, Ladislav Stacho
Flexible list colorings in graphs with special degeneracy conditions. J. Graph Theory 101 (4) (2022)
Sean English, Tomás Masarík, Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro
Linear Bounds for Cycle-Free Saturation Games. Electron. J. Comb. 29 (3) (2022)
Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument. CoRR (2022)
Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza
. CoRR (2022)
Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal
Random 2-cell embeddings of multistars. CoRR (2021)
Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
-Free Graphs. WG (2021)
Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. 28 (4) (2021)
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. SIAM J. Discret. Math. 35 (1) (2021)
Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho
Robust Connectivity of Graphs on Surfaces. CoRR (2021)
Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Constant congestion brambles in directed graphs. CoRR (2021)
Peter Bradshaw, Tomás Masarík
Single-conflict colorings of degenerate graphs. CoRR (2021)
Sean English, Tomás Masarík, Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro
Linear Bounds for Cycle-free Saturation Games. CoRR (2021)
Calum MacRury, Tomás Masarík, Leilani Pai, Xavier Pérez-Giménez
The Phase Transition of Discrepancy in Random Hypergraphs. CoRR (2021)
Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
Tuza's Conjecture for Threshold Graphs. CoRR (2021)
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
Flexibility of triangle-free planar graphs. J. Graph Theory 96 (4) (2021)
Jan Kratochvíl, Tomás Masarík, Jana Novotná
-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. Algorithmica 83 (12) (2021)
Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge
Optimal Discretization is Fixed-parameter Tractable. SODA (2021)
Jan Kratochvíl, Tomás Masarík, Jana Novotná
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. MFCS (2020)
Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
)-Free Graphs. CoRR (2020)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-Width: Harnessing the Power of Atoms. CoRR (2020)
Radek Husek, Dusan Knop, Tomás Masarík
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. IPEC (2020)
Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge
Optimal Discretization is Fixed-parameter Tractable. CoRR (2020)
Bernard Lidický, Tomás Masarík, Kyle Murphy, Shira Zerbib
On Weak Flexibility in Planar Graphs. CoRR (2020)
Jana Novotná, Milan Hladík, Tomás Masarík
Duality Gap in Interval Linear Programming. J. Optim. Theory Appl. 184 (2) (2020)
Radek Husek, Dusan Knop, Tomás Masarík
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. CoRR (2020)
Peter Bradshaw, Tomás Masarík, Ladislav Stacho
Flexible List Colorings in Graphs with Special Degeneracy Conditions. CoRR (2020)
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI (2020)
Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík
Flexibility of Planar Graphs - Sharpening the Tools to Get Lists of Size Four. CoRR (2020)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-Width: Harnessing the Power of Atoms. WG (2020)
Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
)-Free Graphs. Algorithmica 82 (7) (2020)
Jan Kratochvíl, Tomás Masarík, Jana Novotná
U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited. CoRR (2020)
Jinha Kim, Ryan R. Martin, Tomás Masarík, Warren Shull, Heather C. Smith, Andrew J. Uzzell, Zhiyu Wang
On difference graphs and the local dimension of posets. Eur. J. Comb. 86 (2020)
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
Flexibility of planar graphs of girth at least six. J. Graph Theory 95 (3) (2020)
Tomás Masarík, Tomás Toufar
Parameterized complexity of fair deletion problems. Discret. Appl. Math. 278 (2020)
Peter Bradshaw, Tomás Masarík, Ladislav Stacho
Flexible List Colorings in Graphs with Special Degeneracy Conditions. ISAAC (2020)
Dusan Knop, Tomás Masarík, Tomás Toufar
Parameterized Complexity of Fair Vertex Evaluation Problems. MFCS (2019)
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
Flexibility of planar graphs of girth at least six. CoRR (2019)
Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Packing directed circuits quarter-integrally. CoRR (2019)
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
Triangle-free planar graphs with the smallest independence number. J. Graph Theory 90 (3) (2019)
Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote
FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms 12 (12) (2019)
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
Flexibility of triangle-free planar graphs. CoRR (2019)
Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote
FPT Algorithms for Diverse Collections of Hitting Sets. CoRR (2019)
Tomás Masarík
Flexibility of planar graphs without 4-cycles. CoRR (2019)
Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
Jones' Conjecture in subcubic graphs. CoRR (2019)
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Diversity in Combinatorial Optimization. CoRR (2019)
Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Log. Methods Comput. Sci. 15 (4) (2019)
Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Packing Directed Circuits Quarter-Integrally. ESA (2019)
Jinha Kim, Ryan R. Martin, Tomás Masarík, Warren Shull, Heather C. Smith, Andrew J. Uzzell, Zhiyu Wang
On difference graphs and the local dimension of posets. CoRR (2018)
Dusan Knop, Tomás Masarík
Computational complexity of distance edge labeling. Discret. Appl. Math. 246 (2018)
Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
Colouring (P_r+P_s)-Free Graphs. ISAAC (2018)
Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender
Notes on complexity of packing coloring. Inf. Process. Lett. 137 (2018)
Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
Colouring (P_r+P_s)-Free Graphs. CoRR (2018)
Dusan Knop, Tomás Masarík, Tomás Toufar
Parameterized complexity of fair deletion problems II. CoRR (2018)
Jana Novotná, Milan Hladík, Tomás Masarík
Duality Gap in Interval Linear Programming. CoRR (2018)
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. STACS (2018)
Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender
Notes on complexity of packing coloring. CoRR (2017)
Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. WG (2017)
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. CoRR (2017)
Tomás Masarík, Tomás Toufar
Parameterized Complexity of Fair Deletion Problems. TAMC (2017)
Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. CoRR (2017)
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
Triangle-free planar graphs with the smallest independence number. CoRR (2016)
Tomás Masarík, Tomas Toufar
Parameterized complexity of fair deletion problems. CoRR (2016)
Pavel Dvorák, Dusan Knop, Tomás Masarík
Anti-Path Cover on Sparse Graph Classes. MEMICS (2016)
Dusan Knop, Tomás Masarík
Computational Complexity of Distance Edge Labeling. IWOCA (2015)
Dusan Knop, Tomás Masarík
Computational complexity of distance edge labeling. CoRR (2015)