Quick Max-flow Algorithm. - Przemyslaw Gordinowicz (J. Math. Model. Algorithms, 2009)

Bounds and constructions for n-e.c. tournaments. - Anthony Bonato; Przemyslaw Gordinowicz; Pawel Pralat (Contributions Discret. Math., 2010)

On graphs isomorphic to their neighbour and non-neighbour sets. - Przemyslaw Gordinowicz (Eur. J. Comb., 2010)

The first player wins the one-colour triangle avoidance game on 16 vertices. - Przemyslaw Gordinowicz; Pawel Pralat (Discuss. Math. Graph Theory, 2012)

polish - Let us play the cleaning game. - Przemyslaw Gordinowicz; Richard J. Nowakowski; Pawel Pralat (Theor. Comput. Sci., 2012)

The Capture Time of the Hypercube. - Anthony Bonato; Przemyslaw Gordinowicz; Bill Kinnersley; Pawel Pralat (Electron. J. Comb., 2013)

The robber strikes back. - Anthony Bonato; Stephen Finbow; Przemyslaw Gordinowicz; Ali Haidar; William B. Kinnersley; Dieter Mitsche; Pawel Pralat; Ladislav Stacho (CoRR, 2013)

On automorphisms of the countable p.e.c. graph. - Grzegorz Andrzejczak; Przemyslaw Gordinowicz (Discret. Math., 2013)

Brushing without capacity restrictions. - Darryn E. Bryant; Nevena Francetic; Przemyslaw Gordinowicz; David A. Pike; Pawel Pralat (Discret. Appl. Math., 2014)

Cops and Robbers on String Graphs. - Tomas Gavenciak; Przemyslaw Gordinowicz; Vít Jelínek; Pavel Klavík; Jan Kratochvíl (ISAAC, 2015)

Planar graph is on fire. - Przemyslaw Gordinowicz (Theor. Comput. Sci., 2015)

Cops and Robbers ordinals of cop-win trees. - Anthony Bonato; Przemyslaw Gordinowicz; Gena Hahn (Discret. Math., 2017)

Small on-line Ramsey numbers - a new approach. - Pawel Pralat; Przemyslaw Gordinowicz (Contributions Discret. Math., 2018)

Centroidal Localization Game. - Bartlomiej Bosek; Przemyslaw Gordinowicz; Jaroslaw Grytczuk; Nicolas Nisse; Joanna Sokól; Malgorzata Sleszynska-Nowak (Electron. J. Comb., 2018)

Localization game on geometric and planar graphs. - Bartlomiej Bosek; Przemyslaw Gordinowicz; Jaroslaw Grytczuk; Nicolas Nisse; Joanna Sokól; Malgorzata Sleszynska-Nowak (Discret. Appl. Math., 2018)

Cops and Robbers on intersection graphs. - Tomas Gavenciak; Przemyslaw Gordinowicz; Vít Jelínek; Pavel Klavík; Jan Kratochvíl (Eur. J. Comb., 2018)

The 2-surviving rate of planar graphs with average degree lower than. - Przemyslaw Gordinowicz (J. Graph Theory, 2018)

The polynomial method for list-colouring extendability of outerplanar graphs. - Przemyslaw Gordinowicz; Pawel Twardowski (Ars Math. Contemp., 2021)

Erratum: The 2-surviving rate of planar graphs with average degree lower than 9 2. - Przemyslaw Gordinowicz (J. Graph Theory, 2021)

On the Solvability of the Discrete s(x, ·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs. - Filip Pietrusiak; Renata Wieteska; Przemyslaw Gordinowicz (Entropy, 2022)

Edge and Pair Queries-Random Graphs and Complexity. - Dariusz Dereniowski; Przemyslaw Gordinowicz; Pawel Pralat (Electron. J. Comb., 2023)

On multidimensional generalization of binary search. - Dariusz Dereniowski; Przemyslaw Gordinowicz; Karolina Wróbel (CoRR, 2024)