Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| Algorithms for finding maximum transitive subtournaments. | 0 | 0.34 | 2016 |
| Russian doll search for the Steiner triple covering problem. | 6 | 0.49 | 2011 |
| A tournament of order 14 with disjoint Banks and Slater sets | 3 | 0.42 | 2010 |