Follow
Miklos Ruszinko
Title
Cited by
Cited by
Year
Breathing as a fundamental rhythm of brain function
DH Heck, SS McAfee, Y Liu, A Babajani-Feremi, R Rezaie, WJ Freeman, ...
Frontiers in neural circuits 10, 115, 2017
2222017
On the upper bound of the size of the r-cover-free families
M Ruszinkó
Journal of Combinatorial Theory, Series A 66 (2), 302-310, 1994
2181994
Three-color Ramsey numbers for paths
A Gyárfás, M Ruszinkó*, GN Sárközy, E Szemerédi
Combinatorica 27 (1), 35-69, 2007
1232007
An improved bound for the monochromatic cycle partition number
A Gyárfás, M Ruszinkó, GN Sárközy, E Szemerédi
Journal of Combinatorial Theory, Series B 96 (6), 855-873, 2006
922006
Codes identifying sets of vertices in random networks
A Frieze, R Martin, J Moncel, M Ruszinkó, C Smyth
Discrete Mathematics 307 (9-10), 1094-1107, 2007
582007
Decreasing the diameter of bounded degree graphs
N Alon, A Gyárfás, M Ruszinkó
Journal of Graph Theory 35 (3), 161-172, 2000
522000
Partitioning -Colored Complete Graphs into Three Monochromatic Cycles
A Gyárfás, M Ruszinkó, GN Sárközy, E Szemerédi
the electronic journal of combinatorics 18 (1), P53, 2011
482011
Tripartite Ramsey numbers for paths
A Gyarfas, M Ruszinko, GN Sárközy, E Szemeredi
Journal of Graph Theory 55 (2), 164-174, 2007
342007
Cortical rhythms are modulated by respiration
DH Heck, SS McAfee, Y Liu, A Babajani-Feremi, R Rezaie, WJ Freeman, ...
biorxiv, 049007, 2016
332016
Uniform hypergraphs containing no grids
Z Füredi, M Ruszinkó
Advances in Mathematics 240, 302-324, 2013
332013
A note on random minimum length spanning trees
A Frieze, M Ruszinkó, L Thoma
the electronic journal of combinatorics 7 (1), R41, 2000
322000
How to decrease the diameter of triangle-free graphs
P Erdős, A Gyárfás, M Ruszinkó
Combinatorica 18 (4), 493-501, 1998
291998
How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback
M Ruszinkó, P Vanroose
IEEE Transactions on Information Theory 43 (1), 368-373, 1997
251997
Single-user tracing and disjointly superimposed codes
M Csros, M Ruszinkó
IEEE transactions on information theory 51 (4), 1606-1611, 2005
242005
An improved upper bound of the rate of Euclidean superimposed codes
Z Furedi, M Ruszinkó
IEEE Transactions on Information Theory 45 (2), 799-802, 1999
231999
Long rainbow cycles in proper edge-colorings of complete graphs
A Gyárfás, M Ruszinkó, G Sárközy, RH Schelp
Australasian Journal of Combinatorics 50, 45-53, 2011
212011
One-sided coverings of colored complete bipartite graphs
A Gyárfás, M Ruszinkó, GN Sárközy, E Szemerédi
Topics in Discrete Mathematics: Dedicated to Jarik Nešetřil on the Occasion …, 2006
212006
Soldering profile optimization for vapour phase reflow technology
A Geczy, P Szőke, Z Illyefalvi-Vitez, M Ruszinko, R Bunea
2011 IEEE 17th International Symposium for Design and Technology in …, 2011
202011
Bootstrap percolation on a random graph coupled with a lattice
S Janson, R Kozma, M Ruszinkó, Y Sokolov
Electronic Journal of Combinatorics, 2016
172016
Virtual laboratory support for microelectronics packaging education
Z Illyefalvi-Vitéz, P Nemeth, J Pinkola, G Ripka, M Ruszinko
1999 Proceedings. 49th Electronic Components and Technology Conference (Cat …, 1999
151999
The system can't perform the operation now. Try again later.
Articles 1–20