Classes
Publications
- Embeddability in R-3 is NP-hard2020 | Faculty of Mathematics and Physics
- Pach's Selection Theorem Does Not Admit a Topological Extension2018 | Faculty of Mathematics and Physics
- Embeddability in R3 is NP-hard2018 | Faculty of Mathematics and Physics
- NERVES OF GOOD COVERS ARE ALGORITHMICALLY UNRECOGNIZABLE2013 | Faculty of Mathematics and Physics
- Hardness of embedding simplicial complexes in R^d2011 | Faculty of Mathematics and Physics
- Hardness of Embedding Simplicial Complexes in R^d2009 | Faculty of Mathematics and Physics
- 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
Loading network view...