Publications

Tomáš Masařík

Number of publications: 43

2024

• Konrad Majewski , Tomáš Masařík , Jana Masaříková , Karolina Okrasa, Marcin Pilipczuk , Paweł Rzążewski , Marek Sokołowski , Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument, ACM Transactions on Computation Theory, 16 (2) 2024, p. 1-18. See in PBN
• Tomáš Masařík , Petr Hliněný, Minimizing an Uncrossed Collection of Drawings, Graph Drawing and Network Visualization, Palermo, Italy, 20 September 2023 - 22 September 2023, 14465 2024, p. 110-123. See in PBN
• Martin Balko, Petr Hliněný, Tomáš Masařík , Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner, On the Uncrossed Number of Graphs, 32nd International Symposium on Graph Drawing and Network Visualization, Vienna, Austria, 18 September 2024 - 20 September 2024, 320 2024, p. 18:1-18:13. See in PBN
• Eun Jung Kim, Tomáš Masařík , Marcin Pilipczuk , Roohani Sharma, Magnus Wahlström, On Weighted Graph Separation Problems and Flow Augmentation, SIAM JOURNAL ON DISCRETE MATHEMATICS, 38 (1) 2024, p. 170-189. See in PBN
• Jesse Campion Loth, Kevin Halasz, Tomáš Masařík , Bojan Mohar, Robert Šámal, Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic, 35th 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, the United States of America, 7 January 2024 - 10 January 2024. See in PBN

2023

• Lars Jaffke, Paloma Thomé de Lima, Tomáš Masařík , Marcin Pilipczuk , Uéverton Dos Santos Souza, A tight quasi-polynomial bound for Global Label Min-Cut, Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florencja, Italy, 22 January 2023 - 25 January 2023. See in PBN
• Meike Hatzel, Lars Jaffke, Paloma Thomé de Lima, Tomáš Masaří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, Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florencja, Italy, 22 January 2023 - 25 January 2023. See in PBN
• Linda Cook, Tomáš Masařík , Marcin Pilipczuk , Amadeus Reinald, Uéverton Dos Santos Souza, Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$, ELECTRONIC JOURNAL OF COMBINATORICS, 30 (3) 2023, p. 1-27. See in PBN
• Linda Cook, Tomáš Masařík , Marcin Pilipczuk , Amadeus Reinald, Uéverton Dos Santos Souza, Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4, European Conference on Combinatorics, Graph Theory and Applications, European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'23), Praha, Czechia, 28 August 2023 - 1 September 2023. See in PBN
• Peter Bradshaw, Tomáš Masařík , Single-conflict colorings of degenerate graphs, European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'23), Praha, Czechia, 28 August 2023 - 1 September 2023. See in PBN
• Peter Bradshaw, Tomáš Masařík , Single‐conflict colorings of degenerate graphs, Journal of Graph Theory, 2023. See in PBN
• Calum MacRury, Tomáš Masařík , Leilani Pai, Xavier Pérez-Giménez, The Phase Transition of Discrepancy in Random Hypergraphs, SIAM JOURNAL ON DISCRETE MATHEMATICS, 37 (3) 2023, p. 1818-1841. See in PBN

2022

• Julien Baste, Michael R. Fellows, Lars Jaffke, Tomáš Masařík , Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond, Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory, Artificial Intelligence, 303 2022, p. 103644. See in PBN
• Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomáš Masařík , Flexibility of planar graphs—Sharpening the tools to get lists of size four, Discrete Applied Mathematics, 306 2022, p. 120-132. See in PBN
• Peter Bradshaw, Tomáš Masařík , Ladislav Stacho, Flexible list colorings in graphs with special degeneracy conditions, Journal of Graph Theory, 101 (4) 2022, p. 717-745. See in PBN
• Sean English, Tomáš Masařík , Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro, Linear Bounds for Cycle-Free Saturation Games, ELECTRONIC JOURNAL OF COMBINATORICS, 29 (3) 2022, p. 5:1-5:21. See in PBN
• Pavel Dvořák, Tomáš Masařík , Jana Masaříková , Paweł Rzążewski , Aneta Żuk, Monika Krawczyk, List Locally Surjective Homomorphisms in Hereditary Graph Classes, Leibniz International Proceedings in Informatics, 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Seoul, the Republic of Korea, 18 December 2022 - 20 December 2022, 248 2022, p. 30:1-30:15. See in PBN
• Konrad Majewski , Tomáš Masařík , Jana Masaříková , Karolina Okrasa, Marcin Pilipczuk , Paweł Rzążewski , Marek Sokołowski , Max weight independent set in graphs with no long claws: An analog of the Gyárfás' path argument, Leibniz International Proceedings in Informatics, LIPIcs, 49th International Colloquium on Automata, Languages and Programming, Paris, France, 4 July 2022 - 8 July 2022. See in PBN
• Vít Jelínek, Tereza Klimošová, Tomáš Masařík , Jana Masaříková , Aneta Pokorná, On 3-Coloring of ($$2P_4,C_5$$)-Free Graphs, Algorithmica, 84 (6) 2022, p. 1526-1547. See in PBN
• Bernard Lidický, Tomáš Masařík , Kyle Murphy, Shira Zerbib, On Weak Flexibility in Planar Graphs, Graphs and Combinatorics, 38 (6) 2022, p. 1-33. See in PBN
• Jesse Campion Loth, Kevin Halasz, Tomáš Masařík , Bojan Mohar, Robert Šámal, Random 2-cell embeddings of multistars, Proceedings of the American Mathematical Society, 150 (9) 2022, p. 3699-3713. See in PBN
• Peter Bradshaw, Tomáš Masařík , Jana Masaříková , Ladislav Stacho, Robust Connectivity of Graphs on Surfaces, SIAM JOURNAL ON DISCRETE MATHEMATICS, 36 (2) 2022, p. 1416-1435. See in PBN
• Andrzej Grzesik, Tomáš Masařík , Łukasz Bożyk , Jana Novotná, Meike Hatzel, Marthe Bonamy, Karolina Okrasa, Tuza's conjecture for threshold graphs, DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 24 (1) 2022, p. 1-14. See in PBN

