BibTeX records: Georg Bachmeier

download as .bib file

@article{DBLP:journals/jcss/BachmeierBGHKPS19,
  author    = {Georg Bachmeier and
               Felix Brandt and
               Christian Geist and
               Paul Harrenstein and
               Keyvan Kardel and
               Dominik Peters and
               Hans Georg Seedig},
  title     = {\emph{k}-Majority digraphs and the hardness of voting with a constant
               number of voters},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {105},
  pages     = {130--157},
  year      = {2019},
  url       = {https://doi.org/10.1016/j.jcss.2019.04.005},
  doi       = {10.1016/j.jcss.2019.04.005},
  timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jcss/BachmeierBGHKPS19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bachmeier0GHKPS17,
  author    = {Georg Bachmeier and
               Felix Brandt and
               Christian Geist and
               Paul Harrenstein and
               Keyvan Kardel and
               Dominik Peters and
               Hans Georg Seedig},
  title     = {k-Majority Digraphs and the Hardness of Voting with a Constant Number
               of Voters},
  journal   = {CoRR},
  volume    = {abs/1704.06304},
  year      = {2017},
  url       = {http://arxiv.org/abs/1704.06304},
  archivePrefix = {arXiv},
  eprint    = {1704.06304},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/Bachmeier0GHKPS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BachmeierLS15,
  author    = {Georg Bachmeier and
               Michael Luttenberger and
               Maximilian Schlund},
  title     = {Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional
               and Computational Complexity},
  booktitle = {Language and Automata Theory and Applications - 9th International
               Conference, {LATA} 2015, Nice, France, March 2-6, 2015, Proceedings},
  pages     = {473--485},
  year      = {2015},
  crossref  = {DBLP:conf/lata/2015},
  url       = {https://doi.org/10.1007/978-3-319-15579-1\_37},
  doi       = {10.1007/978-3-319-15579-1\_37},
  timestamp = {Mon, 16 Sep 2019 15:27:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/lata/BachmeierLS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BachmeierLS14,
  author    = {Georg Bachmeier and
               Michael Luttenberger and
               Maximilian Schlund},
  title     = {Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional
               and Computational Complexity},
  journal   = {CoRR},
  volume    = {abs/1410.2737},
  year      = {2014},
  url       = {http://arxiv.org/abs/1410.2737},
  archivePrefix = {arXiv},
  eprint    = {1410.2737},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BachmeierLS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/lata/2015,
  editor    = {Adrian{-}Horia Dediu and
               Enrico Formenti and
               Carlos Mart{\'{\i}}n{-}Vide and
               Bianca Truthe},
  title     = {Language and Automata Theory and Applications - 9th International
               Conference, {LATA} 2015, Nice, France, March 2-6, 2015, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8977},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-319-15579-1},
  doi       = {10.1007/978-3-319-15579-1},
  isbn      = {978-3-319-15578-4},
  timestamp = {Mon, 16 Sep 2019 15:27:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/lata/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics