- NP-HARDNESS OF COMPUTING PL GEOMETRIC CATEGORY IN DIMENSION2023 | Faculty of Mathematics and Physics
- Weak Saturation of Multipartite Hypergraphs2023 | Faculty of Mathematics and Physics
- Shellability Is Hard Even for Balls2023 | Faculty of Mathematics and Physics
- Barycentric Cuts Through a Convex Body2022 | Faculty of Mathematics and Physics
- Parameterized Complexity of Untangling Knots2022 | Faculty of Mathematics and Physics
- Even Maps, the Colin de Verdiere Number and Representations of Graphs2022 | Faculty of Mathematics and Physics
- Optimal bounds for the colorful fractional Helly theorem2021 | Faculty of Mathematics and Physics
- SHELLINGS AND SHEDDINGS INDUCED BY COLLAPSES2021 | Faculty of Mathematics and Physics
- The unbearable hardness of unknotting2021 | Faculty of Mathematics and Physics
- On the growth of the Mobius function of permutations2020 | Faculty of Mathematics and Physics

Loading network view...