swMATH5044MaRDI QIDQ17184FDOQ17184
Author name not available (Why is that?)
Official website: http://users.tkk.fi/~pat/cliquer.html
Cited In (93)
- Enumerating cube tilings
- A new partial geometry \(\mathrm{pg}(5,5,2)\)
- 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
- 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
- A new solver for the minimum weighted vertex cover problem
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Quasi-symmetric \(2\)-\((64, 24, 46)\) designs derived from \(\mathrm{AG}(3, 4)\)
- New lower bounds for binary constant-dimension subspace codes
- 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
- Encoding binary neural codes in networks of threshold-linear neurons
- 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
- Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach
- 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
- NISPOC
- MuPAD-Combinat
- GRAPE
- DISCRETA
- EXTRACOL
- Traces
- MaxCliqueDyn
- CVRPSEP
- COIN/BCP
- CVRPSP
- libexact
- 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
- CircuitTSAT
- CaGe
- YIELDS
- Maximal arcs in projective planes of order 16 and related designs
- Orderly generation of Butson Hadamard matrices
- On minimum sum representations for weighted voting games
- Gavrog
- GRADPART
- Systre
- Tripod Packings
- 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
- On quasi-symmetric 2-\((64, 24, 46)\) designs derived from codes
- Safe lower bounds for graph coloring
- Random Latin squares and Sudoku designs generation
- Tiling groups with difference sets
- There is no McLaughlin geometry
- On optimal binary codes with unbalanced coordinates
- Computational mathematics with SageMath. Translated from the 2013 French original by the authors
- 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
- On Dedekind's problem for complete simple games
- On the Shannon capacity of triangular graphs
- Resolvable covering arrays
- Search for combinatorial objects using lattice algorithms -- revisited
- New lower bounds on \(q\)-ary error-correcting codes
- On Pless symmetry codes, ternary QR codes, and related Hadamard matrices and designs
- The chromatic number of the square of the 8-cube
- 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
- Linear groups as right multiplication groups of quasifields
- Classification of resolvable balanced incomplete block designs — the unitals on 28 points
- Solving a multigroup mixed-integer programming-based constrained discrimination model
- Title not available (Why is that?)
- Foldabilizing furniture
- Constructing error-correcting binary codes using transitive permutation groups
- On the enumeration of \(E(s^2)\)-optimal and minimax-optimal k-circulant supersaturated designs
- Strongly regular configurations
- Switching for small strongly regular graphs
- Connected pseudoachromatic index of complete graphs
- Constructions of maximum few-distance sets in Euclidean spaces
- Difference matrices with five rows over finite abelian groups
This page was built for software: Cliquer
