Tomás Masarík

According to our database, Tomás Masarík authored at least 56 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On Weighted Graph Separation Problems and Flow Augmentation.

Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström

SIAM J. Discret. Math., March, 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

ACM Trans. Comput. Theory, 2024

Finding Diverse Solutions Parameterized by Cliquewidth.

Karolina Drabik, Tomás Masarík

CoRR, 2024

Proper Rainbow Saturation Numbers for Cycles.

Anastasia Halfpap, Bernard Lidický, Tomás Masarík

CoRR, 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

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 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

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

A Generalised Theory of Proportionality in Collective Decision Making.

Tomás Masarík, Grzegorz Pierczynski, Piotr Skowron

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

On the Uncrossed Number of Graphs.

Martin Balko, Petr Hlinený, Tomás Masarík, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Clique-width: Harnessing the power of atoms.

Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski

J. Graph Theory, December, 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., September, 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

Group Fairness in Social Choice.

Tomás Masarík, Grzegorz Pierczynski, Piotr Skowron

CoRR, 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

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

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 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

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Minimizing an Uncrossed Collection of Drawings.

Petr Hlinený, Tomás Masarík

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

Packing Directed Cycles Quarter- and Half-Integrally.

Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge

Comb., December, 2022

Constant Congestion Brambles in Directed Graphs.

Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge

SIAM J. Discret. Math., 2022

Robust Connectivity of Graphs on Surfaces.

Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho

SIAM J. Discret. Math., 2022

Flexible list colorings in graphs with special degeneracy conditions.

Peter Bradshaw, Tomás Masarík, Ladislav Stacho

J. Graph Theory, 2022

On Weak Flexibility in Planar Graphs.

Bernard Lidický, Tomás Masarík, Kyle Murphy, Shira Zerbib

Graphs Comb., 2022

Tuza's Conjecture for Threshold Graphs.

Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa

Discret. Math. Theor. Comput. Sci., 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

Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P₄.

Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza

CoRR, 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

On 3-Coloring of (2P_{4, C₅})-Free Graphs.

Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná

Algorithmica, 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

List Locally Surjective Homomorphisms in Hereditary Graph Classes.

Pavel Dvorák, Tomás Masarík, Jana Novotná, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

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ý

SIAM J. Discret. Math., 2021

Flexibility of triangle-free planar graphs.

Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác

J. Graph Theory, 2021

Single-conflict colorings of degenerate graphs.

Peter Bradshaw, Tomás Masarík

CoRR, 2021

Random 2-cell embeddings of multistars.

Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal

CoRR, 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

<i>U</i>-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited.

Jan Kratochvíl, Tomás Masarík, Jana Novotná

Algorithmica, 2021

Optimal Discretization is Fixed-parameter Tractable.

Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Duality Gap in Interval Linear Programming.

Jana Novotná, Milan Hladík, Tomás Masarík

J. Optim. Theory Appl., 2020

Flexibility of planar graphs of girth at least six.

Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác

J. Graph Theory, 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

Parameterized complexity of fair deletion problems.

Tomás Masarík, Tomás Toufar

Discret. Appl. Math., 2020

Note on 3-Coloring of (2P₄, C₅)-Free Graphs.

Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná

CoRR, 2020

Colouring (P_r + P_s)-Free Graphs.

Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová

Algorithmica, 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á

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View.

Radek Husek, Dusan Knop, Tomás Masarík

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

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

Triangle-free planar graphs with the smallest independence number.

Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác

J. Graph Theory, 2019

Jones' Conjecture in subcubic graphs.

Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk

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

Flexibility of planar graphs without 4-cycles.

Tomás Masarík

CoRR, 2019

FPT Algorithms for Diverse Collections of Hitting Sets.

Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote

Algorithms, 2019

Parameterized Complexity of Fair Vertex Evaluation Problems.

Dusan Knop, Tomás Masarík, Tomás Toufar

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Packing Directed Circuits Quarter-Integrally.

Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Notes on complexity of packing coloring.

Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender

Inf. Process. Lett., 2018

Computational complexity of distance edge labeling.

Dusan Knop, Tomás Masarík

Discret. Appl. Math., 2018

Parameterized complexity of fair deletion problems II.

Dusan Knop, Tomás Masarík, Tomás Toufar

CoRR, 2018

Colouring (P_r+P_s)-Free Graphs.

Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2016

Anti-Path Cover on Sparse Graph Classes.

Pavel Dvorák, Dusan Knop, Tomás Masarík

Proceedings of the Proceedings 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2016