1. N. Hodur, M. Pilśniak, M. Prorok, I. Schiermeyer, On 3-colourability of (bull,H)-free graphs, preprint arXiv:2404.12515

2. M. Pilśniak, M. Woźniak, A note on edge colorings distinguishing all triangles in a graph, preprint arXiv:2407.19050

3. R. Kalinowski, M. Pilśniak, M. Stawiski, List majority edge-colorings of graphs, preprint arXiv:2312.00922

4. W. Imrich, R. Kalinowski, F. Lehner, M. Pilśniak, M. Stawiski, Asymmetrizing infinite trees, preprint arXiv:2301.10380

5. W. Imrich, R. Kalinowski, M. Pilśniak, Hierarchical products of graphs, accepted in ADAM (2024)

6. F. Lehner, M. Pilśniak, M. Stawiski, On asymmetric colourings of graphs with bounded degrees and infinite motion, preprint arXiv:1912.02560, accepted in Ars Math. Contemp. (2024)

51. M. Henning, S. Klavžar, E. Kleszcz, M. Pilśniak, The Sierpinski Domination Number, Ars Math. Contemp. 24 (2024) #P3.06; doi:10.26493/1855-3974.2892.f07	pdf
50. I. Grzelec, M. Pilśniak, M. Woźniak, A note on uniquely embeddable 2-factors, Appl. Math. Comput. 468 (2024) 128505; doi:10.1016/j.amc.2023.128505	pdf
49. F. Bock, R. Kalinowski, J. Pardey, M. Pilśniak, D. Rautenbach, M. Woźniak, Majority Edge-Colorings of Graphs, Electronic J. Comb. 30 (2023) #P1.42; doi:10.37236/11291	pdf
48. A. Gorzkowska, M. Henning, M. Pilśniak, E. Tumidajewicz, Total and Paired Domination Stability in Prisms, Discussiones Mathematicae Graph Theory 43 (2023) 1147-1169; doi:10.7151/dmgt.2421	pdf
47. R. Kalinowski, M. Pilśniak, M. Prorok, Distinguishing arc-colourings of symmetric digraphs, The Art of Discrete and Applied Mathematics 6 (2023) #2.04; doi:10.26493/2590-9770.1472.24b	pdf
46. A. Gorzkowska, M. Henning, E. Kleszcz, M. Pilśniak, Paired domination in Trees, Graphs and Combinatorics 38 (2022) 12922; doi:10.1007/s00373-022-02542-7	pdf
45. A. Gorzkowska, M. Henning, M. Pilśniak, E. Tumidajewicz, Paired domination stability in graphs, Ars Math. Contemp. 22 (2022) #P2.04; doi:10.26493/1855-3974.2522.eb3	pdf
44. R. Kalinowski, M. Pilśniak, Extremal graphs for the distinguishing index, Discrete Math. 345 (2022) 112905	pdf
43. F. Lehner, M. Pilśniak, M. Stawiski, Distinguishing infinite graphs with bounded degrees, J. Graph Theory (2022) 1-14; doi: /10.1002/jgt.22809	pdf
42. R. Kalinowski, M. Pilśniak, Proper distinguishing arc-colourings of symmetric digraphs, Appl. Math. Comput. 421 (2022) 126939; doi: /10.1016/j.amc.2022.126939	pdf
41. M. Henning, M. Pilśniak, E. Tumidajewicz, Bounds on the paired domination number of graphs with minimum degree at least three, Appl. Math. Comput. 417 (2022) 126782; doi: 10.1016/j.amc.2021.126782	pdf
40. M. Pilśniak, Nordhaus-Gaddum type inequalities for the distinguishing index, Ars Math. Contemp. 20 (2021) 223-231; doi:10.26493/1855-3974.2173.71a	pdf
39. W. Imrich, R. Kalinowski, M. Pilśniak, M. Woźniak, On asymmetric colourings of claw-free graphs, Electronic J. Comb. 28(3) (2021) P3.25	pdf

