Partitions of some planar graphs into two linear forests. - Piotr Borowiecki; Mariusz Haluszczak (Discuss. Math. Graph Theory, 1997)

P-bipartitions of minor hereditary properties. - Piotr Borowiecki; Jaroslav Ivanco (Discuss. Math. Graph Theory, 1997)

On-line P-coloring of graphs. - Piotr Borowiecki (Discuss. Math. Graph Theory, 2006)

On-Line Partitioning for On-Line Scheduling with Resource Conflicts. - Piotr Borowiecki (PPAM, 2007)

Preface of guest editors. - Piotr Borowiecki; Danuta Michalak; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2009)

GreedyMAX-type Algorithms for the Maximum Independent Set Problem. - Piotr Borowiecki; Frank Göring (SOFSEM, 2011)

Parity vertex colouring of graphs. - Piotr Borowiecki; Kristína Budajová; Stanislav Jendrol'; Stanislav Krajci (Discuss. Math. Graph Theory, 2011)

Preface. - Piotr Borowiecki; Ewa Drgas-Burchardt; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2011)

Dynamic Coloring of Graphs. - Piotr Borowiecki; Elzbieta Sidorowicz (Fundam. Informaticae, 2012)

The potential of greed for independence. - Piotr Borowiecki; Frank Göring; Jochen Harant; Dieter Rautenbach (J. Graph Theory, 2012)

On-line ranking of split graphs. - Piotr Borowiecki; Dariusz Dereniowski (Discret. Math. Theor. Comput. Sci., 2013)

Brushing with additional cleaning restrictions. - Piotr Borowiecki; Dariusz Dereniowski; Pawel Pralat (Theor. Comput. Sci., 2014)

New potential functions for greedy independence and coloring. - Piotr Borowiecki; Dieter Rautenbach (Discret. Appl. Math., 2015)

Distributed graph searching with a sense of direction. - Piotr Borowiecki; Dariusz Dereniowski; Lukasz Kuszner (Distributed Comput., 2015)

Minimum order of graphs with given coloring parameters. - Gábor Bacsó; Piotr Borowiecki; Mihály Hujter; Zsolt Tuza (Discret. Math., 2015)

Distributed Evacuation in Graphs with Multiple Exits. - Piotr Borowiecki; Shantanu Das 001; Dariusz Dereniowski; Lukasz Kuszner (SIROCCO, 2016)

Independence in uniform linear triangle-free hypergraphs. - Piotr Borowiecki; Michael Gentner; Christian Löwenstein; Dieter Rautenbach (Discret. Math., 2016)

Dynamic F-free Coloring of Graphs. - Piotr Borowiecki; Elzbieta Sidorowicz (Graphs Comb., 2018)

Computational aspects of greedy partitioning of graphs. - Piotr Borowiecki (J. Comb. Optim., 2018)

Graph classes generated by Mycielskians. - Mieczyslaw Borowiecki; Piotr Borowiecki; Ewa Drgas-Burchardt; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2020)

The complexity of bicriteria tree-depth. - Piotr Borowiecki; Dariusz Dereniowski; Dorota Osula (Theor. Comput. Sci., 2023)

Hypergraph operations preserving sc-greediness. - Piotr Borowiecki; Ewa Drgas-Burchardt; Elzbieta Sidorowicz (Discuss. Math. Graph Theory, 2024)

Discrete evacuation in graphs with multiple exits. - Piotr Borowiecki; Shantanu Das 001; Dariusz Dereniowski; Lukasz Kuszner (Theor. Comput. Sci., 2025)

A framework for distributed discrete evacuation strategies. - Piotr Borowiecki; Dariusz Dereniowski; Lukasz Kuszner (CoRR, 2025)