| The Distinguishing Index Of Connected Graphs Without Pendant Edges | 0 | 0.34 | 2020 |
| A note on breaking small automorphisms in graphs. | 0 | 0.34 | 2017 |
| On weight choosabilities of graphs with bounded maximum average degree. | 1 | 0.39 | 2017 |
| A note on neighbor expanded sum distinguishing index. | 0 | 0.34 | 2017 |
| On a directed variation of the 1-2-3 and 1-2 Conjectures. | 3 | 0.41 | 2017 |
| Equitable neighbour-sum-distinguishing edge and total colourings. | 2 | 0.38 | 2017 |
| Distinguishing graphs by total colourings | 1 | 0.41 | 2016 |
| Minimum Number of Palettes in Edge Colorings | 3 | 0.47 | 2014 |
| Edge-Distinguishing Index of a Graph | 0 | 0.34 | 2014 |
| Arbitrary decompositions into open and closed trails | 1 | 0.39 | 2009 |
| Arbitrarily vertex decomposable suns with few rays | 7 | 0.87 | 2009 |
| On-line arbitrarily vertex decomposable suns | 5 | 0.60 | 2009 |
| Decompositions of pseudographs into closed trails of even sizes | 2 | 0.51 | 2009 |
| General neighbour-distinguishing index of a graph | 9 | 0.70 | 2008 |
| On arbitrarily vertex decomposable trees | 8 | 0.98 | 2008 |
| Fixed-point-free embeddings of digraphs with small size | 3 | 0.65 | 2007 |
| A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs | 4 | 0.61 | 2007 |
| A note on decompositions of transitive tournaments | 0 | 0.34 | 2007 |
| A Chvátal-Erdős type condition for pancyclability | 0 | 0.34 | 2007 |
| On the Neighbour-Distinguishing Index of a Graph | 35 | 2.37 | 2006 |
| On self-complementary supergraphs of (n,n)-graphs | 3 | 0.52 | 2005 |
| Some families of arbitrarily vertex decomposable graphs | 0 | 0.34 | 2005 |
| On the Achromatic Index of for a Prime <Emphasis Type="Italic">q</Emphasis> | 0 | 0.34 | 2004 |
| A note on pancyclism of highly connected graphs | 3 | 0.47 | 2004 |
| On Cyclic Packing of a Tree | 1 | 0.61 | 2004 |
| A note on embedding graphs without short cycles | 2 | 0.61 | 2004 |
| Packing of graphs and permutations—a survey | 3 | 0.50 | 2004 |
| Cycles in Hamiltonian graphs of prescribed maximum degree | 3 | 0.45 | 2003 |
| On the packing of three graphs | 5 | 0.72 | 2001 |
| A note on the vertex-distinguishing proper coloring of graphs with large minimum degree | 9 | 0.89 | 2001 |
| Note on compact packing of a graph | 0 | 0.34 | 2001 |
| Packing two copies of a tree into its fourth power | 9 | 0.97 | 2000 |
| Packing of graphs and permutations | 0 | 0.34 | 2000 |
| On the vertex-distinguishing proper edge-colorings of graphs | 34 | 7.65 | 1999 |
| On graphs which contain each tree of given size | 1 | 0.44 | 1997 |
| The Erdős–Sós Conjecture for Graphs withoutC4 | 3 | 0.79 | 1997 |
| A note on packing of three forests | 0 | 0.34 | 1997 |
| The Erdős-So´s conjecture for graphs without C4 | 6 | 0.97 | 1997 |
| The Erdős–Sós Conjecture for Graphs withoutC4 | 0 | 0.34 | 1997 |
| Packing three trees. | 4 | 0.52 | 1996 |
| Edge-disjoint placement of three trees | 7 | 0.97 | 1996 |
| On the Erdös‐Sós conjecture | 3 | 0.76 | 1996 |
| Embedding graphs of small size | 15 | 1.45 | 1994 |
| Triple placement of graphs | 9 | 1.13 | 1993 |
| A note on minimal order of a bipartite graph with exactly q quadrilaterals | 0 | 0.34 | 1993 |
