Cliquer
From MaRDI portal
Software:17184
swMATH5044MaRDI QIDQ17184FDOQ17184
Author name not available (Why is that?)
Cited In (75)
- Resolvable covering arrays
- New lower bounds on \(q\)-ary error-correcting codes
- On Pless symmetry codes, ternary QR codes, and related Hadamard matrices and designs
- On the Enumeration of ‐Optimal and Minimax‐Optimal k‐Circulant Supersaturated Designs
- Maximal arcs, codes, and new links between projective planes of order 16
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Title not available (Why is that?)
- Switching for Small Strongly Regular Graphs
- Linear groups as right multiplication groups of quasifields
- Classification of resolvable balanced incomplete block designs — the unitals on 28 points
- Title not available (Why is that?)
- Foldabilizing furniture
- Strongly regular configurations
- The chromatic number of the square of the $8$-cube
- Enumerating cube tilings
- A new partial geometry \(\mathrm{pg}(5,5,2)\)
- Search for combinatorial objects using lattice algorithms -- revisited
- On Quasi-symmetric 2-(64, 24, 46) Designs Derived from Codes
- The sextuply shortened binary Golay code is optimal
- Generalized balanced tournament designs with block size four
- On triple systems and strongly regular graphs
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Encoding Binary Neural Codes in Networks of Threshold-Linear Neurons
- On partial geometries arising from maximal arcs
- Miscellaneous classification results for 2-designs
- Maximal integral point sets over ℤ2
- Classification algorithms for codes and designs
- Fitting very large sparse Gaussian graphical models
- New lower bounds for the Shannon capacity of odd cycles
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Quasi-symmetric \(2\)-\((64, 24, 46)\) designs derived from \(\mathrm{AG}(3, 4)\)
- Some spin glass ideas applied to the clique problem
- Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm
- Exact algorithms for routing problems under vehicle capacity constraints
- On the independence ratio of distance graphs
- Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
- Computational Mathematics with SageMath
- Constructing error-correcting binary codes using transitive permutation groups
- A New Solver for the Minimum Weighted Vertex Cover Problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses
- There is no (75,32,10,16) strongly regular graph
- Constructions and bounds for mixed-dimension subspace codes
- Further results on the classification of MDS codes
- A branch-and-cut procedure for the Udine course timetabling problem
- Integral point sets over \(\mathbb Z_n^m\)
- Classification of Graeco-Latin Cubes
- Recent advances in vehicle routing exact algorithms
- Quantum contextuality with stabilizer states
- Maximal arcs in projective planes of order 16 and related designs
- Orderly generation of Butson Hadamard matrices
- Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model
- On minimum sum representations for weighted voting games
- Uniquely \(K_r\)-saturated graphs
- An exact solution framework for a broad class of vehicle routing problems
- Maximum-weight stable sets and safe lower bounds for graph coloring
- The time dependent traveling salesman problem: polyhedra and algorithm
- Integral point sets in higher dimensional affine spaces over finite fields
- Maximal integral point sets in affine planes over finite fields
- Kirkman triple systems with subsystems
- Constructions of maximum few-distance sets in Euclidean spaces
- Random Latin squares and Sudoku designs generation
- Tiling groups with difference sets
- There is no McLaughlin geometry
- Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: A coding-theoretic approach
- New Lower Bounds for Binary Constant-Dimension Subspace Codes
- On optimal binary codes with unbalanced coordinates
- A unified exact method for solving different classes of vehicle routing problems
- Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
- Hadamard matrices related to a certain series of ternary self-dual codes
- New results on tripod packings
- Difference matrices with five rows over finite abelian groups
- On Dedekind's problem for complete simple games
- On the Shannon capacity of triangular graphs
- Safe Lower Bounds for Graph Coloring
This page was built for software: Cliquer