Distinguishing Cartesian Product of Countable Graphs, The work appeared in Discussiones Mathematicae - Graph Theory 37 (2017) 155–164.

The Distinguishing Index of the Cartesian Product of finite Graphs, The work appeared in Ars Mathematica Contemporanea 12 (2017) 77–87.

Dense Arbitrarily Partitionable Graphs, This work appeared in Discussiones Mathematicae - Graph Theory 36 (2016), 5-22.

Edge Motion and the Distinguishing Index, The work appeared in Theoretical Computer Science 678 (2017) 56–62.

Distinguishing graphs by total colourings, The work was published in Ars Mathematica Contemporanea 11 (2016), 79–89.

All functions g : N -> N which have a single-fold Diophantine representation are dominated by a limit-computable function f : N \{0} -> N which is implemented in MuPAD and whose computability is an open problem.

This article is available at

http://dx.doi.org/10.1007/978-3-319-18275-9_24

and appeared in Computation, cryptography, and network security (eds. NJ Daras and M. Th. Rassias ),
Springer, 2015, 577-590.

An infinite loop in MuPAD which implements a limit computable function f:N\{0}→N\{0} that cannot be bounded by any computable function

Asymptotically optimal neighbour sum distinguishing colourings of graphs

Distance magic circulant graphs

Endomorphism Breaking in Graphs, The work appeared in The Electronic Journal of Combinatorics 21 (2014) P1.16.

On the Cartesian product of an arbitrarily partitionable graph and a traceable graph, The work appeared in "Discrete Math. Theoretical Computer Science" 16 (2014), 225-232.

Is there an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the number of integer solutions if the solution set is finite?

Distinguishing graphs by edge-colourings, This work has been published in European J. Combin. 45 (2015), 124-131.

How to personalize the vertices of a graph?, The work appeared in the European Journal of Combinatorics 40 (2014), 116-123.

On decomposing regular graphs into locally irregular subgraphs

A function which does not have any finite-fold Diophantine representation and probably equals ...

On embedding graphs with bounded sum of size and maximum degree

Near packings of graphs

Distant irregularity strength of graphs

Universal third parts of any complete 2-graph and none of DK₅

Cordial labeling of hypertrees, The work appeared in Discrete Mathematics 313 (22) (2013) 2518-2524.

Cheapest (Kq; k)-stable graphs

Distance magic (r, t)-hypercycles

On vertex stability with regard to complete k-partite graphs

False alarms in fault-tolerant, dominating sets in graphs, The work appeared in Opuscula Math. 32 (4) (2012), 751-760.

On (Kq; k)-stable graphs, The work will be published in J. Graph Theory; DOI: 10.1002 / jgt.21705.

Minimum number of palettes in edge colorings, The work appeared in Graphs and Combinatorics 30 (2014), 619-626.

Small systems of Diophantine equations which have only very large integer solutions

On the adjacent-vertex-distinguishing index by sums in total proper colorings,  The work entitled: On the total-neighbor-distinguishing index by sums appeared in Graphs and Combinatorics 31 (2015) 771–782 .

Edge-distinguishing index of a graph, The work appeared in Graphs and Combinatorics 30 (2014), 1469–1477.

A note on uniquely embeddable forests, The work was published in Discussiones Mathematicae-Graph Theory, 33 (2013), 193–201.

Neighbor sum distinguishing [k]-edge colorings, The work appeared in Graphs and Combinatorics 29 (2013), 1329–1336.

A note on uniquely embeddable cycles

Some conjectures on integer arithmetic

A hypothetical upper bound for solutions of a Diophantine equation with a finite number of solution, The improved work will be published by Fundamenta Informaticae 125 (1) (2013), 95-99, under the title: Does there exist an algorithm which to each Diophantine equation assigns an integer which is greater than the modulus of integer solutions, if these solutions form a finite set ?. From May 25 on the website: http://www.mimuw.edu.pl/~fundam/FI/previous/abs125.html

On packable digraphs, The work appeared in the SIAM J. Disc. Math. 24 (2010), 552-557.

Coloring chip configurations on graphs and digraphs, The work appeared in Information Processing Letters, 112 (2012), 1-4.

Total weight choosability of graphs, The work appeared in Electronic J. Combin., 18 (1) (2011), # 112.

On packing of two copies of a hypergraph, The work appeared in Discrete Math Theoretical Computer Science, 13 (3) (2011), 67-74.

A new upper bound for the total vertex irregularity strength of graphs [abstract], The work appeared in Discrete Mathematics 309 (2) (2009), 6316-6317.

