scientific article; zbMATH DE number 7236450
From MaRDI portal
Publication:5115814
DOI10.4230/LIPIcs.SoCG.2018.46zbMath1496.57027MaRDI QIDQ5115814
Jonathan Spreer, Kristóf Huszár, Uli Wagner
Publication date: 18 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
treewidthcongestionthin positionfixed-parameter tractabilitycomputational topologytriangulations of 3-manifolds
Related Items (4)
A polynomial-time algorithm to compute Turaev-Viro invariants \(\mathrm{TV}_{4,q}\) of 3-manifolds with bounded first Betti number ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algorithms and complexity for Turaev-Viro invariants
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Courcelle's theorem for triangulations
- Fundamentals of parameterized complexity
- The homeomorphism problem for closed 3-manifolds
- Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
- Notes on Perelman's papers
- Graph minors. I. Excluding a forest
- Foliations and the topology of 3-manifolds. III
- On embedding graphs in trees
- Graphs with small bandwidth and cutwidth
- On the boundary curves of incompressible surfaces
- A partial k-arboretum of graphs with bounded treewidth
- Call routing and the ratcatcher
- Heegaard structures of negatively curved 3-manifolds
- Small 3-manifolds of large genus
- Integer homology 3-spheres admit irreducible representations in \(\mathrm{SL}(2,{\mathbb C})\)
- Computational geometric and algebraic topology. Abstracts from the workshop held October 11--17, 2015
- Minimal congestion trees
- Thin position and the recognition problem for \(S^ 3\)
- Geometrisation of 3-manifolds
- The efficient certification of knottedness and Thurston norm
- Algorithmic homeomorphism of 3-manifolds as a corollary of geometrization
- Some conditionally hard problems on links and 3-manifolds
- Knottedness is in NP, modulo GRH
- The computational complexity of basic decision problems in 3-dimensional topology
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Affine structures in 3-manifolds. V: The triangulation theorem and Hauptvermutung
- Lecture Notes on Generalized Heegaard Splittings
- Parameterized Complexity of Discrete Morse Theory
- Graph Theory
- Algorithms and Complexity for Turaev-Viro Invariants
- Graph minors. II. Algorithmic aspects of tree-width
- A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number.
- Thin position for knots and 3-manifolds: a unified approach
- SOFSEM 2005: Theory and Practice of Computer Science
- The complexity of detecting taut angle structures on triangulations
This page was built for publication:
