| On the Query Complexity of Black-Peg AB-Mastermind. | 0 | 0.34 | 2018 |
| Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection. | 1 | 0.36 | 2015 |
| A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions. | 1 | 0.35 | 2013 |
| Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation | 2 | 0.41 | 2013 |
