Jana Masaríková

According to our database, Jana Masaríková authored at least 22 papers between 2017 and 2025.

Collaborative distances:

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

2025

Burling graphs in graphs with large chromatic number.

Tara Abrishami, Marcin Brianski, James Davies, Xiying Du, Jana Masaríková, Pawel Rzazewski, Bartosz Walczak

CoRR, October, 2025

Constricting the Computational Complexity Gap of the 4-Coloring Problem in (P_t,C₃)-free Graphs.

Justyna Jaworska, Bartlomiej Kielak, Tomás Masarík, Jana Masaríková

CoRR, September, 2025

Path Eccentricity and Forbidden Induced Subgraphs.

Sylwia Cichacz, Claire Hilaire, Tomás Masarík, Jana Masaríková, Martin Milanic

CoRR, March, 2025

Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument.

Romain Bourneuf, Jana Masaríková, Wojciech Nadara, Marcin Pilipczuk

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024

Separator Theorem and Algorithms for Planar Hyperbolic Graphs.

Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2022

Robust Connectivity of Graphs on Surfaces.

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

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

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

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 Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Taming Graphs with No Large Creatures and Skinny Ladders.

Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

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

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

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

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

2020

Duality Gap in Interval Linear Programming.

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

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

Clique-Width: Harnessing the Power of Atoms.

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

Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

Vertex Deletion into Bipartite Permutation Graphs.

Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa

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

2019

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.

Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

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

On the Simultaneous Minimum Spanning Trees Problem.

Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Minimal Sum Labeling of Graphs.

Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017