2011.

Long rainbow cycles in proper edge-colorings of complete graphs

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Schelp, Richard
Date: 2011.
Published by: Australasian Journal of Combinatorics (Volume no.: 50, Page: 45-53)

2010.

Mapping of high performance data-flow graphs into programmable logic devices.

Authors: Nemes, Cs.; Nagy, Zoltán; Ruszinkó, Miklós; Kiss, András; Szolgay, Péter
Department: Cellular Sensory and Optical Wave Computing Laboratory
Date: 2010. 09. 05.
Published by: NOLTA 2010. International symposium on nonlinear theory and its applications. Krakow, 2010. (Page: 99-102.)

2008.

Large convex cones in hypercubes.

Authors: Füredi, Zoltán; Ruszinkó, Miklós
Date: 2008.
Published by: Discrete Applied Mathematics (Volume no.: 156, Issue no.: 9, Page: 1536-1541.)

Three-color Ramsey numbers for paths.

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemerédi , Endre
Date: 2008.
Published by: Combinatorica (Volume no.: 28, Issue no.: 4, Page: 499-502.)

2007.

Randomly generated intersecting hypergraphs II.

Authors: Bohman, Tom; Frieze, Alan; Martin, Ryan; Ruszinkó, Miklós; Smyth, Cliff
Date: 2007.
Published by: Random Structures and Algorithms (Volume no.: 30, Issue no.: 1-2, Page: 17-34.)

Three-color Ramsey numbers for paths.

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemerédi, Endre
Date: 2007.
Published by: Combinatorica (Volume no.: 27, Issue no.: 1, Page: 35-69.)

Collision channel with multiplicity feedback.

Authors: Laczay, Bálint; Ruszinkó, Miklós
Editor: Biglieri, Ezio
Date: 2007.
Published by: Multiple access channels. Theory and practice. (NATO security through science series, D. 10.) (Page: 250-270.)

Multiple access adder channel.

Authors: Danev, Danyo; Füredi, Zoltán; Ruszinkó, Miklós
Editor: Biglieri, Ezio
Date: 2007.
Published by: Multiple access channels. Theory and practice. (NATO security through science series, D. 10.) (Page: 26-53.)

Tripartite Ramsey numbers for paths.

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemerédi, Endre
Date: 2007.
Published by: Journal of Graph Theory (Volume no.: 55, Issue no.: 2, Page: 164-174.)

Multiple access Euclidean channel.

Authors: Danev, Danyo; Laczay, Bálint; Ruszinkó, Miklós
Editor: Biglieri, Ezio
Date: 2007.
Published by: Multiple access channels. Theory and practice. (NATO security through science series, D. 10.) (Page: 54-72.)

Codes identifying sets of vertices in random networks.

Authors: Frieze, Alan; Martin, Ryan; Moncel, Julien; Ruszinkó, Miklós; Smyth, Cliff
Date: 2007.
Published by: Discrete Mathematics (Volume no.: 307, Page: 1094-1107.)

2006.

An improved bound for the monochromatic cycle partition number

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemeredi, E
Date: 2006.
Published by: Journal of Combinatorial Theory Series B (Volume no.: 96, Issue no.: 6, Page: 855-873)
Download article: [pdf]

One-sided coverings of colored complete bipartite graphs

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemeredi, E
Editor: Klazar, M
Date: 2006.
Published by: Topics in discrete mathematics. Dedicated to Jarik Nešetril on the occasion of his 60th birthday. (Algorithms and combinatorics 26.) (Page: 133-154)

Turán Systems

Authors: Ruszinkó, Miklós
Editor: Colbourn, CJ
Date: 2006.
Published by: Handbook of combinatorial designs. 2nd ed. (Page: 649-651)

Multiple user tracing codes

Authors: Laczay, Bálint; Ruszinkó, Miklós
Date: 2006.
Published by: ISIT 2006. IEEE international symposium on information theory. Seattle, 2006. (Page: 1900-1904)

2005.

Single-user tracing and disjointly superimposed codes

Authors: Csűrös, M; Ruszinkó, M
Date: 2005.
Published by: IEEE TRANSACTIONS ON INFORMATION THEORY (Volume no.: 51, Issue no.: 4, Page: 1606-1611)

Identifying codes in random networks

Authors: Frieze, A; Martin, R; Moncel, J; Ruszinkó, M; Smyth, C
Date: 2005.
Published by: ISIT 2005. 2005 IEEE international symposium on information theory. Proceedings. Adelaide, 2005. (Page: 1464-1467)

2004.

Single user tracing superimposed codes

Authors: Csűrös, M; Ruszinkó, M
Date: 2004.
Published by: Information Theory. Proceedings of the International Symposium ISIT 2004 (Page: 253)

2003.

On randomly generated intersecting hypergraphs

Authors: Bohman, T; Cooper, C; Frieze, A; Martin, R; Ruszinkó, M
Date: 2003.
Published by: ELECTRONIC JOURNAL OF COMBINATORICS (Volume no.: 10, Issue no.: 1, Page: R29)

2002.

On the maximum size of (p,Q)-free families.

Authors: Füredi, Z; Gyárfás, A; Ruszinkó, M
Date: 2002.
Published by: DISCRETE MATHEMATICS (Volume no.: 257, Issue no.: 2-3, Page: 385-403)

2001.

Vertex covers by edge disjoint cliques.

Authors: Bohman, T; Frieze, A; Ruszinkó, M; Thoma, L
Date: 2001.
Published by: COMBINATORICA (Volume no.: 21, Issue no.: 2, Page: 171-197)

G-intersecting families

Authors: Bohman, T; Frieze, A; Ruszinkó, M; Thoma, L
Date: 2001.
Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 10, Page: 367-384)

