Tomás Masarík

111 papers A* 10A 3B 10C 2Journal 84Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Finding Diverse Solutions Parameterized by Cliquewidth. AAAI Karolina Drabik, Tomás Masarík
2026	J	`jnl`	Optimal Path Partitions in Subcubic and Almost-subcubic Graphs. CoRR Tomás Masarík, Michal Wlodarczyk, Mehmet Akif Yildiz
2026	J	`jnl`	Proper rainbow saturation numbers for cycles. Discret. Math. Anastasia Halfpap, Bernard Lidický, Tomás Masarík
2026	J	`jnl`	QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes. CoRR Édouard Bonnet, Jadwiga Czyzewska, Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski
2025	J	`jnl`	A Tight Meta-theorem for LOCAL Certification of MSO CoRR Linda Cook, Eun Jung Kim, Tomás Masarík
2025	A*	`conf`	A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs. PODC Linda Cook, Eun Jung Kim, Tomás Masarík
2025	J	`jnl`	Constricting the Computational Complexity Gap of the 4-Coloring Problem in (P CoRR Justyna Jaworska, Bartlomiej Kielak, Tomás Masarík, Jana Masaríková
2025	J	`jnl`	Fair Vertex Problems Parameterized by Cluster Vertex Deletion. CoRR Tomás Masarík, Jedrzej Olkowski, Anna Zych-Pawlewicz
2025	J	`jnl`	General Strong Bound on the Uncrossed Number which is Tight for the Edge Crossing Number. CoRR Gaspard Charvy, Tomás Masarík
2025	J	`jnl`	Path Eccentricity and Forbidden Induced Subgraphs. CoRR Sylwia Cichacz, Claire Hilaire, Tomás Masarík, Jana Masaríková, Martin Milanic
2025	J	`jnl`	Separator Theorem for Minor-Free Graphs in Linear Time. CoRR Édouard Bonnet, Tuukka Korhonen, Hung Le, Jason Li, Tomás Masarík
2025	J	`jnl`	Single-conflict colorings of degenerate graphs. J. Graph Theory Peter Bradshaw, Tomás Masarík
2025	B	`conf`	Unbent Collections of Orthogonal Drawings. WG Todor Antic, Giuseppe Liotta, Tomás Masarík, Giacomo Ortali, Matthias Pfretzschner, Peter Stumpf, Alexander Wolff, Johannes Zink
2025	J	`jnl`	Unbent Collections of Orthogonal Drawings. CoRR Todor Antic, Giuseppe Liotta, Tomás Masarík, Giacomo Ortali, Matthias Pfretzschner, Peter Stumpf, Alexander Wolff, Johannes Zink
2024	A*	`conf`	A Generalised Theory of Proportionality in Collective Decision Making. EC Tomás Masarík, Grzegorz Pierczynski, Piotr Skowron
2024	J	`jnl`	Finding Diverse Solutions Parameterized by Cliquewidth. CoRR Karolina Drabik, Tomás Masarík
2024	J	`jnl`	Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ACM Trans. Comput. Theory Konrad Majewski, Tomás Masarík, Jana Masaríková, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
2024	A*	`conf`	Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. STOC Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2024	J	`jnl`	On Weighted Graph Separation Problems and Flow Augmentation. SIAM J. Discret. Math. Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
2024	A	`conf`	On the Uncrossed Number of Graphs. GD Martin Balko, Petr Hlinený, Tomás Masarík, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner
2024	J	`jnl`	On the Uncrossed Number of Graphs. CoRR Martin Balko, Petr Hlinený, Tomás Masarík, Joachim Orthaber, Birgit Vogtenhuber, Mirko H. Wagner
2024	J	`jnl`	Proper Rainbow Saturation Numbers for Cycles. CoRR Anastasia Halfpap, Bernard Lidický, Tomás Masarík
2024	A*	`conf`	Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. SODA Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal
2023	A*	`conf`	A tight quasi-polynomial bound for Global Label Min-Cut. SODA Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza
2023	J	`jnl`	Clique-width: Harnessing the power of atoms. J. Graph Theory Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
2023	A*	`conf`	Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. SODA Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
2023	J	`jnl`	Group Fairness in Social Choice. CoRR Tomás Masarík, Grzegorz Pierczynski, Piotr Skowron
2023	J	`jnl`	Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. CoRR Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2023	—	`conf`	Minimizing an Uncrossed Collection of Drawings. GD (1) Petr Hlinený, Tomás Masarík
2023	J	`jnl`	Minimizing an Uncrossed Collection of Drawings. CoRR Petr Hlinený, Tomás Masarík
2023	J	`jnl`	Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$. Electron. J. Comb. Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza
2023	J	`jnl`	The Phase Transition of Discrepancy in Random Hypergraphs. SIAM J. Discret. Math. Calum MacRury, Tomás Masarík, Leilani Pai, Xavier Pérez-Giménez
2023	J	`jnl`	Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor. CoRR Édouard Bonnet, Jedrzej Hodor, Tuukka Korhonen, Tomás Masarík
2022	J	`jnl`	A tight quasi-polynomial bound for Global Label Min-Cut. CoRR Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza
2022	J	`jnl`	Constant Congestion Brambles in Directed Graphs. SIAM J. Discret. Math. Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2022	J	`jnl`	Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artif. Intell. Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
2022	J	`jnl`	Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. CoRR Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
2022	J	`jnl`	Flexibility of planar graphs - Sharpening the tools to get lists of size four. Discret. Appl. Math. Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík
2022	J	`jnl`	Flexible list colorings in graphs with special degeneracy conditions. J. Graph Theory Peter Bradshaw, Tomás Masarík, Ladislav Stacho
2022	J	`jnl`	Linear Bounds for Cycle-Free Saturation Games. Electron. J. Comb. Sean English, Tomás Masarík, Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro
2022	B	`conf`	List Locally Surjective Homomorphisms in Hereditary Graph Classes. ISAAC Pavel Dvorák, Tomás Masarík, Jana Novotná, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk
2022	J	`jnl`	List Locally Surjective Homomorphisms in Hereditary Graph Classes. CoRR Pavel Dvorák, Monika Krawczyk, Tomás Masarík, Jana Novotná, Pawel Rzazewski, Aneta Zuk
2022	A*	`conf`	Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ICALP Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
2022	J	`jnl`	Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument. CoRR Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
2022	J	`jnl`	On 3-Coloring of (2P Algorithmica Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
2022	J	`jnl`	On Weak Flexibility in Planar Graphs. Graphs Comb. Bernard Lidický, Tomás Masarík, Kyle Murphy, Shira Zerbib
2022	J	`jnl`	Packing Directed Cycles Quarter- and Half-Integrally. Comb. Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2022	J	`jnl`	Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P CoRR Linda Cook, Tomás Masarík, Marcin Pilipczuk, Amadeus Reinald, Uéverton S. Souza
2022	J	`jnl`	Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. CoRR Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal
2022	J	`jnl`	Robust Connectivity of Graphs on Surfaces. SIAM J. Discret. Math. Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho
2022	J	`jnl`	Tuza's Conjecture for Threshold Graphs. Discret. Math. Theor. Comput. Sci. Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
2021	J	`jnl`	Constant congestion brambles in directed graphs. CoRR Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2021	J	`jnl`	Flexibility of triangle-free planar graphs. J. Graph Theory Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2021	J	`jnl`	Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
2021	J	`jnl`	Linear Bounds for Cycle-free Saturation Games. CoRR Sean English, Tomás Masarík, Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro
2021	B	`conf`	On 3-Coloring of (2P WG Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
2021	A*	`conf`	Optimal Discretization is Fixed-parameter Tractable. SODA Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge
2021	J	`jnl`	Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. SIAM J. Discret. Math. Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
2021	J	`jnl`	Random 2-cell embeddings of multistars. CoRR Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal
2021	J	`jnl`	Robust Connectivity of Graphs on Surfaces. CoRR Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho
2021	J	`jnl`	Single-conflict colorings of degenerate graphs. CoRR Peter Bradshaw, Tomás Masarík
2021	J	`jnl`	The Phase Transition of Discrepancy in Random Hypergraphs. CoRR Calum MacRury, Tomás Masarík, Leilani Pai, Xavier Pérez-Giménez
2021	J	`jnl`	Tuza's Conjecture for Threshold Graphs. CoRR Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
2020	B	`conf`	Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. IPEC Radek Husek, Dusan Knop, Tomás Masarík
2020	J	`jnl`	Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. CoRR Radek Husek, Dusan Knop, Tomás Masarík
2020	B	`conf`	Clique-Width: Harnessing the Power of Atoms. WG Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
2020	J	`jnl`	Clique-Width: Harnessing the Power of Atoms. CoRR Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
2020	J	`jnl`	Colouring (P Algorithmica Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
2020	A*	`conf`	Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
2020	J	`jnl`	Duality Gap in Interval Linear Programming. J. Optim. Theory Appl. Jana Novotná, Milan Hladík, Tomás Masarík
2020	J	`jnl`	Flexibility of Planar Graphs - Sharpening the Tools to Get Lists of Size Four. CoRR Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík
2020	J	`jnl`	Flexibility of planar graphs of girth at least six. J. Graph Theory Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2020	B	`conf`	Flexible List Colorings in Graphs with Special Degeneracy Conditions. ISAAC Peter Bradshaw, Tomás Masarík, Ladislav Stacho
2020	J	`jnl`	Flexible List Colorings in Graphs with Special Degeneracy Conditions. CoRR Peter Bradshaw, Tomás Masarík, Ladislav Stacho
2020	J	`jnl`	Note on 3-Coloring of (2P CoRR Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
2020	J	`jnl`	On Weak Flexibility in Planar Graphs. CoRR Bernard Lidický, Tomás Masarík, Kyle Murphy, Shira Zerbib
2020	J	`jnl`	On difference graphs and the local dimension of posets. Eur. J. Comb. Jinha Kim, Ryan R. Martin, Tomás Masarík, Warren Shull, Heather C. Smith, Andrew J. Uzzell, Zhiyu Wang
2020	J	`jnl`	Optimal Discretization is Fixed-parameter Tractable. CoRR Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge
2020	J	`jnl`	Parameterized complexity of fair deletion problems. Discret. Appl. Math. Tomás Masarík, Tomás Toufar
2020	B	`conf`	U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. MFCS Jan Kratochvíl, Tomás Masarík, Jana Novotná
2020	J	`jnl`	U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited. CoRR Jan Kratochvíl, Tomás Masarík, Jana Novotná
2019	J	`jnl`	Diversity in Combinatorial Optimization. CoRR Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
2019	J	`jnl`	FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote
2019	J	`jnl`	FPT Algorithms for Diverse Collections of Hitting Sets. CoRR Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote
2019	J	`jnl`	Flexibility of planar graphs of girth at least six. CoRR Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2019	J	`jnl`	Flexibility of planar graphs without 4-cycles. CoRR Tomás Masarík
2019	J	`jnl`	Flexibility of triangle-free planar graphs. CoRR Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2019	J	`jnl`	Jones' Conjecture in subcubic graphs. CoRR Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
2019	A	`conf`	Packing Directed Circuits Quarter-Integrally. ESA Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2019	J	`jnl`	Packing directed circuits quarter-integrally. CoRR Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2019	B	`conf`	Parameterized Complexity of Fair Vertex Evaluation Problems. MFCS Dusan Knop, Tomás Masarík, Tomás Toufar
2019	J	`jnl`	Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Log. Methods Comput. Sci. Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
2019	J	`jnl`	Triangle-free planar graphs with the smallest independence number. J. Graph Theory Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2018	B	`conf`	Colouring (P_r+P_s)-Free Graphs. ISAAC Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
2018	J	`jnl`	Colouring (P_r+P_s)-Free Graphs. CoRR Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
2018	J	`jnl`	Computational complexity of distance edge labeling. Discret. Appl. Math. Dusan Knop, Tomás Masarík
2018	J	`jnl`	Duality Gap in Interval Linear Programming. CoRR Jana Novotná, Milan Hladík, Tomás Masarík
2018	J	`jnl`	Notes on complexity of packing coloring. Inf. Process. Lett. Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender
2018	J	`jnl`	On difference graphs and the local dimension of posets. CoRR Jinha Kim, Ryan R. Martin, Tomás Masarík, Warren Shull, Heather C. Smith, Andrew J. Uzzell, Zhiyu Wang
2018	A	`conf`	Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. STACS Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý
2018	J	`jnl`	Parameterized complexity of fair deletion problems II. CoRR Dusan Knop, Tomás Masarík, Tomás Toufar
2017	J	`jnl`	Notes on complexity of packing coloring. CoRR Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender
2017	J	`jnl`	Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. CoRR Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
2017	C	`conf`	Parameterized Complexity of Fair Deletion Problems. TAMC Tomás Masarík, Tomás Toufar
2017	B	`conf`	Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. WG Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
2017	J	`jnl`	Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. CoRR Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
2016	—	`conf`	Anti-Path Cover on Sparse Graph Classes. MEMICS Pavel Dvorák, Dusan Knop, Tomás Masarík
2016	J	`jnl`	Parameterized complexity of fair deletion problems. CoRR Tomás Masarík, Tomas Toufar
2016	J	`jnl`	Triangle-free planar graphs with the smallest independence number. CoRR Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
2015	C	`conf`	Computational Complexity of Distance Edge Labeling. IWOCA Dusan Knop, Tomás Masarík
2015	J	`jnl`	Computational complexity of distance edge labeling. CoRR Dusan Knop, Tomás Masarík