Personal information

Verified email addresses

Verified email domains

Activities

Education and qualifications (2)

Faculty of Mathematics and Physics, Charles University: Prague, CZ

Education
Source: Self-asserted source
Jana Masaříková

Faculty of Mathematics, Informatics and Mechanics; University of Warsaw: Warsaw, PL

2019 to present
Education
Source: Self-asserted source
Jana Masaříková

Works (14)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás’ path argument

ACM Transactions on Computation Theory
2024-01-24 | Journal article
Part of ISSN: 1942-3454
Part of ISSN: 1942-3462
Contributors: Konrad Majewski; Tomáš Masařík; Jana Masaříková; Karolina Okrasa; Marcin Pilipczuk; Paweł Rzążewski; Marek Sokołowski
Source: Self-asserted source
Jana Masaříková
grade
Preferred source (of 2)‎

Clique‐width: Harnessing the power of atoms

Journal of Graph Theory
2023-12 | Journal article
Contributors: Konrad K. Dabrowski; Tomáš Masařík; Jana Novotná; Daniël Paulusma; Paweł Rzążewski
Source: check_circle
Crossref
grade
Preferred source (of 4)‎

List Locally Surjective Homomorphisms in Hereditary Graph Classes

ISAAC 2022
2022 | Conference paper
Contributors: Pavel Dvořák; Tomáš Masařík; Jana Novotná; Monika Krawczyk; Paweł Rzążewski; Aneta Żuk
Source: Self-asserted source
Jana Masaříková

Taming Graphs with No Large Creatures and Skinny Ladders

ESA 2022
2022 | Conference paper
Contributors: Jakub Gajarský; Lars Jaffke; Paloma T. Lima; Jana Novotná; Marcin Pilipczuk; Paweł Rzążewski; Uéverton S. Souza
Source: Self-asserted source
Jana Masaříková

Tuza's Conjecture for Threshold Graphs

Discrete Mathematics & Theoretical Computer Science
2022-08-14 | Journal article
Part of ISSN: 1365-8050
Contributors: Marthe Bonamy; Łukasz Bożyk; Andrzej Grzesik; Meike Hatzel; Tomáš Masařík; Jana Novotná; Karolina Okrasa
Source: Self-asserted source
Jana Masaříková

On 3-Coloring of ($$2P_4,C_5$$)-Free Graphs

Algorithmica
2022-06 | Journal article
Contributors: Vít Jelínek; Tereza Klimošová; Tomáš Masařík; Jana Novotná; Aneta Pokorná
Source: check_circle
Crossref
grade
Preferred source (of 3)‎

Robust Connectivity of Graphs on Surfaces

SIAM Journal on Discrete Mathematics
2022-06 | Journal article
Part of ISSN: 0895-4801
Part of ISSN: 1095-7146
Contributors: Peter Bradshaw; Tomáš Masařík; Jana Novotná; Ladislav Stacho
Source: Self-asserted source
Jana Masaříková

Vertex Deletion into Bipartite Permutation Graphs

Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2020 | Journal article
Source: Self-asserted source
Jana Masaříková
grade
Preferred source (of 4)‎

U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited

Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2020-08-18 | Journal article
Source: Self-asserted source
Jana Masaříková
grade
Preferred source (of 5)‎

Subexponential-time algorithms for finding large induced sparse subgraphs

2019-10-02 | Preprint
EID:

2-s2.0-85077443123

Source: Self-asserted source
Jana Masaříková
grade
Preferred source (of 2)‎

Colouring (P_r+P_s)-Free Graphs

2018 | Journal article
EID:

2-s2.0-85062281317

Source: Self-asserted source
Jana Masaříková
grade
Preferred source (of 3)‎

Minimal sum labeling of graphs

Journal of Discrete Algorithms
2018 | Journal article
EID:

2-s2.0-85056312638

Contributors: Konečný, M.; Kučera, S.; Novotná, J.; Pekárek, J.; Šimsa, Š.; Töpfer, M.
Source: Self-asserted source
Jana Masaříková via Scopus - Elsevier
grade
Preferred source (of 4)‎

On the simultaneous minimum spanning trees problem

Communications in Computer and Information Science
2018 | Book
EID:

2-s2.0-85042094366

Contributors: Konečný, M.; Kučera, S.; Novotná, J.; Pekárek, J.; Smolík, M.; Tětek, J.; Töpfer, M.
Source: Self-asserted source
Jana Masaříková via Scopus - Elsevier

Duality Gap in Interval Linear Programming

Journal of Optimization Theory and Applications 184(2), 565-580, 2020
2018-02-15 | Preprint
Source: Self-asserted source
Jana Masaříková
grade
Preferred source (of 3)‎

Peer review (2 reviews for 2 publications/grants)

Review activity for Algorithmica. (1)
Review activity for Discrete applied mathematics. (1)