| 2008 |
|---|
| 38 | EE | Ioan Tomescu:
Discrepancies between metric dimension and partition dimension of a connected graph.
Discrete Mathematics 308(22): 5026-5031 (2008) |
| 2007 |
|---|
| 37 | | Ioan Tomescu,
Imran Javaid,
Slamin:
On the partition dimension and connected partition dimension of wheels.
Ars Comb. 84: (2007) |
| 36 | EE | Ioan Tomescu:
On the number of words containing the factor (aba)k.
Discrete Applied Mathematics 155(11): 1506-1511 (2007) |
| 35 | EE | Ioan Tomescu:
On the chromaticity of sunflower hypergraphs SH(n, p, h).
Discrete Mathematics 307(6): 781-786 (2007) |
| 2006 |
|---|
| 34 | EE | Surahmat,
Edy Tri Baskoro,
Ioan Tomescu:
The Ramsey numbers of large cycles versus wheels.
Discrete Mathematics 306(24): 3334-3337 (2006) |
| 33 | EE | Ioan Tomescu:
A characterization of the words occurring as factors in a minimum number of words.
Theor. Comput. Sci. 352(1-3): 329-331 (2006) |
| 2005 |
|---|
| 32 | EE | Ioan Tomescu:
Asymptotic Properties of the Factors of Words Over a Finite Alphabet.
Fundam. Inform. 64(1-4): 463-470 (2005) |
| 2004 |
|---|
| 31 | EE | Ioan Tomescu:
Sunflower hypergraphs are chromatically unique.
Discrete Mathematics 285(1-3): 355-357 (2004) |
| 2003 |
|---|
| 30 | | Ioan Tomescu:
On the number of occurrences of all short factors in almost all words.
Theor. Comput. Sci. 290(3): 2031-2035 (2003) |
| 2002 |
|---|
| 29 | EE | Ioan Tomescu:
On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques.
COCOON 2002: 544-553 |
| 28 | EE | Ioan Tomescu:
On the number of h-connected graphs with a fixed diameter.
Discrete Mathematics 252(1-3): 279-285 (2002) |
| 27 | EE | Ioan Tomescu:
Irreducible Coverings by Cliques and Sperner's Theorem.
Electr. J. Comb. 9(1): (2002) |
| 2001 |
|---|
| 26 | EE | Ioan Tomescu:
On the number of graphs and h-hypergraphs with bounded diameter.
Discrete Mathematics 235(1-3): 291-299 (2001) |
| 2000 |
|---|
| 25 | EE | Ioan Tomescu:
On the number of large h-hypergraphs with a fixed diameter.
Discrete Mathematics 223(1-3): 287-297 (2000) |
| 1999 |
|---|
| 24 | EE | Ioan Tomescu:
Some Extremal Properties of the Degree Distance of a Graph.
Discrete Applied Mathematics 98(1-2): 159-163 (1999) |
| 1998 |
|---|
| 23 | | Ioan Tomescu:
A Threshold Property Concerning Words Containing All Short Factors.
Bulletin of the EATCS 64: (1998) |
| 22 | EE | Ioan Tomescu:
Chromatic Coefficients of Linear Uniform Hypergraphs.
J. Comb. Theory, Ser. B 72(2): 229-235 (1998) |
| 21 | EE | Ioan Tomescu:
On Words Containing all Short Subwords.
Theor. Comput. Sci. 197(1-2): 235-240 (1998) |
| 1997 |
|---|
| 20 | EE | Ioan Tomescu:
On the number of trees having k edges in common with a graph of bounded degrees.
Discrete Mathematics 169(1-3): 283-286 (1997) |
| 19 | EE | Ioan Tomescu:
Maximum chromatic polynomial of 3-chromatic blocks.
Discrete Mathematics 172(1-3): 131-139 (1997) |
| 18 | EE | Cristian Calude,
Ioan Tomescu:
Optimum Extendible Prefix Codes.
J. UCS 3(11): 1167-1179 (1997) |
| 17 | EE | Ioan Tomescu:
Optimum Huffman Forests.
J. UCS 3(7): 813-820 (1997) |
| 1996 |
|---|
| 16 | EE | Dragos Radu Popescu,
Ioan Tomescu:
Negative Cycles in Complete Signed Graphs.
Discrete Applied Mathematics 68(1-2): 145-152 (1996) |
| 15 | EE | Ioan Tomescu:
An asymptotic formula for the number of graphs having small diameter.
Discrete Mathematics 156(1-3): 219-228 (1996) |
| 14 | EE | Dragos Radu Popescu,
Ioan Tomescu:
Bonferroni Inequalities and Negative Cycles in Large Complete Signed Graphs.
Eur. J. Comb. 17(5): 479-483 (1996) |
| 13 | EE | Ioan Tomescu:
On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet.
Theor. Comput. Sci. 164(1&2): 277-285 (1996) |
| 1994 |
|---|
| 12 | EE | Ioan Tomescu,
Marius Zimand:
Minimum Spanning Hypertrees.
Discrete Applied Mathematics 54(1): 67-76 (1994) |
| 11 | | Ioan Tomescu:
On the Number of Subtrees for Almost All Graphs.
Random Struct. Algorithms 5(1): 205-214 (1994) |
| 1992 |
|---|
| 10 | EE | Ioan Tomescu:
Ordered h-hypertrees.
Discrete Mathematics 105(1-3): 241-248 (1992) |
| 1990 |
|---|
| 9 | EE | Ioan Tomescu:
Almost all digraphs have a kernel.
Discrete Mathematics 84(2): 181-192 (1990) |
| 1987 |
|---|
| 8 | EE | Ioan Tomescu:
Graphical Eulerian numbers and chromatic generating functions.
Discrete Mathematics 66(3): 315-318 (1987) |
| 1986 |
|---|
| 7 | | Ioan Tomescu:
On the number of paths and cycles for almost all graphs and digraphs.
Combinatorica 6(1): 73-79 (1986) |
| 6 | EE | Ioan Tomescu:
Hypertrees and Bonferroni inequalities.
J. Comb. Theory, Ser. B 41(2): 209-217 (1986) |
| 1984 |
|---|
| 5 | EE | Robert A. Melter,
Ioan Tomescu:
Metric bases in digital geometry.
Computer Vision, Graphics, and Image Processing 25(1): 113-121 (1984) |
| 1982 |
|---|
| 4 | EE | Frank Harary,
Robert A. Melter,
Uri N. Peled,
Ioan Tomescu:
Boolean distance for graphs.
Discrete Mathematics 39(2): 123-127 (1982) |
| 1981 |
|---|
| 3 | EE | Ioan Tomescu:
Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets.
Discrete Mathematics 37(2-3): 263-277 (1981) |
| 1980 |
|---|
| 2 | EE | Ioan Tomescu:
Some properties of irreducible coverings by cliques of complete multipartite graphs.
J. Comb. Theory, Ser. B 28(2): 127-141 (1980) |
| 1972 |
|---|
| 1 | | Ioan Tomescu:
A Method for Minimizing the Number of States for a Restricted Class of Incompletely Specified Sequential Machines.
Mathematical Systems Theory 6(1): 1-2 (1972) |