Anti-Ramsey colorings in several rounds.

Authors: Blokhuis, A; Faudree, R; Gyárfás, A; Ruszinkó, M
Date: 2001.
Published by: JOURNAL OF COMBINATORIAL THEORY SERIES B (Volume no.: 82, Page: 1-18)

2000.

Decreasing the diameter of bounded degree graphs.

Authors: Alon, N; Gyárfás, A; Ruszinkó, M
Date: 2000.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 35, Issue no.: 3, Page: 161-172)

A note on sparse random graphs and cover graphs.

Authors: Bohman, T; Frieze, A; Ruszinkó, M; Thoma, L
Date: 2000.
Published by: ELECTRONIC JOURNAL OF COMBINATORICS (Volume no.: 7, Issue no.: R19, Page: 1-9)

A note on random minimum length spanning trees.

Authors: Frieze, A; Ruszinkó, M; Thoma, L
Date: 2000.
Published by: ELECTRONIC JOURNAL OF COMBINATORICS (Volume no.: 7, Issue no.: R41, Page: 1-5)

Shannon capacity of large odd cycles.

Authors: Bohman, T; Ruszinkó, M; Thoma, L
Date: 2000.
Published by: 2000 IEEE international symposium on information theory. Proceedings. Sorrento, 2000. (Page: 179)

1999.

An improved upper bound of the rate of Eucledian superimposed codes.

Authors: Füredi, Z; Ruszinkó, M
Date: 1999.
Published by: IEEE TRANSACTIONS ON INFORMATION THEORY (Volume no.: 45, Issue no.: 2, Page: 799-8í2)

1998.

An improved upper bound the rate of Euclidean superimposed codes.

Authors: Füredi, Z; Ruszinkó, M
Date: 1998.
Published by: 1998 IEEE international symposium on information theory. Proceedings. Cambridge, 1998. (Page: 467)

How to decrease the diameter of triangle-free graphs.

Authors: Erdős, P; Gyárfás, A; Ruszinkó, M
Date: 1998.
Published by: COMBINATORICA (Volume no.: 18, Issue no.: 4, Page: 493-501)

1997.

Short certificates for tournaments.

Authors: Alon, N; Ruszinkó, M
Date: 1997.
Published by: ELECTRONIC JOURNAL OF COMBINATORICS (Volume no.: 4, Issue no.: R12, Page: 1-6)

Intersecting systems.

Authors: Ahlswede, R; Alon, N; Erdős, PL; Ruszinkó, M; Székely, L
Date: 1997.
Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 6, Issue no.: 2, Page: 127-137)

Superimposed codes are almost big distance ones.

Authors: Füredi, Z; Ruszinkó, M
Date: 1997.
Published by: 1997 IEEE international symposium on information theory. Proceedings. Ulm, 1997. (Page: 118)

On a search problem in multidimensional grids.

Authors: Ruszinkó, M; Tardos, G
Date: 1997.
Published by: JOURNAL OF STATISTICAL PLANNING AND INFERENCE (Volume no.: 59, Issue no.: 1, Page: 101-109)

Prediction of retention data when using incremental multiple development techniques.

Authors: Szabady, B; Ruszinkó, M; Nyiredy, SZ
Date: 1997.
Published by: CHROMATOGRAPHIA (Volume no.: 45, Page: 369-372)

How an Erdős-Rényi-type search approach gives explicit code construction of rate 1 for random access with multiplicity feedback.

Authors: Ruszinkó, M; Vanroose, P
Date: 1997.
Published by: IEEE TRANSACTIONS ON INFORMATION THEORY (Volume no.: 43, Issue no.: 1, Page: 368-373)

Application of multiple development.

Authors: Szabady, B; Ruszinkó, M; Nyiredy, SZ
Date: 1997.
Published by: Proceedings of the 9th international symposium on instrumental planar chromatography. Interlaken, 1997. (Page: 337-339)

1995.

On the equivalence of some different definitions of capacity of the multiple-access collision channel with multiplicity feedback

Authors: Ruszinkó, M
Date: 1995.
Published by: Proceedings. 1995 IEEE international symposium on information theory. Whistler, 1995 (Page: 76)

Prediction of retention data in multiple development. Part 1. Linearly increasing development distances

Authors: Szabady, B; Ruszinkó, M; Nyiredy, SZ
Date: 1995.
Published by: JPC-JOURNAL OF PLANAR CHROMATOGRAPHY-MODERN TLC (Volume no.: 8, Issue no.: 4, Page: 279-283)

1994.

A constructive code reaching capacity 1 for the multiple-access collision channel with multiplicity feedback

Authors: Ruszinkó, M; Vanroose, P
Date: 1994.
Published by: Proceedings of the IEEE international symposium on information theory. Trondheim, 1994 (Page: 287)

On the upper bound of the size of the r-cover-free families

Authors: Ruszinkó, M
Date: 1994.
Published by: JOURNAL OF COMBINATORIAL THEORY SERIES A (Volume no.: 66, Issue no.: 2, Page: 302-310)

1993.

On a 2- and 3-dimensional search problem

Authors: Ruszinkó, M
Date: 1993.
Published by: Proceedings of the sixth joint Swedish-Russian workshop on information theory. Mölle, 1993 (Page: 437-440)

On a 2-dimensional search problem

Authors: Ruszinkó, M
Date: 1993.
Published by: JOURNAL OF STATISTICAL PLANNING AND INFERENCE (Volume no.: 37, Issue no.: 3, Page: 371-383)

1991.

Coding methods for asynchronous multiple access communication channels without feedback

Authors: Ruszinkó, Miklós
Date: 1991.
Published by: Proceedings of the IEEE International Symposium on Information Theory (Volume no.: 1991, Page: 341)