Sascha Kurz
Orcid: 0000-0003-4597-2041
According to our database1,
Sascha Kurz
authored at least 144 papers
between 2006 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2006
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
5
10
15
3
7
10
5
14
11
9
16
5
9
3
11
4
6
5
2
4
2
1
3
1
2
1
1
1
1
2
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes.
Des. Codes Cryptogr., February, 2025
2024
Computer classification of linear codes based on lattice point enumeration and integer linear programming.
CoRR, 2024
Adv. Math. Commun., 2024
Proceedings of the Mathematical Software - ICMS 2024, 2024
2023
Discret. Appl. Math., July, 2023
IEEE Trans. Inf. Theory, June, 2023
Des. Codes Cryptogr., February, 2023
Classification of $ \mathbf{(3 \!\mod 5)} $ arcs in $ \mathbf{ \operatorname{PG}(3,5)} $.
Adv. Math. Commun., 2023
Adv. Math. Commun., 2023
2022
IEEE Trans. Inf. Theory, 2022
On the number of minimal codewords in codes generated by the adjacency matrix of a graph.
Discret. Appl. Math., 2022
2021
Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output.
Soc. Choice Welf., 2021
Math. Soc. Sci., 2021
IEEE Commun. Lett., 2021
The Public Good index for games with several levels of approval in the input and output.
CoRR, 2021
2020
Soc. Choice Welf., 2020
CoRR, 2020
CoRR, 2020
Proceedings of the IEEE Information Theory Workshop, 2020
A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6.
Des. Codes Cryptogr., 2019
Adv. Math. Commun., 2019
2018
Int. J. Game Theory, 2018
The order of the automorphism group of a binary q -analog of the Fano plane is at most two.
Des. Codes Cryptogr., 2018
Which criteria qualify power indices for applications? - A comment to "The story of the poor Public Good index".
CoRR, 2018
Ann. Oper. Res., 2018
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018
2017
Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017
2016
Dimension of the Lisbon voting rules in the EU Council: a challenge and new world record.
Optim. Lett., 2016
Characterization of threshold functions: state of the art, some new contributions and open problems.
CoRR, 2016
Adv. Math. Commun., 2016
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016
2015
Discret. Appl. Math., 2015
The Top-Dog Index: a new measurement for the demand consistency of the size distribution in pre-pack orders for a fashion discounter with many small branches.
Ann. Oper. Res., 2015
Proceedings of the Operations Research Proceedings 2015, 2015
2014
CoRR, 2014
An exact column-generation approach for the lot-type design problem - extended abstract.
CoRR, 2014
Heuristic and exact solutions to the inverse power index problem for small voting bodies.
Ann. Oper. Res., 2014
Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum.
Ann. Oper. Res., 2014
Proceedings of the Operations Research Proceedings 2014, 2014
Proceedings of the ICORES 2014, 2014
2013
Eur. J. Oper. Res., 2013
2012
Bremst Richtervorbehalt den Datenschutz aus? - Richtervorbehalt versus datenschutzrechtliche Kontrollkompetenz.
Datenschutz und Datensicherheit, 2012
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012
Proceedings of the Operations Research Proceedings 2012, 2012
2011
On the minimum diameter of plane integral point sets.
Ars Comb., 2011
2-arcs of maximal size in the affine and the projective Hjelmslev plane over ℤ<sub><i>25</i></sub>.
Adv. Math. Commun., 2011
2010
2009
J. Comb. Theory A, 2009
Discret. Math., 2009
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009
2008
Discret. Comput. Geom., 2008
Counting polyominoes with minimum perimeter.
Ars Comb., 2008
Proceedings of the Mathematical Methods in Computer Science, 2008
2007
Demand Forecasting for Companies with Many Branches, Low Sales Numbers per Product, and Non-Recurring Orderings.
Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications, 2007
2006
A bijection between the <i>d</i>-dimensional simplices with distances in {1, 2} and the partitions of <i>d</i>+1.
J. Comb. Theory A, 2006
Australas. J Comb., 2006