On cyclically embeddable (n, n)-graphs. - Agnieszka Görlich; Monika Pilsniak; Mariusz Wozniak (Discuss. Math. Graph Theory, 2003)

A note on embedding graphs without short cycles. - Agnieszka Görlich; Monika Pilsniak; Mariusz Wozniak; Irmina A. Ziolo (Discret. Math., 2004)

Packing of three copies of a digraph into the transitive tournament. - Monika Pilsniak (Discuss. Math. Graph Theory, 2004)

Some families of arbitrarily vertex decomposable graphs. - Rafal Kalinowski; Monika Pilsniak; Mariusz Wozniak; Irmina A. Ziolo (Electron. Notes Discret. Math., 2005)

A Note on a Packing Problem in Transitive Tournaments. - Agnieszka Görlich; Monika Pilsniak; Mariusz Wozniak (Graphs Comb., 2006)

A note on decompositions of transitive tournaments II. - Agnieszka Görlich; Rafal Kalinowski; Mariusz Meszka; Monika Pilsniak; Mariusz Wozniak (Australas. J Comb., 2007)

A note on decompositions of transitive tournaments. - Agnieszka Görlich; Rafal Kalinowski; Mariusz Meszka; Monika Pilsniak; Mariusz Wozniak (Discret. Math., 2007)

Fixed-point-free embeddings of digraphs with small size. - Agnieszka Görlich; Monika Pilsniak; Mariusz Wozniak; Irmina A. Ziolo (Discret. Math., 2007)

Packing of two digraphs into a transitive tournament. - Monika Pilsniak (Discret. Math., 2007)

A note on packing of two copies of a hypergraph. - Monika Pilsniak; Mariusz Wozniak (Discuss. Math. Graph Theory, 2007)

Arbitrarily vertex decomposable suns with few rays. - Rafal Kalinowski; Monika Pilsniak; Mariusz Wozniak; Irmina A. Ziolo (Discret. Math., 2009)

On-line arbitrarily vertex decomposable suns. - Rafal Kalinowski; Monika Pilsniak; Mariusz Wozniak; Irmina A. Ziolo (Discret. Math., 2009)

A note on an embedding problem in transitive tournaments. - Agnieszka Görlich; Monika Pilsniak (Discret. Math., 2010)

On packing of two copies of a hypergraph. - Monika Pilsniak; Mariusz Wozniak (Discret. Math. Theor. Comput. Sci., 2011)

Coloring chip configurations on graphs and digraphs. - Mieczyslaw Borowiecki; Jaroslaw Grytczuk; Monika Pilsniak (Inf. Process. Lett., 2012)

Can Colour-Blind Distinguish Colour Palettes? - Rafal Kalinowski; Monika Pilsniak; Jakub Przybylo; Mariusz Wozniak (Electron. J. Comb., 2013)

Endomorphism Breaking in Graphs. - Wilfried Imrich; Rafal Kalinowski; Florian Lehner; Monika Pilsniak (Electron. J. Comb., 2014)

How to personalize the vertices of a graph? - Rafal Kalinowski; Monika Pilsniak; Jakub Przybylo; Mariusz Wozniak (Eur. J. Comb., 2014)

The Distinguishing Index of Infinite Graphs. - Izak Broere; Monika Pilsniak (Electron. J. Comb., 2015)

Distinguishing graphs by edge-colourings. - Rafal Kalinowski; Monika Pilsniak (Eur. J. Comb., 2015)

On the Total-Neighbor-Distinguishing Index by Sums. - Monika Pilsniak; Mariusz Wozniak (Graphs Comb., 2015)

Distinguishing graphs by total colourings. - Rafal Kalinowski; Monika Pilsniak; Mariusz Wozniak (Ars Math. Contemp., 2016)

Preface. - Rafal Kalinowski; Monika Pilsniak; Mariusz Wozniak (Discret. Math., 2016)

Dense arbitrarily partitionable graphs. - Rafal Kalinowski; Monika Pilsniak; Ingo Schiermeyer; Mariusz Wozniak (Discuss. Math. Graph Theory, 2016)

The distinguishing index of the Cartesian product of countable graphs. - Izak Broere; Monika Pilsniak (Ars Math. Contemp., 2017)

The distinguishing index of the Cartesian product of finite graphs. - Aleksandra Gorzkowska; Rafal Kalinowski; Monika Pilsniak (Ars Math. Contemp., 2017)

Improving upper bounds for the distinguishing index. - Monika Pilsniak (Ars Math. Contemp., 2017)

Bounds for Distinguishing Invariants of Infinite Graphs. - Wilfried Imrich; Rafal Kalinowski; Monika Pilsniak; Mohammad Hadi Shekarriz (Electron. J. Comb., 2017)

Equitable neighbour-sum-distinguishing edge and total colourings. - Olivier Baudon; Monika Pilsniak; Jakub Przybylo; Mohammed Senhaji; Éric Sopena; Mariusz Wozniak (Discret. Appl. Math., 2017)

A note on breaking small automorphisms in graphs. - Rafal Kalinowski; Monika Pilsniak; Mariusz Wozniak (Discret. Appl. Math., 2017)

