Classes
Publications
- 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
- Optimal bounds for the colorful fractional Helly theorem2021 | Faculty of Mathematics and Physics
- SHELLINGS AND SHEDDINGS INDUCED BY COLLAPSES2021 | Faculty of Mathematics and Physics
- Shellability is NP-complete +12018 | Faculty of Mathematics and Physics
- Recognition of Collapsible Complexes is NP-Complete2016 | Faculty of Mathematics and Physics
- A Counterexample to Wegner's Conjecture on Good Covers2012 | Faculty of Mathematics and Physics
- Strong d-collapsibility2011 | Faculty of Mathematics and Physics
- 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
Loading network view...