The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ioan Tomescu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  37. On the partition dimension and connected partition dimension of wheels. [Citation Graph (, )][DBLP]


  38. Series-parallel chromatic hypergraphs. [Citation Graph (, )][DBLP]


  39. Ordering connected graphs having small degree distances. [Citation Graph (, )][DBLP]


  40. Discrepancies between metric dimension and partition dimension of a connected graph. [Citation Graph (, )][DBLP]


  41. Properties of connected graphs having minimum degree distance. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002