Structural properties of recursively partitionable graphs with connectivity 2. - Olivier Baudon; Julien Bensmail; Florent Foucaud; Monika Pilsniak (Discuss. Math. Graph Theory, 2017)

Distinguishing Cartesian products of countable graphs. - Ehsan Estaji; Wilfried Imrich; Rafal Kalinowski; Monika Pilsniak; Thomas W. Tucker (Discuss. Math. Graph Theory, 2017)

Precise bounds for the distinguishing index of the Cartesian product. - Aleksandra Gorzkowska; Monika Pilsniak (Theor. Comput. Sci., 2017)

Edge motion and the distinguishing index. - Monika Pilsniak (Theor. Comput. Sci., 2017)

Asymmetric colorings of products of graphs and digraphs. - Izak Broere; Wilfried Imrich; Rafal Kalinowski; Monika Pilsniak (Discret. Appl. Math., 2019)

The distinguishing index of connected graphs without pendant edges. - Wilfried Imrich; Rafal Kalinowski; Monika Pilsniak; Mariusz Wozniak (Ars Math. Contemp., 2020)

On a total version of 1-2-3 Conjecture. - Olivier Baudon; Hervé Hocquard; Antoni Marczyk; Monika Pilsniak; Jakub Przybylo; Mariusz Wozniak (Discuss. Math. Graph Theory, 2020)

A bound for the distinguishing index of regular graphs. - Florian Lehner; Monika Pilsniak; Marcin Stawiski (Eur. J. Comb., 2020)

Distinguishing index of maps. - Monika Pilsniak; Thomas W. Tucker (Eur. J. Comb., 2020)

The optimal general upper bound for the distinguishing index of infinite graphs. - Monika Pilsniak; Marcin Stawiski (J. Graph Theory, 2020)

Nordhaus-Gaddum type inequalities for the distinguishing index. - Monika Pilsniak (Ars Math. Contemp., 2021)

On Asymmetric Colourings of Claw-Free Graphs. - Wilfried Imrich; Rafal Kalinowski; Monika Pilsniak; Mariusz Wozniak (Electron. J. Comb., 2021)

Bounds on the paired domination number of graphs with minimum degree at least three. - Michael A. Henning; Monika Pilsniak; Elzbieta Tumidajewicz (Appl. Math. Comput., 2022)

Proper distinguishing arc-colourings of symmetric digraphs. - Rafal Kalinowski; Monika Pilsniak (Appl. Math. Comput., 2022)

Paired domination stability in graphs. - Aleksandra Gorzkowska; Michael A. Henning; Monika Pilsniak; Elzbieta Tumidajewicz (Ars Math. Contemp., 2022)

Extremal graphs for the distinguishing index. - Rafal Kalinowski; Monika Pilsniak (Discret. Math., 2022)

Corrigendum to "A bound for the distinguishing index of regular graphs" [European J. Combin. 89 (2020) 103145]. - Florian Lehner; Monika Pilsniak; Marcin Stawiski (Eur. J. Comb., 2022)

Paired Domination in Trees. - Aleksandra Gorzkowska; Michael A. Henning; Elzbieta Kleszcz; Monika Pilsniak (Graphs Comb., 2022)

Distinguishing infinite graphs with bounded degrees. - Florian Lehner; Monika Pilsniak; Marcin Stawiski (J. Graph Theory, 2022)

Distinguishing arc-colourings of symmetric digraphs. - Rafal Kalinowski; Monika Pilsniak; Magdalena Prorok (Art Discret. Appl. Math., 2022)

Majority Edge-Colorings of Graphs. - Felix Bock; Rafal Kalinowski; Johannes Pardey; Monika Pilsniak; Dieter Rautenbach; Mariusz Wozniak (Electron. J. Comb., 2023)

Total and paired domination stability in prisms. - Aleksandra Gorzkowska; Michael A. Henning; Monika Pilsniak; Elzbieta Tumidajewicz (Discuss. Math. Graph Theory, 2023)

The Sierpiński domination number. - Michael A. Henning; Sandi Klavzar; Elzbieta Kleszcz; Monika Pilsniak (Ars Math. Contemp., 2024)

A note on uniquely embeddable 2-factors. - Igor Grzelec; Monika Pilsniak; Mariusz Wozniak (Appl. Math. Comput., 2024)

Hierarchical product graphs and their prime factorization. - Wilfried Imrich; Rafal Kalinowski; Monika Pilsniak (Art Discret. Appl. Math., 2025)

Unfriendly Partition Conjecture Holds for Line Graphs. - Rafal Kalinowski; Monika Pilsniak; Marcin Stawiski (Comb., 2025)

Finding large k-colorable induced subgraphs in (bull, chair)-free and (bull,E)-free graphs. - Nadzieja Hodur; Monika Pilsniak; Magdalena Prorok; Pawel Rzazewski (CoRR, 2025)

Distinguishing symmetric digraphs by proper arc-colourings of type I. - Rafal Kalinowski; Monika Pilsniak; Magdalena Prorok (Discret. Math., 2026)