The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Louis V. Quintas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sung-Hyuk Cha, Michael L. Gargano, Louis V. Quintas, Eric M. Wahl
    A Vascular Network Growth Estimation Algorithm Using Random Graphs. [Citation Graph (0, 0)][DBLP]
    GbRPR, 2005, pp:45-53 [Conf]
  2. Louis V. Quintas, Jerzy Szymanski
    Digraphs Whose Nodes are Multigraphs Having Exactly Two Degrees f and 2. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:64, n:, pp:117-0 [Journal]
  3. Krystyna T. Balinska, Louis V. Quintas
    The sequential generation of random f-graphs. Line maximal 2-, 3- and 4-graphs. [Citation Graph (0, 0)][DBLP]
    Computers & Chemistry, 1990, v:14, n:4, pp:323-328 [Journal]
  4. Krystyna T. Balinska, Henryk Galina, Louis V. Quintas, Jerzy Szymanski
    A Kinetic Approach to the Random F-graph Process. Paths, Cycles and Components. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:67, n:1-3, pp:13-25 [Journal]
  5. Krystyna T. Balinska, Henryk Galina, Louis V. Quintas, Jerzy Szymanski
    A Kinetic Approach to the Random f-Graph Process with Nonuniform Edge Probabilities. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1996, v:36, n:3, pp:347-350 [Journal]
  6. Krystyna T. Balinska, Louis V. Quintas, Jerzy Szymanski
    Random Recursive Forests. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:1, pp:3-12 [Journal]
  7. Zbigniew Palka, Louis V. Quintas
    Random subgraphs of the n-cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:52, n:2-3, pp:243-251 [Journal]
  8. Krystyna T. Balinska, Louis V. Quintas
    The sequential generation of random f-graphs. distributions and predominant types of edge maximal f-graphs with f>;4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:19-22 [Journal]
  9. Krystyna T. Balinska, Louis V. Quintas
    Degrees in a digraph whose nodes are graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:17-29 [Journal]
  10. Gyula O. H. Katona, Louis V. Quintas
    The largest component in a random subgraph of the n-cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:113-116 [Journal]

  11. Extremal Size In Graphs With Bounded Degree. [Citation Graph (, )][DBLP]


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