On the Simultaneous Minimum Spanning Trees Problem. - Matej Konecný; Stanislav Kucera; Jana Novotná 001; Jakub Pekárek; Martin Smolík; Jakub Tetek; Martin Töpfer 002 (CALDAM, 2018)

Colouring (P_r+P_s)-Free Graphs. - Tereza Klimosová; Josef Malík; Tomás Masarík; Jana Novotná 001; Daniël Paulusma; Veronika Slívová (ISAAC, 2018)

Minimal sum labeling of graphs. - Matej Konecný; Stanislav Kucera; Jana Novotná 001; Jakub Pekárek; Stepán Simsa; Martin Töpfer 002 (J. Discrete Algorithms, 2018)

U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. - Jan Kratochvíl; Tomás Masarík; Jana Novotná 001 (MFCS, 2020)

Colouring (Pr + Ps)-Free Graphs. - Tereza Klimosová; Josef Malík; Tomás Masarík; Jana Novotná 001; Daniël Paulusma; Veronika Slívová (Algorithmica, 2020)

Note on 3-Coloring of (2P4, C5)-Free Graphs. - Vít Jelínek; Tereza Klimosová; Tomás Masarík; Jana Novotná 001; Aneta Pokorná (CoRR, 2020)

Duality Gap in Interval Linear Programming. - Jana Novotná 001; Milan Hladík; Tomás Masarík (J. Optim. Theory Appl., 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á 001 (Algorithmica, 2021)

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. - Jana Novotná 001; Karolina Okrasa; Michal Pilipczuk; Pawel Rzazewski; Erik Jan van Leeuwen; Bartosz Walczak (Algorithmica, 2021)

List Locally Surjective Homomorphisms in Hereditary Graph Classes. - Pavel Dvorák; Tomás Masarík; Jana Novotná 001; Monika Krawczyk; Pawel Rzazewski; Aneta Zuk (ISAAC, 2022)

Vertex Deletion into Bipartite Permutation Graphs. - Lukasz Bozyk; Jan Derbisz; Tomasz Krawczyk; Jana Novotná 001; Karolina Okrasa (Algorithmica, 2022)

On 3-Coloring of (2P4, C5)-Free Graphs. - Vít Jelínek; Tereza Klimosová; Tomás Masarík; Jana Novotná 001; Aneta Pokorná (Algorithmica, 2022)

Tuza's Conjecture for Threshold Graphs. - Marthe Bonamy; Lukasz Bozyk; Andrzej Grzesik; Meike Hatzel; Tomás Masarík; Jana Novotná 001; Karolina Okrasa (Discret. Math. Theor. Comput. Sci., 2022)

Robust Connectivity of Graphs on Surfaces. - Peter Bradshaw; Tomás Masarík; Jana Novotná 001; Ladislav Stacho (SIAM J. Discret. Math., 2022)

Clique-width: Harnessing the power of atoms. - Konrad K. Dabrowski; Tomás Masarík; Jana Novotná 001; Daniël Paulusma; Pawel Rzazewski (J. Graph Theory, 2023)

Separator Theorem and Algorithms for Planar Hyperbolic Graphs. - Sándor Kisfaludi-Bak; Jana Masaríková; Erik Jan van Leeuwen; Bartosz Walczak; Karol Wegrzycki (SoCG, 2024)

Taming Graphs with No Large Creatures and Skinny Ladders. - Jakub Gajarský; Lars Jaffke; Paloma T. Lima; Jana Masaríková; Marcin Pilipczuk; Pawel Rzazewski; Uéverton S. Souza (SIAM J. Discret. Math., 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 001 (ACM Trans. Comput. Theory, 2024)

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 (MFCS, 2025)

Path Eccentricity and Forbidden Induced Subgraphs. - Sylwia Cichacz; Claire Hilaire; Tomás Masarík; Jana Masaríková; Martin Milanic (CoRR, 2025)