The Theory of Zero-Suppressed BDDs and the Number of Knight‘s Tours
Formal Methods in System Design
Generalized knight's tours on rectangular chessboards
Discrete Applied Mathematics - Special issue: Max-algebra
Optimal algorithms for constructing knight's tours on arbitrary n×m chessboards
Discrete Applied Mathematics
Optimal algorithms for constructing knight's tours on arbitrary n×m chessboards
Discrete Applied Mathematics
Hi-index | 0.04 |