| Construction of large constant dimension codes with a prescribed minimum distance A Kohnert, S Kurz Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth, 31-42, 2008 | 174 | 2008 |
| Group activity selection problem A Darmann, E Elkind, S Kurz, J Lang, J Schauer, G Woeginger International Workshop on Internet and Network Economics, 156-169, 2012 | 111 | 2012 |
| Tables of subspace codes D Heinlein, M Kiermaier, S Kurz, A Wassermann arXiv preprint arXiv:1601.02864, 2016 | 90 | 2016 |
| Optimal opinion control: The campaign problem R Hegselmann, S König, S Kurz, C Niemann, J Rambau arXiv preprint arXiv:1410.8419, 2014 | 83 | 2014 |
| Optimal binary subspace codes of length 6, constant dimension 3 and minimum distance 4 T Honold, M Kiermaier, S Kurz arXiv preprint arXiv:1311.0464, 2013 | 70 | 2013 |
| On the inverse power index problem S Kurz Optimization 61 (8), 989-1011, 2012 | 69 | 2012 |
| Minimal proper non-IRUP instances of the one-dimensional cutting stock problem VM Kartak, AV Ripatti, G Scheithauer, S Kurz Discrete Applied Mathematics 187, 120-129, 2015 | 63 | 2015 |
| On the Hegselmann–Krause conjecture in opinion dynamics S Kurz, J Rambau Journal of Difference Equations and Applications 17 (6), 859-876, 2011 | 61 | 2011 |
| On the democratic weights of nations S Kurz, N Maaser, S Napel Journal of Political Economy 125 (5), 1599-1634, 2017 | 60* | 2017 |
| On minimum sum representations for weighted voting games S Kurz Annals of Operations Research 196 (1), 361-369, 2012 | 56 | 2012 |
| Partial spreads and vector space partitions T Honold, M Kiermaier, S Kurz Network Coding and Subspace Designs, 131-170, 2018 | 54 | 2018 |
| There are integral heptagons, no three points on a line, no four on a circle T Kreisel, S Kurz Discrete & Computational Geometry 39 (4), 786-790, 2008 | 54 | 2008 |
| Coset construction for subspace codes D Heinlein, S Kurz IEEE Transactions on Information Theory 63 (12), 7651-7660, 2017 | 48 | 2017 |
| Improved upper bounds for partial spreads S Kurz Designs, Codes and Cryptography 85 (1), 97-106, 2017 | 47 | 2017 |
| On the lengths of divisible codes M Kiermaier, S Kurz IEEE Transactions on Information Theory 66 (7), 4051-4060, 2020 | 45* | 2020 |
| Group activity selection problem with approval preferences A Darmann, E Elkind, S Kurz, J Lang, J Schauer, G Woeginger International Journal of Game Theory 47 (3), 767-796, 2018 | 44 | 2018 |
| Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound D Heinlein, S Kurz International Castle Meeting on Coding Theory and Applications, 163-191, 2017 | 43 | 2017 |
| On Dedekind’s problem for complete simple games S Kurz, N Tautenhahn International Journal of Game Theory 42 (2), 411-437, 2013 | 43 | 2013 |
| Dimension of the Lisbon voting rules in the EU Council: a challenge and new world record S Kurz, S Napel Optimization Letters 10 (6), 1245-1256, 2016 | 42 | 2016 |
| Combining subspace codes A Cossidente, S Kurz, G Marino, F Pavese arXiv preprint arXiv:1911.03387, 2019 | 41 | 2019 |
Jörg RambauProfessor für Wirtschaftsmathematik, Universität BayreuthVerified email at uni-bayreuth.de
