Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity. - Georg Bachmeier; Michael Luttenberger; Maximilian Schlund (LATA, 2015)

k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters. - Georg Bachmeier; Felix Brandt 001; Christian Geist; Paul Harrenstein; Keyvan Kardel; Dominik Peters; Hans Georg Seedig (CoRR, 2017)

k-Majority digraphs and the hardness of voting with a constant number of voters. - Georg Bachmeier; Felix Brandt 001; Christian Geist; Paul Harrenstein; Keyvan Kardel; Dominik Peters; Hans Georg Seedig (J. Comput. Syst. Sci., 2019)