2009 | ||
---|---|---|
51 | EE | Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan: The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Combinatorics, Probability & Computing 18(1-2): 165-203 (2009) |
2008 | ||
50 | EE | Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski: Universality of random graphs. SODA 2008: 782-788 |
49 | EE | Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski: An approximate Dirac-type theorem for k -uniform hypergraphs. Combinatorica 28(2): 229-260 (2008) |
48 | EE | Izolda Gorgol, Andrzej Rucinski: Planar Ramsey numbers for cycles. Discrete Mathematics 308(19): 4389-4395 (2008) |
2007 | ||
47 | EE | Vojtech Rödl, Andrzej Rucinski, Mathias Schacht: Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. SIAM J. Discrete Math. 21(2): 442-460 (2007) |
2006 | ||
46 | EE | Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi: A Dirac-Type Theorem for 3-Uniform Hypergraphs. Combinatorics, Probability & Computing 15(1-2): 229-251 (2006) |
45 | EE | Catherine S. Greenhill, Andrzej Rucinski: Neighbour-Distinguishing Edge Colourings of Random Regular Graphs. Electr. J. Comb. 13(1): (2006) |
44 | EE | Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi: Perfect matchings in uniform hypergraphs with large minimum degree. Eur. J. Comb. 27(8): 1333-1349 (2006) |
43 | EE | Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan: The Ramsey number for hypergraph cycles I. J. Comb. Theory, Ser. A 113(1): 67-83 (2006) |
42 | EE | Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi: Short paths in quasi-random triple systems with sparse underlying graphs. J. Comb. Theory, Ser. B 96(4): 584-607 (2006) |
2005 | ||
41 | EE | Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl: The Generalization of Dirac's Theorem for Hypergraphs. MFCS 2005: 52-56 |
2004 | ||
40 | EE | Andrzej Rucinski, Artur Skrygulec, Khrystyna Pysareva, Jakub Mocny: Microsystem Development Using the TQM Design Methodology. DELTA 2004: 225-230 |
39 | EE | Svante Janson, Andrzej Rucinski: The Deletion Method For Upper Tail Estimates. Combinatorica 24(4): 615-640 (2004) |
38 | EE | Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald: Random Hypergraph Processes with Degree Restrictions. Graphs and Combinatorics 20(3): 319-332 (2004) |
2003 | ||
37 | EE | Andrzej Rucinski, Barrett Stetson, S. T. P. Brundavani: A DOT1 & DOT4 MOSIS - Compatible Library. MSE 2003: 83-84 |
36 | Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald: Connectedness Of The Degree Bounded Star Process. Combinatorics, Probability & Computing 12(3): (2003) | |
35 | Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali: Ramsey Games Against a One-Armed Bandit. Combinatorics, Probability & Computing 12(5-6): 515-545 (2003) | |
2002 | ||
34 | EE | Andrzej Rucinski, Barbara Dziurla-Rucinska: Boundary Scan as a Test Solution in Microelectronics Curricula. DELTA 2002: 214-218 |
33 | EE | Yuejian Peng, Vojtech Rödl, Andrzej Rucinski: Holes in Graphs. Electr. J. Comb. 9(1): (2002) |
32 | EE | Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski: Vertex Ramsey Properties of Families of Graphs. J. Comb. Theory, Ser. B 84(2): 240-248 (2002) |
31 | EE | Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski: Ramsey Properties of Families of Graphs. J. Comb. Theory, Ser. B 86(2): 413-419 (2002) |
30 | EE | Svante Janson, Andrzej Rucinski: The infamous upper tail. Random Struct. Algorithms 20(3): 317-342 (2002) |
2001 | ||
29 | EE | Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi: Near-optimum Universal Graphs for Graphs with Bounded Degrees. RANDOM-APPROX 2001: 170-180 |
28 | EE | Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski: On Bipartite Graphs with Linear Ramsey Numbers. Combinatorica 21(2): 199-209 (2001) |
27 | EE | Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski: On minimal Folkman graphs. Discrete Mathematics 236(1-3): 245-262 (2001) |
26 | EE | Vojtech Rödl, Andrzej Rucinski, Michelle Wagner: Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma. SIAM J. Comput. 31(2): 428-446 (2001) |
2000 | ||
25 | Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi: Universality and Tolerance. FOCS 2000: 14-21 | |
24 | EE | Justyna Kurkowiak, Andrzej Rucinski: Solitary subgraphs of random graphs. Discrete Mathematics 213(1-3): 195-209 (2000) |
1999 | ||
23 | EE | Pawel Nowakowski, Barbara Dziurla-Rucinska, Andrzej Rucinski: VLSI Design and Test Sequence in an Academic Environment: A Case Study. MSE 1999: 22-23 |
22 | EE | Vojtech Rödl, Andrzej Rucinski: Perfect Matchings in <epsilon>-Regular Graphs and the Blow-Up Lemma. Combinatorica 19(3): 437-452 (1999) |
21 | Vojtech Rödl, Andrzej Rucinski, Anusch Taraz: Hypergraph Packing And Graph Embedding. Combinatorics, Probability & Computing 8(4): (1999) | |
1998 | ||
20 | EE | Vojtech Rödl, Andrzej Rucinski, Michelle Wagner: An Algorithmic Embedding of Graphs via Perfect Matchings. RANDOM 1998: 25-34 |
19 | Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski: Endomorphisms of Partially Ordered Sets. Combinatorics, Probability & Computing 7(1): 33-46 (1998) | |
18 | EE | Noga Alon, Vojtech Rödl, Andrzej Rucinski: Perfect Matchings in $\epsilon$-regular Graphs. Electr. J. Comb. 5: (1998) |
17 | EE | Vojtech Rödl, Andrzej Rucinski: Ramsey Properties of Random Hypergraphs. J. Comb. Theory, Ser. A 81(1): 1-33 (1998) |
1997 | ||
16 | Vojtech Rödl, Andrzej Rucinski: Bipartite Coverings of Graphs. Combinatorics, Probability & Computing 6(3): 349-352 (1997) | |
15 | EE | Andrzej Rucinski, Miroslaw Truszczynski: A note on local colorings of graphs. Discrete Mathematics 164(1-3): 251-255 (1997) |
1996 | ||
14 | EE | Tomasz Luczak, Andrzej Rucinski, Jacek Gruszka: On the evolution of a random tournament. Discrete Mathematics 148(1-3): 311-316 (1996) |
1994 | ||
13 | Vojtech Rödl, Andrzej Rucinski: Random Graphs with Monochromatic Triangles in Every Edge Coloring. Random Struct. Algorithms 5(2): 253-270 (1994) | |
1992 | ||
12 | Andrzej Rucinski, Nicholas C. Wormald: Random Graph Processes with Degree Restrictions. Combinatorics, Probability & Computing 1: 169-180 (1992) | |
11 | EE | Andrzej Rucinski: Matching and covering the vertices of a random graph by copies of a given graph. Discrete Mathematics 105(1-3): 185-197 (1992) |
10 | EE | Tomasz Luczak, Andrzej Rucinski, Bernd Voigt: Ramsey properties of random graphs. J. Comb. Theory, Ser. B 56(1): 55-68 (1992) |
1991 | ||
9 | EE | Nicholas Ilyadis, Peter Drexel, Andrzej Rucinski: The simulation of the non-linear dynamic behavior of distributed routing networks using DECSIM. Winter Simulation Conference 1991: 705-715 |
8 | Tomasz Luczak, Andrzej Rucinski: Tree-Matchings in Graph Processes. SIAM J. Discrete Math. 4(1): 107-120 (1991) | |
1990 | ||
7 | EE | Andrzej Rucinski, Frank Hludik, John L. Pokoski: A partnership in domestication of rapid prototyping technologies. SIGCSE 1990: 1-5 |
6 | Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski: Small Cliques in Random Graphs. Random Struct. Algorithms 1(4): 403-434 (1990) | |
1989 | ||
5 | EE | Andrew D. Barbour, Michal Karonski, Andrzej Rucinski: A central limit theorem for decomposable random variables with applications to random graphs. J. Comb. Theory, Ser. B 47(2): 125-145 (1989) |
1988 | ||
4 | Andrzej Rucinski, Andrew Vince: Balanced extensions of graphs and hypergraphs. Combinatorica 8(3): 279-291 (1988) | |
1986 | ||
3 | Andrzej Rucinski, John L. Pokoski: Polystructural, Reconfigurable, and Fault-Tolerant Computers. ICDCS 1986: 175-182 | |
2 | EE | Zbigniew Palka, Andrzej Rucinski, Joel Spencer: On a method for random graphs. Discrete Mathematics 61(2-3): 253-258 (1986) |
1984 | ||
1 | EE | Andrzej Rucinski: The behaviour of (k, ..., kn, n-ik)ci/i! is asymptotically normal. Discrete Mathematics 49(3): 287-290 (1984) |