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/bib/journals/mst/StraubTW16},
  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   = {{TOCT}},
  volume    = {8},
  number    = {4},
  pages     = {14:1--14:15},
  year      = {2016},
  url       = {https://doi.org/10.1145/2934310},
  doi       = {10.1145/2934310},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/toct/GurjarKMST16},
  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       = {http://d-nb.info/1082443174},
  timestamp = {Fri, 18 Nov 2016 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/phd/dnb/Straub15},
  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},
  year      = {2014},
  crossref  = {DBLP:conf/coco/2014},
  url       = {https://doi.org/10.1109/CCC.2014.15},
  doi       = {10.1109/CCC.2014.15},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/StraubTW14},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {79},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/079},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/StraubTW14},
  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},
  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},
  pages     = {478--490},
  year      = {2012},
  crossref  = {DBLP:conf/mfcs/2012},
  url       = {https://doi.org/10.1007/978-3-642-32589-2\_43},
  doi       = {10.1007/978-3-642-32589-2\_43},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/GurjarKMST12},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {148},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/148},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/GurjarKMST11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2014,
  title     = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
               BC, Canada, June 11-13, 2014},
  publisher = {{IEEE} Computer Society},
  year      = {2014},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6875457},
  isbn      = {978-1-4799-3626-7},
  timestamp = {Fri, 13 May 2016 10:43:51 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2012,
  editor    = {Branislav Rovan and
               Vladimiro Sassone and
               Peter Widmayer},
  title     = {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},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-32589-2},
  doi       = {10.1007/978-3-642-32589-2},
  isbn      = {978-3-642-32588-5},
  timestamp = {Thu, 25 May 2017 00:43:01 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier