| MoHex 2.0: A Pattern-Based MCTS Hex Player SC Huang, B Arneson, RB Hayward, M Müller, J Pawlewicz International Conference on Computers and Games, 60-71, 2013 | 71 | 2013 |
| Scalable parallel DFPN search J Pawlewicz, RB Hayward International Conference on Computers and Games, 138-150, 2013 | 45 | 2013 |
| Improving Depth-First PN-Search: 1 + ε Trick J Pawlewicz, Ł Lew Computers and Games: 5th International Conference, CG 2006, Turin, Italy …, 2007 | 34 | 2007 |
| Stronger Virtual Connections in Hex J Pawlewicz, R Hayward, P Henderson, B Arneson IEEE Transactions on Computational Intelligence and AI in Games 7 (2), 156-166, 2015 | 22 | 2015 |
| Equal-subset-sum faster than the meet-in-the-middle M Mucha, J Nederlof, J Pawlewicz, K Węgrzycki arXiv preprint arXiv:1905.02424, 2019 | 20 | 2019 |
| Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons J Pawlewicz, M Pătraşcu Algorithmica 55, 271-282, 2009 | 18 | 2009 |
| Mohex wins Hex tournament RB Hayward, B Arneson, SC Huang, J Pawlewicz ICGA Journal 36 (3), 180-183, 2013 | 13 | 2013 |
| Mohex Wins 2015 Hex 11× 11 and Hex 13× 13 Tournaments. R Hayward, J Pawlewicz, K Takada, T van der Valk J. Int. Comput. Games Assoc. 39 (1), 60-64, 2017 | 8 | 2017 |
| Sibling conspiracy number search J Pawlewicz, R Hayward Proceedings of the International Symposium on Combinatorial Search 6 (1 …, 2015 | 8 | 2015 |
| Recoloring interval graphs with limited recourse budget B Bosek, Y Disser, AE Feldmann, J Pawlewicz, A Zych-Pawlewicz Leibniz International Proceedings in Informatics, LIPIcs 162, 17, 2020 | 7 | 2020 |
| A faster exponential time algorithm for bin packing with a constant number of bins via additive combinatorics J Nederlof, J Pawlewicz, CMF Swennenhuis, K Węgrzycki SIAM Journal on Computing 52 (6), 1369-1412, 2023 | 6 | 2023 |
| Nearly optimal computer play in multi-player yahtzee J Pawlewicz Computers and Games: 7th International Conference, CG 2010, Kanazawa, Japan …, 2011 | 6 | 2011 |
| Order statistics in the Farey sequences in sublinear time J Pawlewicz European Symposium on Algorithms, 218-229, 2007 | 6 | 2007 |
| Conspiracy number search with relative sibling scores J Pawlewicz, RB Hayward Theoretical Computer Science 644, 127-142, 2016 | 5 | 2016 |
| Benzene, 2009-2012 B Arneson, P Henderson, RB Hayward, J Pawlewicz | 5 | |
| 485–A New Upper Bound for Morpion Solitaire H Michalewski, A Nagórko, J Pawlewicz Computer Games: Fourth Workshop on Computer Games, CGW 2015, and the Fourth …, 2016 | 4 | 2016 |
| Counting square-free numbers J Pawlewicz arXiv preprint arXiv:1107.4890, 2011 | 4 | 2011 |
| Feature strength and parallelization of sibling conspiracy number search J Pawlewicz, RB Hayward Advances in Computer Games, 198-209, 2015 | 3 | 2015 |
| An upper bound of 84 for Morpion Solitaire 5D. H Michalewski, A Nagórko, J Pawlewicz CCCG, 270-278, 2016 | 2 | 2016 |
| Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs A Karczmarz, J Pawlewicz, P Sankowski arXiv preprint arXiv:2103.09684, 2021 | | 2021 |