2021

• Tomáš Masařík , Marcin Pilipczuk , Paweł Rzążewski , Manuel Sorge, Constant Congestion Brambles in Directed Graphs, European Conference on Combinatorics, Graph Theory and Appliations 2021, Barcelona, Spain, 6 September 2021 - 10 September 2021. See in PBN
• Marthe Bonamy, François Dross, Tomáš Masařík , Andrea Munaro, Wojciech Nadara , Marcin Pilipczuk , Michał Pilipczuk , Jones' Conjecture in Subcubic Graphs, ELECTRONIC JOURNAL OF COMBINATORICS, 28 (4) 2021, p. P4.5: 1-12. See in PBN
• Vít Jelínek, Tereza Klimošová, Tomáš Masařík , Jana Masaříková , Aneta Pokorná, On 3-Coloring of (2P_4,C_4)-Free Graphs, 47th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2021, Warszawa, Poland, 23 June 2021 - 25 June 2021, 12911 2021, p. 388--401. See in PBN
• Stefan Kratsch, Tomáš Masařík , Irene Muzi, Marcin Pilipczuk , Manuel Sorge, Optimal Discretization is Fixed-parameter Tractable, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 January 2021 - 13 January 2021. See in PBN
• Pavel Dvořák, Andreas E. Feldmann, Dušan Knop, Tomáš Masařík , Tomáš Toufar, Pavel Veselý, Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices, SIAM JOURNAL ON DISCRETE MATHEMATICS, 35 (1) 2021, p. 546-574. See in PBN
• Peter Bradshaw, Tomáš Masařík , Jana Masaříková , Ladislav Stacho, Robust Connectivity of Graphs on Surfaces, European Conference on Combinatorics, Graph Theory and Appliations 2021, Barcelona, Spain, 6 September 2021 - 10 September 2021. See in PBN
• Marthe Bonamy, Łukasz Bożyk , Andrzej Grzesik, Meike Hatzel, Tomáš Masařík , Jana Masaříková , Tuza's Conjecture for Threshold Graphs, European Conference on Combinatorics, Graph Theory and Appliations 2021, Barcelona, Spain, 6 September 2021 - 10 September 2021. See in PBN
• Jan Kratochvíl, Jana Masaříková , Tomáš Masařík , U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited, Algorithmica, 2021. See in PBN

2020

• Radek Hušek, Tomáš Masařík , Dušan Knop, Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View, 15th International Symposium on Parameterized and Exact Computation, Hong Kong, China, 14 December 2020 - 18 December 2020. See in PBN
• Konrad Dabrowski, Tomáš Masařík , Jana Masaříková , Daniël Paulusma, Paweł Rzążewski , Clique-Width: Harnessing the Power of Atoms, 46th International Workshop, {WG} 2020, Leeds, the United Kingdom of Great Britain and Northern Ireland, 24 June 2020 - 26 June 2020. See in PBN
• Tereza Klimošová, Josef Malík, Daniël Paulusma, Veronika Slívová, Tomáš Masařík , Jana Masaříková , Colouring (Pr + Ps)-Free Graphs, Algorithmica, 82 (7) 2020, p. 1833-1858. See in PBN
• Julien Baste, Michael R. Fellows, Lars Jaffke, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond, Tomáš Masařík , Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory, 29th International Joint Conference on Artifical Intelligence, Yokohama, Japan, 7 January 2021 - 15 January 2021. See in PBN
• Tomáš Toufar, Tomáš Masařík , Parameterized complexity of fair deletion problems, Discrete Applied Mathematics, 278 2020, p. 51-61. See in PBN
• Jan Kratochvíl, Tomáš Masařík , Jana Masaříková , U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited, 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czechia, 24 August 2020 - 28 August 2020. See in PBN

2019

• Tomáš Masařík , Flexibility of planar graphs without 4-cycles, Acta Mathematica Universitatis Comenianae, 88 (3) 2019, p. 935-940. See in PBN
• Julien Baste, Lars Jaffke, Geevarghese Philip, Günter Rote, Tomáš Masařík , FPT Algorithms for Diverse Collections of Hitting Sets, Algorithms, 12 (12) 2019, p. 254. See in PBN
• Tomáš Masařík , Irene Muzi, Marcin Pilipczuk , Paweł Rzążewski , Manuel Sorge, Packing Directed Circuits Quarter-Integrally, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019. See in PBN
• Dušan Knop, Tomáš Masařík , Tomáš Toufar, Parameterized Complexity of Fair Vertex Evaluation Problems, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, 26 August 2019 - 30 August 2019. See in PBN
• Dusan Knop, Martin Koutecky, Tomáš Masařík , Tomas Toufar, Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity, Logical Methods in Computer Science, 15 (4) 2019, p. 12:1-12:32. See in PBN

Others

• Jesse Campion Loth, Kevin Halasz, Tomáš Masařík , Bojan Mohar, Robert Šámal, Random 2-Cell Embeddings of Multistars, Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications, , p. 805-810. See in PBN