- Embeddability in R3 is NP-hard2018 | Faculty of Mathematics and Physics
- Embeddability in the 3-Sphere Is Decidable2018 | Faculty of Mathematics and Physics
- Varieties of differential modules embeddable into semimodules2009 | Faculty of Mathematics and Physics
- Embeddability in the 3-sphere is decidable2014 | Faculty of Mathematics and Physics
- Non-Embeddability of Geometric Lattices and Buildings2014 | Faculty of Mathematics and Physics
- Embeddability in R-3 is NP-hard2020 | Faculty of Mathematics and Physics
- High girth and embeddability1996 | Faculty of Mathematics and Physics
- On L-shaped point set embeddings of trees: First non-embeddable examples2020 | Faculty of Mathematics and Physics
- 2-colored point-set embeddability of the outerplanar graphs2018 | Faculty of Mathematics and Physics
- Embeddability of l(p) and bases in Lipschitz free p-spaces for 0 < p <= 12020 | Faculty of Mathematics and Physics
- Shellability Is Hard Even for Balls2023 | Faculty of Mathematics and Physics
- ON GENERALIZED HEAWOOD INEQUALITIES FOR MANIFOLDS: A VAN KAMPEN-FLORES-TYPE NONEMBEDDABILITY RESULT2017 | Faculty of Mathematics and Physics
- Algorithmic Solvability of the Lifting-Extension Problem2017 | Faculty of Mathematics and Physics
- Avoidable structures, II: Finite distributive lattices and nicely structured ordered sets2009 | Faculty of Mathematics and Physics
- Optimization via enumeration: a new algorithm for the Max Cut problem2001 | Faculty of Mathematics and Physics
- A new algorithm for the Ising problem2000 | Faculty of Mathematics and Physics
- Definability in Substructure Orderings, II: Finite Ordered Sets2010 | Faculty of Mathematics and Physics
- Shortest path embeddings of graphs on surfaces2016 | Faculty of Mathematics and Physics
- Shortest Path Embeddings of Graphs on Surfaces2017 | Faculty of Mathematics and Physics
- Defective Colouring of Graphs Excluding A Subgraph or Minor2019 | Faculty of Mathematics and Physics
- Human and Divine : The King's Two Bodies and The Royal Paradigm in Fifth Dynasty Egypt2017 | Faculty of Arts
- NERVES OF GOOD COVERS ARE ALGORITHMICALLY UNRECOGNIZABLE2013 | Faculty of Mathematics and Physics
- ISOMETRIC EMBEDDING OF l1 INTO LIPSCHITZ-FREE SPACES AND l(infinity) INTO THEIR DUALS2017 | Faculty of Mathematics and Physics
- Hardness of embedding simplicial complexes in R^d2011 | Faculty of Mathematics and Physics
- Bounding Helly numbers via Betti numbers +12017 | Faculty of Mathematics and Physics
- Single-conflict colouring2021 | Faculty of Mathematics and Physics
- Inapproximability for metric embeddings into R^d2008 | Faculty of Mathematics and Physics
- Hardness of almost embedding simplicial complexes in R^d2019 | Faculty of Mathematics and Physics
- Universal Sets for Straight-Line Embeddings of Bicolored Graphs2013 | Faculty of Mathematics and Physics