BibTeX records: Simon Straub

download as .bib file

@article{DBLP:journals/mst/StraubTW16,
  author       = {Simon Straub and
                  Thomas Thierauf and
                  Fabian Wagner},
  title        = {Counting the Number of Perfect Matchings in {K} 5-Free Graphs},
  journal      = {Theory Comput. Syst.},
  volume       = {59},
  number       = {3},
  pages        = {416--439},
  year         = {2016},
  url          = {https://doi.org/10.1007/s00224-015-9645-1},
  doi          = {10.1007/S00224-015-9645-1},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/StraubTW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/GurjarKMST16,
  author       = {Rohit Gurjar and
                  Arpita Korwar and
                  Jochen Messner and
                  Simon Straub and
                  Thomas Thierauf},
  title        = {Planarizing Gadgets for Perfect Matching Do Not Exist},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {4},
  pages        = {14:1--14:15},
  year         = {2016},
  url          = {https://doi.org/10.1145/2934310},
  doi          = {10.1145/2934310},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/GurjarKMST16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Straub15,
  author       = {Simon Straub},
  title        = {Gadgets for perfect matching problems},
  school       = {University of Ulm, Germany},
  year         = {2015},
  url          = {https://d-nb.info/1082443174},
  timestamp    = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/dnb/Straub15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/StraubTW14,
  author       = {Simon Straub and
                  Thomas Thierauf and
                  Fabian Wagner},
  title        = {Counting the Number of Perfect Matchings in K5-Free Graphs},
  booktitle    = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
                  BC, Canada, June 11-13, 2014},
  pages        = {66--77},
  publisher    = {{IEEE} Computer Society},
  year         = {2014},
  url          = {https://doi.org/10.1109/CCC.2014.15},
  doi          = {10.1109/CCC.2014.15},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/StraubTW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/StraubTW14,
  author       = {Simon Straub and
                  Thomas Thierauf and
                  Fabian Wagner},
  title        = {Counting the Number of Perfect Matchings in K\({}_{\mbox{5}}\)-free
                  Graphs},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR14-079}},
  year         = {2014},
  url          = {https://eccc.weizmann.ac.il/report/2014/079},
  eprinttype    = {ECCC},
  eprint       = {TR14-079},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/StraubTW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GurjarKMST12,
  author       = {Rohit Gurjar and
                  Arpita Korwar and
                  Jochen Messner and
                  Simon Straub and
                  Thomas Thierauf},
  editor       = {Branislav Rovan and
                  Vladimiro Sassone and
                  Peter Widmayer},
  title        = {Planarizing Gadgets for Perfect Matching Do Not Exist},
  booktitle    = {Mathematical Foundations of Computer Science 2012 - 37th International
                  Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7464},
  pages        = {478--490},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-32589-2\_43},
  doi          = {10.1007/978-3-642-32589-2\_43},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/GurjarKMST12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GurjarKMST11,
  author       = {Rohit Gurjar and
                  Arpita Korwar and
                  Jochen Messner and
                  Simon Straub and
                  Thomas Thierauf},
  title        = {Planarizing Gadgets for Perfect Matching do not Exist},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR11-148}},
  year         = {2011},
  url          = {https://eccc.weizmann.ac.il/report/2011/148},
  eprinttype    = {ECCC},
  eprint       = {TR11-148},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/GurjarKMST11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics