| Colouring (P r+ P s)-Free Graphs T Klimošová, J Malík, T Masařík, J Novotná, D Paulusma, V Slívová Algorithmica, 1-26, 2020 | 12 | 2020 |
| Subexponential-time algorithms for finding large induced sparse subgraphs J Novotná, K Okrasa, M Pilipczuk, P Rzążewski, EJ van Leeuwen, ... Algorithmica, 1-17, 2020 | 4 | 2020 |
| Duality gap in interval linear programming J Novotná, M Hladík, T Masařík Journal of Optimization Theory and Applications 184 (2), 565-580, 2020 | 4 | 2020 |
| U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited J Kratochvíl, T Masařík, J Novotná arXiv preprint arXiv:2002.08311, 2020 | 2 | 2020 |
| Clique-Width: Harnessing the Power of Atoms KK Dabrowski, T Masařík, J Novotná, D Paulusma, P Rzążewski arXiv preprint arXiv:2006.03578, 2020 | 1 | 2020 |
| Computational and structural apects of interval graphs and their variants J Novotná Univerzita Karlova, Matematicko-fyzikální fakulta, 2019 | | 2019 |
| Minimal sum labeling of graphs M Konečný, S Kučera, J Novotná, J Pekárek, Š Šimsa, M Töpfer Journal of Discrete Algorithms 52, 29-37, 2018 | | 2018 |
| On the Simultaneous Minimum Spanning Trees Problem M Konečný, S Kučera, J Novotná, J Pekárek, M Smolík, J Tětek, M Töpfer Conference on Algorithms and Discrete Applied Mathematics, 235-248, 2018 | | 2018 |
| Dualita v intervalovém lineárním programování J Novotná Univerzita Karlova, Matematicko-fyzikální fakulta, 2016 | | 2016 |
Tomáš MasaříkSimon Fraser UniversityVerified email at kam.mff.cuni.cz
