The SCEAS System
Navigation Menu

Journals in DBLP

Random Struct. Algorithms
2005, volume: 26, number: 3

  1. Benny Sudakov
    Large Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:3, pp:253-265 [Journal]
  2. Martin Dietzfelbinger, Hisao Tamaki
    On the probability of rendezvous in graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:3, pp:266-288 [Journal]
  3. Eldar Fischer
    Testing graphs for colorability properties. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:3, pp:289-309 [Journal]
  4. Paul N. Balister, Béla Bollobás, Anthony Quas
    Percolation in Voronoi tilings. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:3, pp:310-318 [Journal]
  5. Alan M. Frieze
    Perfect matchings in random bipartite graphs with minimal degree at least 2. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:3, pp:319-358 [Journal]
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