Publikace
- Bears with Hats and Independence Polynomials2021 | Matematicko-fyzikální fakulta
- Parameterized Inapproximability of Independent Set in H-Free Graphs +12020 | Matematicko-fyzikální fakulta
- On Induced Online Ramsey Number of Paths, Cycles, and Trees2019 | Matematicko-fyzikální fakulta
- Solving Integer Linear Programs with a Small Number of Global Variables and Constraints2017 | Matematicko-fyzikální fakulta
- Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters +12023 | Matematicko-fyzikální fakulta
- List Locally Surjective Homomorphisms in Hereditary Graph Classes2022 | Matematicko-fyzikální fakulta
- PARAMETERIZED APPROXIMATION SCHEMES FOR STEINER TREES WITH SMALL NUMBER OF STEINER VERTICES2021 | Matematicko-fyzikální fakulta
- Barrington Plays Cards: The Complexity of Card-Based Protocols2021 | Matematicko-fyzikální fakulta
- Data Structures Lower Bounds and Popular Conjectures2021 | Matematicko-fyzikální fakulta
- Lower Bounds for Semi-adaptive Data Structures via Corruption2020 | Matematicko-fyzikální fakulta
Loading network view...