BibTeX records: Christian Hoffmann 0001

download as .bib file

@phdthesis{DBLP:phd/dnb/Hoffmann11,
  author       = {Christian Hoffmann},
  title        = {Computational complexity of graph polynomials},
  school       = {Saarland University},
  year         = {2011},
  url          = {http://scidok.sulb.uni-saarland.de/volltexte/2011/3681/},
  urn          = {urn:nbn:de:bsz:291-scidok-36816},
  timestamp    = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/dnb/Hoffmann11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BlaserH11,
  author       = {Markus Bl{\"{a}}ser and
                  Christian Hoffmann},
  title        = {Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth},
  journal      = {Algorithmica},
  volume       = {61},
  number       = {1},
  pages        = {3--35},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9439-4},
  doi          = {10.1007/S00453-010-9439-4},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BlaserH11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/fuin/Hoffmann10,
  author       = {Christian Hoffmann},
  title        = {A Most General Edge Elimination Polynomial - Thickening of Edges},
  journal      = {Fundam. Informaticae},
  volume       = {98},
  number       = {4},
  pages        = {373--378},
  year         = {2010},
  url          = {https://doi.org/10.3233/FI-2010-233},
  doi          = {10.3233/FI-2010-233},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/fuin/Hoffmann10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwpec/Hoffmann10,
  author       = {Christian Hoffmann},
  editor       = {Venkatesh Raman and
                  Saket Saurabh},
  title        = {Exponential Time Complexity of Weighted Counting of Independent Sets},
  booktitle    = {Parameterized and Exact Computation - 5th International Symposium,
                  {IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6478},
  pages        = {180--191},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-17493-3\_18},
  doi          = {10.1007/978-3-642-17493-3\_18},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/Hoffmann10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1007-1146,
  author       = {Christian Hoffmann},
  title        = {Exponential Time Complexity of Weighted Counting of Independent Sets},
  journal      = {CoRR},
  volume       = {abs/1007.1146},
  year         = {2010},
  url          = {http://arxiv.org/abs/1007.1146},
  eprinttype    = {arXiv},
  eprint       = {1007.1146},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1007-1146.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/BlaserH09,
  author       = {Markus Bl{\"{a}}ser and
                  Christian Hoffmann},
  editor       = {Amos Fiat and
                  Peter Sanders},
  title        = {Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth},
  booktitle    = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
                  Denmark, September 7-9, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5757},
  pages        = {623--634},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-04128-0\_56},
  doi          = {10.1007/978-3-642-04128-0\_56},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/BlaserH09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0902-1693,
  author       = {Markus Bl{\"{a}}ser and
                  Christian Hoffmann},
  title        = {Fast computation of interlace polynomials on graphs of bounded treewidth},
  journal      = {CoRR},
  volume       = {abs/0902.1693},
  year         = {2009},
  url          = {http://arxiv.org/abs/0902.1693},
  eprinttype    = {arXiv},
  eprint       = {0902.1693},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0902-1693.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/BlaserH08,
  author       = {Markus Bl{\"{a}}ser and
                  Christian Hoffmann},
  editor       = {Susanne Albers and
                  Pascal Weil},
  title        = {On the Complexity of the Interlace Polynomial},
  booktitle    = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
                  Science, Bordeaux, France, February 21-23, 2008, Proceedings},
  series       = {LIPIcs},
  volume       = {1},
  pages        = {97--108},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year         = {2008},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2008.1337},
  doi          = {10.4230/LIPICS.STACS.2008.1337},
  timestamp    = {Tue, 22 Jun 2021 15:44:08 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BlaserH08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0801-1600,
  author       = {Christian Hoffmann},
  title        = {A Most General Edge Elimination Polynomial - Thickening of Edges},
  journal      = {CoRR},
  volume       = {abs/0801.1600},
  year         = {2008},
  url          = {http://arxiv.org/abs/0801.1600},
  eprinttype    = {arXiv},
  eprint       = {0801.1600},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0801-1600.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0707-4565,
  author       = {Markus Bl{\"{a}}ser and
                  Christian Hoffmann},
  title        = {On the Complexity of the Interlace Polynomial},
  journal      = {CoRR},
  volume       = {abs/0707.4565},
  year         = {2007},
  url          = {http://arxiv.org/abs/0707.4565},
  eprinttype    = {arXiv},
  eprint       = {0707.4565},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0707-4565.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.