Improving Depth-First PN-Search: 1 + epsilon Trick. - Jakub Pawlewicz; Lukasz Lew (Computers and Games, 2006)

Order Statistics in the Farey Sequences in Sublinear Time. - Jakub Pawlewicz (ESA, 2007)

Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons. - Jakub Pawlewicz; Mihai Patrascu (Algorithmica, 2009)

Nearly Optimal Computer Play in Multi-player Yahtzee. - Jakub Pawlewicz (Computers and Games, 2010)

Counting Square-Free Numbers - Jakub Pawlewicz (CoRR, 2011)

Towards Optimal Play in Multi-Player Yahtzee. - Jakub Pawlewicz (J. Int. Comput. Games Assoc., 2011)

MoHex 2.0: A Pattern-Based MCTS Hex Player. - Shih-Chieh Huang; Broderick Arneson; Ryan B. Hayward; Martin Müller 003; Jakub Pawlewicz (Computers and Games, 2013)

Scalable Parallel DFPN Search. - Jakub Pawlewicz; Ryan B. Hayward (Computers and Games, 2013)

MOHEX Wins Hex Tournament. - Ryan Hayward; Broderick Arneson; Shih-Chieh Huang; Jakub Pawlewicz (J. Int. Comput. Games Assoc., 2013)

Feature Strength and Parallelization of Sibling Conspiracy Number Search. - Jakub Pawlewicz; Ryan B. Hayward (ACG, 2015)

485 - A New Upper Bound for Morpion Solitaire. - Henryk Michalewski; Andrzej Nagórko; Jakub Pawlewicz (CGW/GIGA@IJCAI, 2015)

Sibling Conspiracy Number Search. - Jakub Pawlewicz; Ryan B. Hayward (SOCS, 2015)

Stronger Virtual Connections in Hex. - Jakub Pawlewicz; Ryan B. Hayward; Philip Henderson; Broderick Arneson (IEEE Trans. Comput. Intell. AI Games, 2015)

An upper bound of 84 for Morpion Solitaire 5D. - Henryk Michalewski; Andrzej Nagórko; Jakub Pawlewicz (CCCG, 2016)

Conspiracy number search with relative sibling scores. - Jakub Pawlewicz; Ryan B. Hayward (Theor. Comput. Sci., 2016)

Mohex Wins 2015 Hex 11×11 and Hex 13×13 Tournaments. - Ryan Hayward; Jakub Pawlewicz; Kei Takada; Ton van der Valk (J. Int. Comput. Games Assoc., 2017)

Equal-Subset-Sum Faster Than the Meet-in-the-Middle. - Marcin Mucha; Jesper Nederlof; Jakub Pawlewicz; Karol Wegrzycki (ESA, 2019)

Recoloring Interval Graphs with Limited Recourse Budget. - Bartlomiej Bosek; Yann Disser; Andreas Emil Feldmann; Jakub Pawlewicz; Anna Zych-Pawlewicz (SWAT, 2020)

Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. - Adam Karczmarz; Jakub Pawlewicz; Piotr Sankowski (SoCG, 2021)

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. - Jesper Nederlof; Jakub Pawlewicz; Céline M. F. Swennenhuis; Karol Wegrzycki (SIAM J. Comput., 2023)