38. W. Imrich, R. Kalinowski, M. Pilśniak, M. Woźniak, The distinguishing index of connected graphs without pendant edges, Ars Math. Contemp. 18 (2020) 117-126; doi: 10.26493/1855-3974.1852.4f7	pdf
37. O. Baudon, H. Hevre, A. Marczyk, M. Pilśniak, J. Przybyło, M. Woźniak, Full neighbor distinguishing index, Discusiones Math. Gr. Th. 40 (2020) 1175-1186; doi:10.7151/dmgt.2223	pdf
36. F. Lehner, M. Pilśniak, M. Stawiski, A bound for the distinguishing index of regular graphs, Europ.J. Combin. 84 (2020) 103145; doi: 10.1016/j.ejc.2020.103145	pdf
35. M. Pilśniak, M. Stawiski, The Optimal General Upper Bound for the Distinguishing Index of Infinite Graphs, J. Graph Theory 93 (2020), 463-469; doi: 10.1002/jgt.22496	pdf
34. M. Pilśniak, T. Tucker, Distinguishing index of maps, Europ.J. Combin. 84 (2020) 103034; doi: 10.1016/j.ejc.2019.103034	pdf
33. I. Broere, W. Imrich, R. Kalinowski, M. Pilśniak, Automorphism breaking of products of graphs and digraphs, Discrete Appl. Math. 266 (2019) 56-64	pdf
32. W. Imrich, R. Kalinowski, M. Pilśniak, M. Shekarriz, Bounds for Distinguishing Invariants of Infinite Graphs, Electronic J. Comb. 24(3) (2017) P3.6	pdf
31. A. Gorzkowska, M. Pilśniak, Precise Bounds for the Distinguishing Index of the Cartesian Product, Theoret. Comput. Sci. 687 (2017) 62-69	pdf
30. R. Kalinowski, M. Pilśniak, M. Woźniak, A note on Breaking Small Automorphisms in Graphs, Discrete Appl. Math. 232 (2017) 221-225	pdf
29. O. Baudon, M. Shenhaji, M. Pilśniak, J. Przybyło, E. Sopena, M. Woźniak, Equitable neighbour-sum-distinguishing edge and total colourings, Discrete Applied Math. 222, (2017), 40-53	pdf
28. M. Pilśniak, Improving Upper Bounds for the Distinguishing Index, Ars Math. Contemp. 13 (2017) 259-274	pdf
27. O. Baudon, J. Bensmail, F. Foucaud, M. Pilśniak, On the size of the longest path in an online or recursively partitionable balloon, Discussiones Math. Graph Th. 37 (2017) 89-115	pdf
26. M. Pilśniak, Edge-Motion and the Distinguishing Index, Teoret. Comput. Science 678 (2017) 56-62	pdf
25. I. Broere, M.Pilśniak, The distinguishing index of the Cartesian product of countable graphs, Ars Math. Contemp. 13 (2017) 15-21	pdf
24. A. Gorzkowska, R. Kalinowski, M. Pilśniak, The Distinguishing Index of the Cartesian Product of Finite Graphs, Ars Math. Contemp. 12 (2017) 77-87	pdf
23. E. Estaji, W. Imrich, R. Kalinowski, M. Pilśniak, T. Tucker, Distinguishing number for the Cartesian product of countable graphs, Discussiones Mathematicae Graph Theory 37 (2017) 155-164	pdf
22. R. Kalinowski, M. Pilśniak, I. Schiermeyer, M. Woźniak, Dense arbitrarily partitionable graphs, Disscus. Math. Gr. Th. 36 (2016) 5-22	pdf
21. R. Kalinowski, M. Pilśniak, M. Woźniak, Distinguishing graphs by total colourings, Arc Math Contemp., (2016) 11:79-89	pdf

20. I. Broere, M. Pilśniak, The Distinguishing Index of the Infinite Graphs, Electronic Journal of Combinatorics 23(1) (2015), P1.78	pdf
19. R. Kalinowski, M. Pilśniak, Distinguishing graphs by edge-colourings, European J. Combin. 45 (2015) 124-131	pdf
18. M. Pilśniak, M. Woźniak, On the total neighbor distinguishing index by sums, Graphs and Combinatorics 31 (2015) 771-782	pdf
17. R. Kalinowski, M. Pilśniak, J. Przybyło, M. Woźniak, How to personalize the vertices of graphs?, European Journal of Combinatorics 40 (2014) 116-123	pdf
16. W. Imrich, R. Kalinowski, F. Lehner, M. Pilśniak, Endomorphism Breaking in Graphs, Electronic Journal of Combinatorics 21(1) (2014), P1.16	pdf
15. R. Kalinowski, M. Pilśniak, J. Przybyło, M. Woźniak, Can colour-blind distinguish colour palettes?, Electronic Journal of Combinatorics 20(3) (2013), P23	pdf
14. A. Borowiecki, J. Grytczuk, M. Pilśniak, Coloring chip configurations on graphs and digraphs, Information Processing Letters 112 (2012) 1-4;	pdf
13. M. Pilśniak, M. Woźniak, On packing of two copies of a hypergraph, Discrete Mathematics and Theoretical Computer Science 13:3 (2011) 67-74;	pdf

12. A. Goerlich, M. Pilśniak, A note on an embedding problem in transitive tournaments, Discrete Mathematics, 310 (2010) 681-686;	pdf
11. R. Kalinowski, M. Pilśniak, M. Woźniak, I. Zioło, On-line arbitrarily vertex decomposable suns, Discrete Mathematics 309 (2009) 6328-6336;	pdf
10. R. Kalinowski, M. Pilśniak, M. Woźniak, I. Zioło, Arbitrarily vertex decomposable suns with few rays, Discrete Mathematics 309 (2009) 3726-3732;	pdf
9. M. Pilśniak, M. Woźniak, A note on packing of two copies of a hypergraph, Discussiones Mathematicae Graph Theory 27(1) (2007) 45-49;	pdf
8. A. Goerlich, M. Pilśniak, M. Woźniak, I. Zioło, Fixed-point-free embeddings of digraphs with small size, Discrete Mathematics 307/11--12 (2007), 1332-1340;	pdf
7. A. Goerlich, R. Kalinowski, M. Meszka, M.P ilśniak, M. Woźniak, A note on decompositions of transitive tournaments II, Australasian J. of Combinatorics 37(2007) 57-66;	pdf
6. M. Pilśniak, Packing of two digraphs into the transitive tournament, Discrete Mathematics 307/7-8 (2007) 971-974;	pdf
5. A. Goerlich, R. Kalinowski, M. Meszka, M. Pilśniak, M. Woźniak, A note on decompositions of transitive tournaments, Discrete Mathematics 307 (2007) 896-904;	pdf
4. A. Goerlich, M. Pilśniak, M. Woźniak, A note on a packing problem in transitive tournaments, Graphs and Combinatorics 22:233-239 (2006);	pdf
3. M. Pilśniak, Packing of three copies of a digraph into the transitive tournament,Discussiones Mathematicae Graph Theory 24(3) (2004) 443-456;	pdf
2. A. Goerlich, M. Pilśniak, M. Woźniak, I. Zioło, A note on embedding graphs without short cycles, Discrete Mathematics, 286/1-2 (2004), 75-77;	pdf
1. A. Goerlich, M. Pilśniak, M. Woźniak, On cyclically embeddable (n,n)-graphs, Discussiones Mathematicae Graph Theory 23(1) (2003) 85-104;	pdf