Georg Bachmeier

According to our database, Georg Bachmeier authored at least 3 papers between 2015 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2019

<i>k</i>-Majority digraphs and the hardness of voting with a constant number of voters.

Georg Bachmeier, Felix Brandt, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters, Hans Georg Seedig

J. Comput. Syst. Sci., 2019

2017

k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters.

Georg Bachmeier, Felix Brandt, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters, Hans Georg Seedig

CoRR, 2017

2015

Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity.

Georg Bachmeier, Michael Luttenberger, Maximilian Schlund

Proceedings of the Language and Automata Theory and Applications, 2015