The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Juhani Nieminen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Juhani Nieminen
    A note on finding all maximum cuts in a graph. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1974, v:10, n:4, pp:215-217 [Journal]
  2. Juhani Nieminen
    Realizing the distance matrix of a graph. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1976, v:12, n:1/2, pp:29-31 [Journal]
  3. Juhani Nieminen
    On Homomorphic Images of Transition Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:1, pp:14-15 [Journal]
  4. Juhani Nieminen
    Some Observations on the Determination of an Upper Bound for the Clique Number of a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:1, pp:16-17 [Journal]
  5. Juhani Nieminen, Matti Peltola
    The subtree center of a tree. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:4, pp:272-278 [Journal]
  6. Juhani Nieminen
    A New Method of Formulating a Minimum Edge Set. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1975, v:24, n:10, pp:1015-1018 [Journal]
  7. Juhani Nieminen
    Neutrality and betweenness in modular lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:3, pp:329-332 [Journal]
  8. Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel
    Domination alteration sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:153-161 [Journal]

Search in 0.100secs, Finished in 0.101secs
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