The following pages link to Christian Hoffmann (Q634678):
Displaying 5 items.
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- Exponential Time Complexity of Weighted Counting of Independent Sets (Q3058702) (← links)
- A Most General Edge Elimination Polynomial – Thickening of Edges (Q3561219) (← links)
- Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth (Q3639277) (← links)
- On the Complexity of the Interlace Polynomial (Q4910711) (← links)
