BibTeX records: John D. Faben

• > Home > Persons > John D. Faben

@inproceedings{DBLP:conf/fun/EnrightF16,
  author       = {Jessica A. Enright and
                  John D. Faben},
  editor       = {Erik D. Demaine and
                  Fabrizio Grandoni},
  title        = {Building a Better Mouse Maze},
  booktitle    = {8th International Conference on Fun with Algorithms, {FUN} 2016, June
                  8-10, 2016, La Maddalena, Italy},
  series       = {LIPIcs},
  volume       = {49},
  pages        = {15:1--15:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.FUN.2016.15},
  doi          = {10.4230/LIPICS.FUN.2016.15},
  timestamp    = {Tue, 03 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/fun/EnrightF16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toc/FabenJ15,
  author       = {John D. Faben and
                  Mark Jerrum},
  title        = {The Complexity of Parity Graph Homomorphism: An Initial Investigation},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {35--57},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a002},
  doi          = {10.4086/TOC.2015.V011A002},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/FabenJ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/FabenJ13,
  author       = {John D. Faben and
                  Mark Jerrum},
  title        = {The complexity of parity graph homomorphism: an initial investigation},
  journal      = {CoRR},
  volume       = {abs/1309.4033},
  year         = {2013},
  url          = {http://arxiv.org/abs/1309.4033},
  eprinttype    = {arXiv},
  eprint       = {1309.4033},
  timestamp    = {Sun, 24 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/FabenJ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0809-1836,
  author       = {John D. Faben},
  title        = {The complexity of counting solutions to Generalised Satisfiability
                  Problems modulo k},
  journal      = {CoRR},
  volume       = {abs/0809.1836},
  year         = {2008},
  url          = {http://arxiv.org/abs/0809.1836},
  eprinttype    = {arXiv},
  eprint       = {0809.1836},
  timestamp    = {Sun, 24 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0809-1836.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}