Estimating clique size via discarding subgraphs. | 0 | 0.34 | 2021 |
Benchmark Problems For Exhaustive Exact Maximum Clique Search Algorithms | 0 | 0.34 | 2019 |
Reducing hypergraph coloring to clique search | 0 | 0.34 | 2019 |
A Different Approach to Maximum Clique Search | 0 | 0.34 | 2018 |
Decomposing clique search problems into smaller instances based on node and edge colorings. | 1 | 0.35 | 2018 |
Verifying a conjecture of L. Rédei for p=13. | 0 | 0.34 | 2011 |
Polyhedra without diagonals II | 0 | 0.34 | 2009 |
Small P-Groups With Full-Rank Factorization | 0 | 0.34 | 2008 |
Nonquasi-Periodic Factorizations For Certain Finite Abelian Groups | 0 | 0.34 | 2007 |
Elementary P-Groups With The Redei Property | 2 | 0.46 | 2007 |
Completing codes and the Rédei property of groups | 4 | 0.71 | 2006 |
Factoring Finite Abelian Groups by Subsets with Maximal Span | 1 | 0.39 | 2006 |
The number of distinct symbols in sections of rectangular arrays | 2 | 0.49 | 2006 |