Two conjectures on the arithmetic in R and C [abstract], The work appeared in Mathematical Logic Quarterly 56 (2) (2010), 175-184.

Linear bound on the irregularity strength and the total irregularity strength of graphs [abstract], The work appeared in the SIAM Journal on Discrete Mathematics 23 (1) (2009), 511-516.

Irregularity strength of regular graphs [abstract], The work appeared in the Electronic Journal of Combinatorics 15 (1) (2008), # 82.

A note on an embedding problem in transitive tournaments [abstract], The work appeared in Discrete Mathematics 310 (2010), 681-686.

Edge-disjoint open trails in complete bipartite multigraphs, The work appeared in Graphs and Comb. 26 (2) (2010) 207-214.

Factorization of K_n;n into (0;j)-prism, The work appeared in Information Processing Letters 109 (2009), 932-934.

Bipartite graphs decomposable into closed trails. The work was published in J. Combin. Math. Combin. Comput. 74 (2010) 207-216.

2-splittable and cordial graphs, The work appeared in Opuscula Mathematica 30/1 (2010) 61-67.

A note on a neighbour-distinguishing regular graphs total-weighting [abstract], The work appeared in the Electronic Journal of Combinatorics 15 (1) (2008), # 35.

Arbitrary decompositions into open and closed trails [abstract], The work appeared in Discrete Mathematics 309 (2009), 1511-1516.

On neighbour-distinguishing colourings from lists, The work was published in Discrete Math. Theoretical Computer Science 14 (2) (2012), 21-28.

Packing cycles and unicyclic graphs into planar graphs[abstract], The work appeared in Demonstratio Mathematica 4 (42), 673-679.

Vertex-distinguishing edge-colorings of sums of paths, The work appeared in Discussiones Mathematicae - Graph Theory 30 (1) (2010) 95-103.

1,2 Conjecture, II, The work appeared under the title "On 1,2 Conjecture" in Discrete Math Theoretical Computer Science, 12 (1) (2010), 101-108.

The open trails in digraphs, The work appeared in Opuscula Mathematica 31/4 (2011) 599-604.

1, 2 Conjecture

Irregular edge-colorings of sums of cycles of even lengths, [abstract], The work was published in Australas. J. Combinatorics 40 (2008), 41-56.

Decomposition of complete bipartite graphs into open trails

Decompositions of pseudographs into closed trails of even sizes,[abstract], The work appeared in Discrete Mathematics 309 (2009), 4903-4908.

On arbitrarily vertex decomposable unicyclic graphs with dominating cycle, [abstract], The work appeared in Discussiones Mathematicae Graph Theory 26 (3) (2006), 403-412.

An infinite loop in MuPAD which implements a limit computable function f:N\{0}→N\{0} that cannot be bounded by any computable function

A note on arbitrarily vertex decomposable graph,[abstract], The work appeared in Opuscula Mathematica 26 (2006), 109-118.

On-line arbitrarily vertex decomposable suns, [abstract], This work appeared in Discrete Mathematics 309 (2009), 6328-6336.

Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails, [abstract], The work appeared in Discussiones Mathematicae Graph Theory 27 (2) (2007), 241-249.

Arbitrarily vertex decomposable suns with few rays, [abstract], The work appeared in Discrete Mathematics 309 (2009), 3726-3732.

Inference of prototypical genetic sequences.

Semiretracts - algorithmic problems.

A note on packing of two copies of a hypergraph [abstract], The work appeared in Discussiones Mathematicae Graph Theory 27 (1) (2007), 45-49.

General neighbour-distinquishing index of a graph.

Arbitrary vertex decomposable caterpilars with four or five leaves, [abstract], The work appeared in Discussiones Mathematicae Graph Theory 26 (2) (2006), 291-305.

Chvátal-Erdős condition and pancyclism,[abstract], The work appeared in Discussiones Mathematicae Graph Theory 26 (2006), 335-342.

Li-Yorke theorem on chaos for trees.

A note on graphs containing all trees of a given size [abstract], The work appeared in  Ars Combinatoria 94 (2010), 517-520.

Existence results for arbitrarily vertex decomposable trees,

On the neighbour-distinguishing index of a graph [abstract], The work appeared in Graphs and Combinatorics 22 (2006), 341-350.

Strong isometric dimension, biclique coverings, and Sperner's Theorem.

Packing of three copies of a digraph into the transitive tournament (streszczenie), The work appeared in Discussiones Mathematicae Graph Theory 24 (3) (2004), 443-456.

Packing of two digraphs into a transitive tournament [abstract], The work appeared in Discrete Mathematics 307 (7-8) (2007), 971-974.

On arbitrarily vertex decomposable trees.