The following pages link to Martin Tancer (Q249463):
Displaying 10 items.
- (Q5499915) (← links)
- Recognition of collapsible complexes is NP-complete (Q5964219) (← links)
- (Q6060013) (← links)
- NP-Hardness of Computing PL Geometric Category in Dimension 2 (Q6077977) (← links)
- Weak saturation of multipartite hypergraphs (Q6143930) (← links)
- Embeddings of \(k\)-complexes into \(2k\)-manifolds (Q6204767) (← links)
- Pach's animal problem within the bounding box (Q6523819) (← links)
- Parameterized complexity of untangling knots (Q6560886) (← links)
- Algorithms in 4-manifold topology (Q6753318) (← links)
- A note on the computational complexity of weak saturation (Q6764009) (← links)