2024
Lengths of divisible codes: the missing cases.
Des. Codes Cryptogr., August, 2024
Non-Projective Two-Weight Codes.
Entropy, April, 2024
Optimal additive quaternary codes of dimension 3.5.
CoRR, 2024
Computer classification of linear codes based on lattice point enumeration and integer linear programming.
CoRR, 2024
Bounds on the minimum distance of locally recoverable codes.
CoRR, 2024
Lengths of divisible codes with restricted column multiplicities.
Adv. Math. Commun., 2024
Computer Classification of Linear Codes Based on Lattice Point Enumeration.
Proceedings of the Mathematical Software - ICMS 2024, 2024
2023
Enumeration of simple games with two equivalence classes of players.
Discret. Appl. Math., July, 2023
Classification of Δ-Divisible Linear Codes Spanned by Codewords of Weight Δ.
IEEE Trans. Inf. Theory, June, 2023
On strongly walk regular graphs, triple sum sets and their codes.
Des. Codes Cryptogr., February, 2023
Trifferent codes with small lengths.
CoRR, 2023
Irreducible Subcube Partitions.
Electron. J. Comb., 2023
Classification of $ \mathbf{(3 \!\mod 5)} $ arcs in $ \mathbf{ \operatorname{PG}(3,5)} $.
Adv. Math. Commun., 2023
The interplay of different metrics for the construction of constant dimension codes.
Adv. Math. Commun., 2023
On the minimum number of minimal codewords.
Adv. Math. Commun., 2023
Combining subspace codes.
Adv. Math. Commun., 2023
2022
A Generalization of the Cylinder Conjecture for Divisible Codes.
IEEE Trans. Inf. Theory, 2022
Three-Weight Codes over Rings and Strongly Walk Regular Graphs.
Graphs Comb., 2022
On the number of minimal codewords in codes generated by the adjacency matrix of a graph.
Discret. Appl. Math., 2022
Irreducible subcube partitions.
CoRR, 2022
Capacity of generalized diamond networks.
CoRR, 2022
2021
Computer Classification of Linear Codes.
IEEE Trans. Inf. Theory, 2021
Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output.
Soc. Choice Welf., 2021
A note on the growth of the dimension in complete simple games.
Math. Soc. Sci., 2021
No Projective 16-Divisible Binary Linear Code of Length 131 Exists.
IEEE Commun. Lett., 2021
On the maximum number of minimal codewords.
Discret. Math., 2021
PIR Codes with Short Block Length.
Des. Codes Cryptogr., 2021
Des. Codes Cryptogr., 2021
The Art and Beauty of Voting Power.
CoRR, 2021
Construction and bounds for subspace codes.
CoRR, 2021
A note on simple games with two equivalence classes of players.
CoRR, 2021
Classification of 3 mod 5 arcs in PG(3, 5).
CoRR, 2021
The Public Good index for games with several levels of approval in the input and output.
CoRR, 2021
The [46, 9, 20]<sub>2</sub> code is unique.
Adv. Math. Commun., 2021
2020
On the Lengths of Divisible Codes.
IEEE Trans. Inf. Theory, 2020
The Lengths of Projective Triply-Even Binary Codes.
IEEE Trans. Inf. Theory, 2020
Simple games versus weighted voting games: bounding the critical threshold value.
Soc. Choice Welf., 2020
Generalized LMRD Code Bounds for Constant Dimension Codes.
IEEE Commun. Lett., 2020
Weighted committee games.
Eur. J. Oper. Res., 2020
Subspaces intersecting in at most a point.
Des. Codes Cryptogr., 2020
Subspace packings: constructions and bounds.
Des. Codes Cryptogr., 2020
Classification of 8-divisible binary linear codes with minimum distance 24.
CoRR, 2020
Bounds for the multilevel construction.
CoRR, 2020
Are weighted games sufficiently good for binary voting?
CoRR, 2020
Lifted codes and the multilevel construction for constant dimension codes.
CoRR, 2020
Efficient Storage Schemes for Desired Service Rate Regions.
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
Bounds for the Nakamura number.
Soc. Choice Welf., 2019
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6.
Des. Codes Cryptogr., 2019
Influence in Weighted Committees.
CoRR, 2019
LinCode - computer classification of linear codes.
CoRR, 2019
An Axiomatization of the Shapley-Shubik Index for Interval Decisions.
CoRR, 2019
A note on the linkage construction for constant dimension codes.
CoRR, 2019
Johnson Type Bounds for Mixed Dimension Subspace Codes.
Electron. J. Comb., 2019
A subspace code of size 333 in the setting of a binary q-analog of the Fano plane.
Adv. Math. Commun., 2019
Generalized vector space partitions.
Australas. J Comb., 2019
2018
Group activity selection problem with approval preferences.
Int. J. Game Theory, 2018
Fair representation and a linear Shapley rule.
Games Econ. Behav., 2018
Heden's bound on the tail of a vector space partition.
Discret. Math., 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
A note on limit results for the Penrose-Banzhaf index.
CoRR, 2018
Bounds for the diameter of the weight polytope.
CoRR, 2018
The roll call interpretation of the Shapley value.
CoRR, 2018
The power of the largest player.
CoRR, 2018
Influence in systems with convex decisions.
CoRR, 2018
Approximating power by weights.
CoRR, 2018
Correction to: On minimum sum representations for weighted voting games.
Ann. Oper. Res., 2018
Representation-compatible power indices.
Ann. Oper. Res., 2018
Binary subspace codes in small ambient spaces.
Adv. Math. Commun., 2018
Importance in Systems with interval Decisions.
Adv. Complex Syst., 2018
Simple Games Versus Weighted Voting Games.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018
2017
Coset Construction for Subspace Codes.
IEEE Trans. Inf. Theory, 2017
Improved upper bounds for partial spreads.
Des. Codes Cryptogr., 2017
An improvement of the Johnson bound for subspace codes.
CoRR, 2017
Packing vector spaces into vector spaces.
Australas. J Comb., 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
The inverse problem for power distributions in committees.
Soc. Choice Welf., 2016
Dimension of the Lisbon voting rules in the EU Council: a challenge and new world record.
Optim. Lett., 2016
The cost of getting local monotonicity.
Eur. J. Oper. Res., 2016
Dimension and codimension of simple games.
Electron. Notes Discret. Math., 2016
Computing the Power Distribution in the IMF.
CoRR, 2016
Generalized roll-call model for the Shapley-Shubik index.
CoRR, 2016
Tables of subspace codes.
CoRR, 2016
Characterization of threshold functions: state of the art, some new contributions and open problems.
CoRR, 2016
Constructions and bounds for mixed-dimension subspace codes.
Adv. Math. Commun., 2016
On the Construction of High-Dimensional Simple Games.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016
2015
Optimal Opinion Control: The Campaign Problem.
J. Artif. Soc. Soc. Simul., 2015
Minimal proper non-IRUP instances of the one-dimensional cutting stock problem.
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
The Maximum Scatter TSP on a Regular Grid.
Proceedings of the Operations Research Proceedings 2015, 2015
2014
On minimum integer representations of weighted games.
Math. Soc. Sci., 2014
On \({\alpha }\) -roughly weighted games.
Int. J. Game Theory, 2014
On the Hegselmann-Krause conjecture in opinion dynamics.
CoRR, 2014
Mostly Sunny: A Forecast of Tomorrow's Power Index Research.
CoRR, 2014
Optimal control of the convergence time in the Hegselmann-Krause dynamics.
CoRR, 2014
Ready for the design of voting rules?
CoRR, 2014
Competitive learning of monotone Boolean functions.
CoRR, 2014
An exact column-generation approach for the lot-type design problem - extended abstract.
CoRR, 2014
The average representation - a cornucopia of power indices?
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
The Price of Fairness for a Small Number of Indivisible Items.
Proceedings of the Operations Research Proceedings 2014, 2014
Classes of Complete Simple Games that are All Weighted.
Proceedings of the ICORES 2014, 2014
2013
On Dedekind's problem for complete simple games.
Int. J. Game Theory, 2013
The golden number and Fibonacci sequences in the design of voting structures.
Eur. J. Oper. Res., 2013
Open Sets Avoiding Integral Distances.
Discret. Comput. Geom., 2013
Measuring voting power in convex policy spaces.
CoRR, 2013
2012
Squaring the Square with Integer Linear Programming.
J. Inf. Process., 2012
Bremst Richtervorbehalt den Datenschutz aus? - Richtervorbehalt versus datenschutzrechtliche Kontrollkompetenz.
Datenschutz und Datensicherheit, 2012
Bounds for the minimum oriented diameter.
Discret. Math. Theor. Comput. Sci., 2012
On the inverse power index problem
CoRR, 2012
On the Egalitarian Weights of Nations
CoRR, 2012
On minimum sum representations for weighted voting games.
Ann. Oper. Res., 2012
Group Activity Selection Problem.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012
Evaluation of a New Supply Strategy for a Fashion Discounter.
Proceedings of the Operations Research Proceedings 2012, 2012
2011
Regular Matchstick Graphs.
Am. Math. Mon., 2011
On $α$-roughly weighted games
CoRR, 2011
On minimal integer representations of weighted games
CoRR, 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
On the lot-type design problem.
Optim. Methods Softw., 2010
Maximal integral point sets over <sup>2</sup>.
Int. J. Comput. Math., 2010
2009
Integral point sets in higher dimensional affine spaces over finite fields.
J. Comb. Theory A, 2009
Maximal integral point sets in affine planes over finite fields.
Discret. Math., 2009
Integral point sets over Z<sub>n</sub><sup>m</sup>.
Discret. Appl. Math., 2009
Integral point sets over finite fields.
Australas. J Comb., 2009
The Combinatorics of (S, M, L, XL) or the best fitting delivery of T-shirts.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009
2008
There Are Integral Heptagons, no Three Points on a Line, no Four on a Circle.
Discret. Comput. Geom., 2008
Counting polyominoes with minimum perimeter.
Ars Comb., 2008
Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance.
Proceedings of the Mathematical Methods in Computer Science, 2008
2007
Bounds for the minimum diameter of integral point sets.
Australas. J Comb., 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
Integral point sets over <i>I</i>.
Electron. Notes Discret. Math., 2006
On the characteristic of integral point sets in 𝔼<sup>m</sup>.
Australas. J Comb., 2006
