The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Miklós Ruszinkó: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
    Vertex Covers by Edge Disjoint Cliques. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:171-197 [Journal]
  2. Paul Erdös, András Gyárfás, Miklós Ruszinkó
    How to decrease the diameter of triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:4, pp:493-501 [Journal]
  3. Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó
    On Randomly Generated Intersecting Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  4. Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
    Note on Sparse Random Graphs and Cover Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  5. Noga Alon, Miklós Ruszinkó
    Short Certificates for Tournaments. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal]
  6. Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
    A Note on Random Minimum Length Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  7. Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely
    Intersecting Systems. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:2, pp:127-137 [Journal]
  8. Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma
    G-Intersecting Families. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:5, pp:- [Journal]
  9. Zoltán Füredi, András Gyárfás, Miklós Ruszinkó
    On the maximum size of (p, Q)-free families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:385-403 [Journal]
  10. Alan Frieze, Ryan Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth
    Codes identifying sets of vertices in random networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:9-10, pp:1094-1107 [Journal]
  11. Aart Blokhuis, Ralph J. Faudree, András Gyárfás, Miklós Ruszinkó
    Anti-Ramsey Colorings in Several Rounds. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:1, pp:1-18 [Journal]
  12. Miklós Ruszinkó
    On the Upper Bound of the Size of the r-Cover-Free Families. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:66, n:2, pp:302-310 [Journal]
  13. András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
    An improved bound for the monochromatic cycle partition number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:855-873 [Journal]
  14. Zoltán Füredi, Miklós Ruszinkó
    An Improved Upper Bound of the Rate of Euclidean Superimposed Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:799-802 [Journal]
  15. András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
    Three-Color Ramsey Numbers For Paths. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:1, pp:35-69 [Journal]

  16. Three-color Ramsey numbers for paths. [Citation Graph (, )][DBLP]


  17. Large convex cones in hypercubes. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002