| Switching 3-edge-colorings of cubic graphs | 0 | 0.34 | 2022 |
| New lower bounds on q-ary error-correcting codes | 0 | 0.34 | 2019 |
| New Results on Tripod Packings. | 0 | 0.34 | 2019 |
| The sextuply shortened binary Golay code is optimal | 0 | 0.34 | 2019 |
| Switching of covering codes. | 0 | 0.34 | 2018 |
| There is no McLaughlin geometry | 0 | 0.34 | 2018 |
| Mappings of Butson-type Hadamard matrices. | 0 | 0.34 | 2018 |
| The chromatic number of the square of the 8-cube. | 0 | 0.34 | 2018 |
| New Lower Bounds for Binary Constant-Dimension Subspace Codes. | 1 | 0.36 | 2018 |
| Enumeration of Seidel matrices. | 0 | 0.34 | 2018 |
| Constructing error-correcting binary codes using transitive permutation groups. | 2 | 0.39 | 2017 |
| LCL problems on grids. | 4 | 0.41 | 2017 |
| FURTHER RESULTS ON THE CLASSIFICATION OF MDS CODES | 1 | 0.41 | 2016 |
| Algorithms for finding maximum transitive subtournaments. | 0 | 0.34 | 2016 |
| A coloring of the square of the 8-cube with 13 colors. | 0 | 0.34 | 2015 |
| Enumeration of Steiner triple systems with subsystems | 0 | 0.34 | 2015 |
| Exhaustive Search for Snake-in-the-Box Codes. | 1 | 0.37 | 2015 |
| Bounds on the domination number of Kneser graphs | 1 | 0.38 | 2015 |
| On hypercube packings, blocking sets and a covering problem. | 1 | 0.35 | 2015 |
| On the minimum size of 4-uniform hypergraphs without property B | 3 | 0.61 | 2014 |
| Classification of MDS Codes over Small Alphabets. | 0 | 0.34 | 2014 |
| Non-existence of a ternary constant weight $(16, 5, 15; 2048)$ diameter perfect code. | 0 | 0.34 | 2014 |
| On the Classification of MDS Codes. | 8 | 0.70 | 2014 |
| A Note on Toeplitz' Conjecture. | 0 | 0.34 | 2014 |
| Large sets of t-designs over finite fields | 10 | 0.90 | 2014 |
| On the Shannon Capacity of Triangular Graphs. | 1 | 0.38 | 2013 |
| The quaternary complex Hadamard matrices of orders 10, 12, and 14. | 2 | 0.51 | 2013 |
| Planar Hypohamiltonian Graphs on 40 Vertices | 1 | 0.39 | 2013 |
| Enumerating Cube Tilings. | 1 | 0.38 | 2013 |
| On optimal binary codes with unbalanced coordinates. | 1 | 0.36 | 2013 |
| Enumerating Perfect Matchings in n-Cubes. | 2 | 0.40 | 2013 |
| On triple systems and strongly regular graphs | 4 | 0.51 | 2012 |
| Computing the Domination Number of Grid Graphs. | 8 | 0.69 | 2011 |
| Russian doll search for the Steiner triple covering problem. | 6 | 0.49 | 2011 |
| The number of Latin squares of order 11 | 15 | 1.09 | 2011 |
| On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$ | 4 | 0.47 | 2011 |
| The perfect binary one-error-correcting codes of length 15: part II-properties | 19 | 1.37 | 2010 |
| Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs | 2 | 0.39 | 2009 |
| P.G. Szabó, M.C. Markót, T. Csendes, E. Specht, L.G. Casado, I. García, New Approaches to Circle Packing in a Square, Springer, Berlin, 2007, ISBN: 978-0-387-45673-7, pp 238 | 0 | 0.34 | 2008 |
| Small P-Groups With Full-Rank Factorization | 0 | 0.34 | 2008 |
| On the minimum size of binary codes with length 2 + 4 and covering radius | 1 | 0.43 | 2008 |
| New Uniquely Decodable Codes for the T-User Binary Adder Channel With 3<=T<=5 | 3 | 0.41 | 2007 |
| Elementary P-Groups With The Redei Property | 2 | 0.46 | 2007 |
| There are exactly five biplanes with k=11 | 4 | 0.53 | 2006 |
| The Steiner quadruple systems of order 16 | 13 | 1.24 | 2006 |
| New Results on Codes with Covering Radius 1 and Minimum Distance 2 | 4 | 1.02 | 2005 |
| Near-Extremal Formally Self-Dual Even Codes of Lengths 24 and 32 | 2 | 0.46 | 2005 |
| Two New Four-Error-Correcting Binary Codes | 5 | 0.73 | 2005 |
| Constructing combinatorial objects via cliques | 5 | 0.72 | 2005 |
| Classification of Self-Orthogonal Codes over F3 and F4 | 2 | 0.42 | 2005 |
