Christian Hoffmann
- 2010-2011: language student at Donghua University Shanghai, China
- 2005-2010: Ph.D. student and research assistant at Computational Complexity group, Saarland University, Germany
- 1999-2005: student of computer science at Ilmenau University of Technology, Germany
- Email: see last page of the arXiv version of [C3]
Publications
Journal Articles
| [J2] | 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] | A Most General Edge Elimination Polynomial - Thickening of Edges. Fundamenta Informaticae, 98(4):373-378, 2010. Preliminary version: arXiv:0801.1600v1 [math.CO], 2008. |
|
Conference Papers
| [C3] | 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 was not able to attend the conference. Here are some slides (draft) for presentation of the paper. Full paper: arXiv:1007.1146v2 [cs.CC], 2010. |
|
| [C2] | 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]. |
|
| [C1] | 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] | Computational Complexity of Graph Polynomials. Dissertation (Doctoral Thesis), Saarland University, Germany, 2010. |
|
| [T1] | Theoretische und experimentelle Untersuchungen zu einem hocheffizienten randomisierten Primzahltest. Diplomarbeit (Diploma Thesis), Technische Universität Ilmenau, Germany, 2005. |
|
Peer Reviews
- of submissions to the following conferences: MFCS 2009, STACS 2010, ISAAC 2010.
Copyright Notice: The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.