Christian Hoffmann

Publications

Journal Articles

[J2] Markus Bläser, Christian Hoffmann.
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth.
Algorithmica, 61(1):3-35, 2011.
Also available as: arXiv:0902.1693 [cs.DS], 2009.
[J1] Christian Hoffmann.
A Most General Edge Elimination Polynomial - Thickening of Edges.
Fundamenta Informaticae, 98(4):373-378, 2010.
Preliminary version: arXiv:0801.1600v1 [math.CO], 2008.
PDF

Conference Papers

[C3] Christian Hoffmann.
Exponential Time Complexity of Weighted Counting of Independent Sets.
In Venkatesh Raman und Saket Saurabh (Eds.): Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings. vol. 6478 of Lecture Notes in Computer Science, pp. 180-191, Springer 2010.
For some visa issues, I could not attend the conference. Here are some slides (draft) for presentation of the paper.
Full paper: arXiv:1007.1146v2 [cs.CC], 2010.
[C2] Markus Bläser, Christian Hoffmann.
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth.
In Amos Fiat, Peter Sanders (Eds.): Algorithms – ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009, Proceedings, vol. 5757 of Lecture Notes in Computer Science, pp. 623-634, Springer 2009.
Full version: [J2].
PDF
[C1] Markus Bläser, Christian Hoffmann.
On the Complexity of the Interlace Polynomial.
In Susanne Albers and Pascal Weil (Eds.): Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), urn:nbn:de:0030-drops-13378.
Updated full paper: arXiv:0707.4565v3 [cs.CC], 2008.

Thesis

[T2] Christian Hoffmann.
Computational Complexity of Graph Polynomials.
Dissertation (Doctoral Thesis), Saarland University, Germany, 2010.
[T1] Christian Hoffmann.
Theoretische und experimentelle Untersuchungen zu einem hocheffizienten randomisierten Primzahltest.
Diplomarbeit (Diploma Thesis), Technische Universitšt Ilmenau, Germany, 2005.
PDF