Classes
Publications
- d-collapsibility is NP-complete for d greater or equal to 42009 | Faculty of Mathematics and Physics
- Dimension gaps between representability and collapsibility2009 | Faculty of Mathematics and Physics
- Hardness of Embedding Simplicial Complexes in R^d2009 | Faculty of Mathematics and Physics
- List-Coloring Squares of Sparse Subcubic Graphs2008 | 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
- 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
Loading network view...