11 citations · 24 across the 3 of their papers we have counts for
4 papers
Exponential Time Complexity of Weighted Counting of Independent Sets
Christian Hoffmann
We consider weighted counting of independent sets using a rational weight x: Given a graph with n vertices, count its independent sets such that each set of size k contributes x^k.…
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Markus Bläser, Christian Hoffmann
We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollobas, and Sorkin (2004) an…
A Most General Edge Elimination Polynomial - Thickening of Edges
Christian Hoffmann
We consider a graph polynomial ξ(G;x,y,z) introduced by Averbouch, Godlin, and Makowsky (2007). This graph polynomial simultaneously generalizes the Tutte polynomial as well as a b…
On the Complexity of the Interlace Polynomial
Markus Bläser, Christian Hoffmann
We consider the two-variable interlace polynomial introduced by Arratia, Bollobas and Sorkin (2004). We develop graph transformations which allow us to derive point-to-point reduct…