The following pages link to Sascha Kurz (Q315488):
Displayed 50 items.
- Bounds for the Nakamura number (Q2417421) (← links)
- On minimum integer representations of weighted games (Q2446687) (← links)
- The strategic sincerity of approval voting (Q2447170) (← links)
- The nucleolus of large majority games (Q2452975) (← links)
- Convex hulls of polyominoes (Q2473581) (← links)
- A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) (Q2490871) (← links)
- The inverse problem for power distributions in committees (Q2629512) (← links)
- PIR codes with short block length (Q2657142) (← links)
- On strongly walk regular graphs, triple sum sets and their codes (Q2698347) (← links)
- The Price of Fairness for a Small Number of Indivisible Items (Q2806954) (← links)
- On the minimum diameter of plane integral point sets (Q2918551) (← links)
- On the Hegselmann–Krause conjecture in opinion dynamics (Q3016333) (← links)
- Maximal integral point sets over ℤ<sup>2</sup> (Q3056402) (← links)
- (Q3070315) (← links)
- Regular Matchstick Graphs (Q3085257) (← links)
- On the inverse power index problem (Q3165908) (← links)
- (Q3183978) (← links)
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4 (Q3187290) (← links)
- Constructing $7$-clusters (Q3187633) (← links)
- Optimal control of the freezing time in the Hegselmann–Krause dynamics (Q3195514) (← links)
- 2. q-analogs of group divisible designs (Q3299907) (← links)
- (Q3412144) (← links)
- Integral point sets over (Q3439532) (← links)
- Fast regocnition of planar non unit distance graphs (Q3464032) (← links)
- (Q3535878) (← links)
- On the lot-type design problem (Q3562396) (← links)
- On the generation of Heronian triangles (Q3598611) (← links)
- Integral point sets over finite fields (Q3614012) (← links)
- Coset Construction for Subspace Codes (Q4566591) (← links)
- On the Construction of High Dimensional Simple Games (Q4576222) (← links)
- (Q4595216) (← links)
- The Maximum Scatter TSP on a Regular Grid (Q4596195) (← links)
- Angewandte Mathematik (Q4637533) (← links)
- A lower bound for 4-regular planar unit distance graphs (Q4906866) (← links)
- Computer Classification of Linear Codes (Q5032620) (← links)
- A Generalization of the Cylinder Conjecture for Divisible Codes (Q5088384) (← links)
- The Lengths of Projective Triply-Even Binary Codes (Q5123888) (← links)
- On the Lengths of Divisible Codes (Q5124415) (← links)
- Evaluation of a New Supply Strategy for a Fashion Discounter (Q5171841) (← links)
- (Q5200812) (← links)
- Generalized vector space partitions (Q5377019) (← links)
- Enumeration of integral tetrahedra (Q5387533) (← links)
- Bounds for the minimum oriented diameter (Q5403018) (← links)
- Bounds for the minimum diameter of integral point sets (Q5442541) (← links)
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance (Q5504563) (← links)
- 3-regular matchstick graphs with given girth (Q5881924) (← links)
- The interplay of different metrics for the construction of constant dimension codes (Q6112228) (← links)
- Classification of \((3 \bmod 5)\) arcs in \(\mathrm{PG}(3,5)\) (Q6112229) (← links)
- On the minimum number of minimal codewords (Q6112238) (← links)
- Combining subspace codes (Q6112253) (← links)