Jana Novotná

Publication Activity (10 Years)

Years Active: 2017-2023
Publications (10 Years): 35

Top Topics

Minimum Spanning Trees

Top Venues

Publications

Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-width: Harnessing the power of atoms. J. Graph Theory 104 (4) (2023)
Pavel Dvorák, Tomás Masarík, Jana Novotná, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk
List Locally Surjective Homomorphisms in Hereditary Graph Classes. ISAAC (2022)
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
Taming graphs with no large creatures and skinny ladders. CoRR (2022)
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
Taming Graphs with No Large Creatures and Skinny Ladders. ESA (2022)
Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
)-Free Graphs. Algorithmica 84 (6) (2022)
Pavel Dvorák, Monika Krawczyk, Tomás Masarík, Jana Novotná, Pawel Rzazewski, Aneta Zuk
List Locally Surjective Homomorphisms in Hereditary Graph Classes. CoRR (2022)
Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
Tuza's Conjecture for Threshold Graphs. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ICALP (2022)
Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Vertex Deletion into Bipartite Permutation Graphs. Algorithmica 84 (8) (2022)
Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho
Robust Connectivity of Graphs on Surfaces. SIAM J. Discret. Math. 36 (2) (2022)
Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument. CoRR (2022)
Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
-Free Graphs. WG (2021)
Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho
Robust Connectivity of Graphs on Surfaces. CoRR (2021)
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica 83 (8) (2021)
Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
Tuza's Conjecture for Threshold Graphs. CoRR (2021)
Jan Kratochvíl, Tomás Masarík, Jana Novotná
-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. Algorithmica 83 (12) (2021)
Jan Kratochvíl, Tomás Masarík, Jana Novotná
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. MFCS (2020)
Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
)-Free Graphs. CoRR (2020)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-Width: Harnessing the Power of Atoms. CoRR (2020)
Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Vertex Deletion into Bipartite Permutation Graphs. IPEC (2020)
Jana Novotná, Milan Hladík, Tomás Masarík
Duality Gap in Interval Linear Programming. J. Optim. Theory Appl. 184 (2) (2020)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-Width: Harnessing the Power of Atoms. WG (2020)
Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
)-Free Graphs. Algorithmica 82 (7) (2020)
Jan Kratochvíl, Tomás Masarík, Jana Novotná
U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited. CoRR (2020)
Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Vertex deletion into bipartite permutation graphs. CoRR (2020)
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR (2019)
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC (2019)
Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
Colouring (P_r+P_s)-Free Graphs. ISAAC (2018)
Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
Colouring (P_r+P_s)-Free Graphs. CoRR (2018)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer
On the Simultaneous Minimum Spanning Trees Problem. CALDAM (2018)
Jana Novotná, Milan Hladík, Tomás Masarík
Duality Gap in Interval Linear Programming. CoRR (2018)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer
Minimal sum labeling of graphs. J. Discrete Algorithms (2018)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer
Minimal Sum Labeling of Graphs. IWOCA (2017)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer
On the Simultaneous Minimum Spanning Trees Problem. CoRR (2017)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer
Minimal Sum Labeling of Graphs. CoRR (2017)