Jana Novotná

34 papers A* 1A 1B 7C 1Journal 23Unranked 1
YearRankTypeTitle / Venue / Authors
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
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
Robust Connectivity of Graphs on Surfaces.
SIAM J. Discret. Math.
Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho
2022 A conf
Taming Graphs with No Large Creatures and Skinny Ladders.
ESA
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2022 J jnl
Taming graphs with no large creatures and skinny ladders.
CoRR
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
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
2022 J jnl
Vertex Deletion into Bipartite Permutation Graphs.
Algorithmica
Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
2021 B conf
On 3-Coloring of (2P
WG
Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná
2021 J jnl
Robust Connectivity of Graphs on Surfaces.
CoRR
Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho
2021 J jnl
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
Algorithmica
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
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
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 J jnl
Duality Gap in Interval Linear Programming.
J. Optim. Theory Appl.
Jana Novotná, Milan Hladík, Tomás Masarík
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 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á
2020 B conf
Vertex Deletion into Bipartite Permutation Graphs.
IPEC
Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
2020 J jnl
Vertex deletion into bipartite permutation graphs.
CoRR
Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
2019 B conf
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
IPEC
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2019 J jnl
Subexponential-time algorithms for finding large induced sparse subgraphs.
CoRR
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
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
Duality Gap in Interval Linear Programming.
CoRR
Jana Novotná, Milan Hladík, Tomás Masarík
2018 J jnl
Minimal sum labeling of graphs.
J. Discrete Algorithms
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer
2018 — conf
On the Simultaneous Minimum Spanning Trees Problem.
CALDAM
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer
2017 C conf
Minimal Sum Labeling of Graphs.
IWOCA
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer
2017 J jnl
Minimal Sum Labeling of Graphs.
CoRR
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer
2017 J jnl
On the Simultaneous Minimum Spanning Trees Problem.
CoRR
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer