Another View on the SSS* Algorithm. - Wim Pijls; Arie de Bruin (SIGAL International Symposium on Algorithms, 1990)

Searching Informed Game Trees. - Wim Pijls; Arie de Bruin (ISAAC, 1992)

Shortest Paths and Game Trees. - W. H. L. M. Pijls (J. Int. Comput. Games Assoc., 1992)

SSS*-Like Algorithms in Constrained Memory. - Wim Pijls; Arie de Bruin (J. Int. Comput. Games Assoc., 1993)

Solution Trees as a Basis for Game-Tree Search. - Arie de Bruin; Wim Pijls; Aske Plaat (J. Int. Comput. Games Assoc., 1994)

Best-First Fixed-Depth Game-Tree Search in Practice. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (IJCAI, 1995)

Exploiting Graph Properties of Game Trees. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (AAAI/IAAI, Vol. 1, 1996)

Trends in Game Tree Search. - Arie de Bruin; Wim Pijls (SOFSEM, 1996)

Best-First Fixed-Depth Minimax Algorithms. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (Artif. Intell., 1996)

A Theory of Game Trees, Based on Solution Trees. - Wim Pijls; Arie de Bruin (SOFSEM, 1997)

Classification Based upon Frequent Patterns. - Wim Pijls; Rob Potharst (PRICAI Workshops, 2000)

LR and LL parsing: some new points of view. - Wim Pijls (ACM SIGCSE Bull., 2000)

Some Properties Related to Mercator Projection. - Wim Pijls (Am. Math. Mon., 2001)

Game tree algorithms and solution trees. - Wim Pijls; Arie de Bruin (Theor. Comput. Sci., 2001)

Apriori, A Depth First Implementation. - Walter A. Kosters; Wim Pijls (FIMI, 2003)

Complexity Analysis of Depth First and FP-Growth Implementations of APRIORI. - Walter A. Kosters; Wim Pijls; Viara Popova (MLDM, 2003)

A new bidirectional search algorithm with shortened postprocessing. - Wim Pijls; Henk Post (Eur. J. Oper. Res., 2009)

Note on "A new bidirectional algorithm for shortest paths". - Wim Pijls; Henk Post (Eur. J. Oper. Res., 2010)

A New Paradigm for Minimax Search. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (CoRR, 2014)

SSS* = Alpha-Beta + TT. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (CoRR, 2014)

Nearly Optimal Minimax Tree Search? - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (CoRR, 2014)

Best-First and Depth-First Minimax Search in Practice. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (CoRR, 2015)

A Minimax Algorithm Better Than Alpha-beta?: No and Yes. - Aske Plaat; Jonathan Schaeffer 001; Wim Pijls; Arie de Bruin (CoRR, 2017)