Sascha Kurz

1.5k total citations
104 papers, 499 citations indexed

About

Sascha Kurz is a scholar working on Artificial Intelligence, Economics and Econometrics and Electrical and Electronic Engineering. According to data from OpenAlex, Sascha Kurz has authored 104 papers receiving a total of 499 indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Artificial Intelligence, 37 papers in Economics and Econometrics and 30 papers in Electrical and Electronic Engineering. Recurrent topics in Sascha Kurz's work include Game Theory and Voting Systems (37 papers), Coding theory and cryptography (32 papers) and graph theory and CDMA systems (25 papers). Sascha Kurz is often cited by papers focused on Game Theory and Voting Systems (37 papers), Coding theory and cryptography (32 papers) and graph theory and CDMA systems (25 papers). Sascha Kurz collaborates with scholars based in Germany, Spain and Netherlands. Sascha Kurz's co-authors include Stefan Napel, Jörg Rambau, Josep Freixas, Guntram Scheithauer, Alfred Wassermann, Iliya Bouyukliev, Stefka Bouyuklieva, Thomas Honold, Axel Kohnert and Rainer Hegselmann and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of Political Economy and Scientific Reports.

In The Last Decade

Sascha Kurz

95 papers receiving 472 citations

Peers

Sascha Kurz
Serge Gaspers Australia
William A. Webb United States
Or Sheffet United States
Paul H. Edelman United States
Serge Gaspers Australia
Sascha Kurz
Citations per year, relative to Sascha Kurz Sascha Kurz (= 1×) peers Serge Gaspers

Countries citing papers authored by Sascha Kurz

Since Specialization
Citations

This map shows the geographic impact of Sascha Kurz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Sascha Kurz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sascha Kurz more than expected).

Fields of papers citing papers by Sascha Kurz

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sascha Kurz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Sascha Kurz. The network helps show where Sascha Kurz may publish in the future.

Co-authorship network of co-authors of Sascha Kurz

This figure shows the co-authorship network connecting the top 25 collaborators of Sascha Kurz. A scholar is included among the top collaborators of Sascha Kurz based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Sascha Kurz. Sascha Kurz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kurz, Sascha. (2024). Trifferent codes with small lengths. SHILAP Revista de lepidopterología. 5. 100139–100139. 3 indexed citations
2.
Kurz, Sascha. (2023). Vector space partitions of GF(2)^8. 16(2). 71–100.
3.
Kurz, Sascha, et al.. (2023). Enumeration of simple games with two equivalence classes of players. Discrete Applied Mathematics. 334. 26–35.
4.
Filmus, Yuval, et al.. (2023). Irreducible Subcube Partitions. The Electronic Journal of Combinatorics. 30(3). 4 indexed citations
5.
Bamberg, John, et al.. (2023). Affine vector space partitions. Designs Codes and Cryptography. 93(2). 331–357. 3 indexed citations
6.
Kurz, Sascha, et al.. (2021). Classification of $ \mathbf{(3 \!\mod 5)} $ arcs in $ \mathbf{ \operatorname{PG}(3,5)} $. Advances in Mathematics of Communications. 17(1). 172–206.
7.
Kurz, Sascha, et al.. (2021). On the minimum number of minimal codewords. Advances in Mathematics of Communications. 17(2). 333–341. 1 indexed citations
8.
Kurz, Sascha, et al.. (2019). Weighted committee games. European Journal of Operational Research. 282(3). 972–979. 7 indexed citations
9.
Kurz, Sascha. (2018). Heden’s bound on the tail of a vector space partition. Discrete Mathematics. 341(12). 3447–3452. 1 indexed citations
10.
Kurz, Sascha, et al.. (2017). The order of the automorphism group of a binary $${\varvec{q}}$$ q -analog of the Fano plane is at most two. Designs Codes and Cryptography. 86(2). 239–250. 4 indexed citations
11.
Kurz, Sascha. (2017). Packing vector spaces into vector spaces. ERef Bayreuth (University of Bayreuth). 68. 122–130. 8 indexed citations
12.
Scheithauer, Guntram, et al.. (2015). Minimal proper non-IRUP instances of the one-dimensional cutting stock problem. Discrete Applied Mathematics. 187. 120–129. 30 indexed citations
13.
Kurz, Sascha, et al.. (2012). The integrated size and price optimization problem. Numerical Algebra Control and Optimization. 2(4). 669–693. 2 indexed citations
14.
Kurz, Sascha & Rom Pinchasi. (2011). Regular Matchstick Graphs. American Mathematical Monthly. 118(3). 264–264. 2 indexed citations
15.
Kurz, Sascha, et al.. (2009). Maximal integral point sets in affine planes over finite fields. Discrete Mathematics. 309(13). 4564–4575. 7 indexed citations
16.
Kohnert, Axel & Sascha Kurz. (2008). Integral point sets over Znm. Discrete Applied Mathematics. 157(9). 2105–2117. 3 indexed citations
17.
Kurz, Sascha & Alfred Wassermann. (2008). On the minimum diameter of plane integral point sets. Ars Combinatoria. 101. 265–287. 10 indexed citations
18.
Kurz, Sascha & Reinhard Laue. (2007). Bounds for the minimum diameter of integral point sets. EPub Bayreuth (University of Bayreuth). 39. 233–240. 4 indexed citations
19.
Kurz, Sascha, et al.. (2007). Inclusion-maximal integral point sets over finite fields. EPub Bayreuth (University of Bayreuth). 1 indexed citations
20.
Kurz, Sascha. (2006). On the characteristic of integral point sets in 𝔼 m .. Australas. J Comb.. 36. 241–248. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026