We stand with Ukraine  

Christian Hoffmann

Affiliations:
  • Saarland University, Department of Computer Science, Germany


According to our database1, Christian Hoffmann authored at least 6 papers between 2008 and 2011.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Computational complexity of graph polynomials.
[BibTeX]
[DOI]
Christian Hoffmann
PhD thesis, 2011

Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth.
[BibTeX]
[DOI]
Markus Bläser
,
Christian Hoffmann
Algorithmica, 2011

2010
A Most General Edge Elimination Polynomial - Thickening of Edges.
[BibTeX]
[DOI]
Christian Hoffmann
Fundam. Informaticae, 2010

Exponential Time Complexity of Weighted Counting of Independent Sets.
[BibTeX]
[DOI]
Christian Hoffmann
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

2009
Fast computation of interlace polynomials on graphs of bounded treewidth
[BibTeX]
[DOI]
Markus Bläser
,
Christian Hoffmann
CoRR, 2009

2008
On the Complexity of the Interlace Polynomial.
[BibTeX]
[DOI]
Markus Bläser
,
Christian Hoffmann
Proceedings of the STACS 2008, 2008


  Loading...