Author Info
Name
Affiliation
Papers
M. RUSZINKÓ
Computer and Automation Research Institute of the Hungarian Academy of Sciences, Budapest, P.O. Box 63, 1518 Hungary (e-mail: ruszinko@lutra.sztaki.hu)
22
Collaborators
Citations 
PageRank 
33
230
35.16
Referers 
Referees 
References 
313
142
92
Search Limit
100313
Title
Citations
PageRank
Year
Large monochromatic components of small diameter00.342022
A modified bootstrap percolation on a random graph coupled with a lattice.00.342019
Modeling Learning And Strategy Formation As Phase Transitions In Cortical Networks00.342016
Accelerating unstructured finite volume computations on field-programmable gate arrays10.362014
Large components in r-edge-colorings of Kn have diameter at most five20.442012
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles.120.852011
Three-Color Ramsey Numbers For Paths3418.192008
Large convex cones in hypercubes00.342008
Tripartite Ramsey numbers for paths130.962007
Randomly generated intersecting hypergraphs II40.772007
Codes identifying sets of vertices in random networks251.202007
An improved bound for the monochromatic cycle partition number362.242006
On Randomly Generated Intersecting Hypergraphs30.822003
Vertex Covers By Edge Disjoint Cliques00.342001
Anti-Ramsey colorings in several rounds40.562001
Decreasing the diameter of bounded degree graphs201.472000
Note on Sparse Random Graphs and Cover Graphs30.412000
A Note on Random Minimum Length Spanning Trees80.612000
How to decrease the diameter of triangle-free graphs141.251998
Intersecting Systems00.341997
Short Certificates for Tournaments50.651997
On the upper bound of the size of the r-cover-free families462.351994