Classes
Publications
- Weak Saturation of Multipartite Hypergraphs2023 | Faculty of Mathematics and Physics
- Parameterized Complexity of Untangling Knots2022 | Faculty of Mathematics and Physics
- Shellability is NP-complete +12018 | Faculty of Mathematics and Physics
- ON GENERALIZED HEAWOOD INEQUALITIES FOR MANIFOLDS: A VAN KAMPEN-FLORES-TYPE NONEMBEDDABILITY RESULT2017 | Faculty of Mathematics and Physics
- Recognition of Collapsible Complexes is NP-Complete2016 | Faculty of Mathematics and Physics
- On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result2015 | Faculty of Mathematics and Physics
- On the Complexity of Planar Covering of Small Graphs2011 | Faculty of Mathematics and Physics
- d-collapsibility is NP-complete for d greater or equal to 42009 | Faculty of Mathematics and Physics
- NP-HARDNESS OF COMPUTING PL GEOMETRIC CATEGORY IN DIMENSION2023 | Faculty of Mathematics and Physics
- Shellability Is Hard Even for Balls2023 | Faculty of Mathematics and Physics
Loading network view...
