dblp.uni-trier.dewww.uni-trier.de

Vojtech Rödl

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
179EEBrendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht: Hypergraph regularity and quasi-randomness. SODA 2009: 227-235
178EEPenny 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
177EEAndrzej Dudek, Vojtech Rödl: New Upper Bound on Vertex Folkman Numbers. LATIN 2008: 473-478
176EEDomingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski: Universality of random graphs. SODA 2008: 782-788
175EEVojtech Rödl, Endre Szemerédi, Andrzej Rucinski: An approximate Dirac-type theorem for k -uniform hypergraphs. Combinatorica 28(2): 229-260 (2008)
174EEBrendan Nagle, Vojtech Rödl, Mathias Schacht: Note on the 3-graph counting lemma. Discrete Mathematics 308(19): 4501-4517 (2008)
173EEAndrzej Dudek, Vojtech Rödl: Finding Folkman Numbers via MAX CUT Problem. Electronic Notes in Discrete Mathematics 30: 99-104 (2008)
172EEChristian Avart, Péter Komjáth, Tomasz Luczak, Vojtech Rödl: Colorful Flowers. Electronic Notes in Discrete Mathematics 31: 255-258 (2008)
171EEVojtech Rödl, Jan Zich: Triangulations and the Hajós conjecture. Journal of Graph Theory 59(4): 293-325 (2008)
170EEPenny E. Haxell, Brendan Nagle, Vojtech Rödl: An Algorithmic Version of the Hypergraph Regularity Method. SIAM J. Comput. 37(6): 1728-1776 (2008)
169EEVojtech Rödl, Mark H. Siggers: On Ramsey Minimal Graphs. SIAM J. Discrete Math. 22(2): 467-488 (2008)
2007
168EENoga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht: Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ICALP 2007: 789-800
167EEVojtech Rödl, Mathias Schacht: Property testing in hypergraphs and the removal lemma. STOC 2007: 488-495
166EEVojtech Rödl, Mathias Schacht: Regular Partitions of Hypergraphs: Regularity Lemmas. Combinatorics, Probability & Computing 16(6): 833-885 (2007)
165EEVojtech Rödl, Mathias Schacht: Regular Partitions of Hypergraphs: Counting Lemmas. Combinatorics, Probability & Computing 16(6): 887-901 (2007)
164EEYoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa Sissokho, Jozef Skokan: Turán's theorem for pseudo-random graphs. J. Comb. Theory, Ser. A 114(4): 631-657 (2007)
163EEDhruv Mubayi, Vojtech Rödl: On the chromatic number and independence number of hypergraph products. J. Comb. Theory, Ser. B 97(1): 151-155 (2007)
162EEStefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger: Small subsets inherit sparse epsilon-regularity. J. Comb. Theory, Ser. B 97(1): 34-56 (2007)
161EEPeter Frankl, Yuejian Peng, Vojtech Rödl, John M. Talbot: A note on the jumping constant conjecture of Erdös. J. Comb. Theory, Ser. B 97(2): 204-216 (2007)
160EEVojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige: Integer and fractional packings of hypergraphs. J. Comb. Theory, Ser. B 97(2): 245-268 (2007)
159EEChristian Avart, Vojtech Rödl, Mathias Schacht: Every Monotone 3-Graph Property is Testable. SIAM J. Discrete Math. 21(1): 73-92 (2007)
158EEVojtech 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
157EEDhruv Mubayi, Vojtech Rödl: Supersaturation For Ramsey-Turán Problems. Combinatorica 26(3): 315-332 (2006)
156EENoga Alon, Yoshiharu Kohayakawa, Christian Mauduit, C. G. Moreira, Vojtech Rödl: Measures of Pseudorandomness for Finite Sequences: Minimal Values. Combinatorics, Probability & Computing 15(1-2): 1-29 (2006)
155EEVojtech Rödl, Andrzej Rucinski, Endre Szemerédi: A Dirac-Type Theorem for 3-Uniform Hypergraphs. Combinatorics, Probability & Computing 15(1-2): 229-251 (2006)
154EEVojtech Rödl, Andrzej Rucinski, Endre Szemerédi: Perfect matchings in uniform hypergraphs with large minimum degree. Eur. J. Comb. 27(8): 1333-1349 (2006)
153EEPenny 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)
152EEVojtech Rödl, E. Tengan: A note on a conjecture by Füredi. J. Comb. Theory, Ser. A 113(6): 1214-1218 (2006)
151EEAlexandr V. Kostochka, Vojtech Rödl: On Ramsey numbers of uniform hypergraphs with given maximum degree. J. Comb. Theory, Ser. A 113(7): 1555-1564 (2006)
150EEJoanna 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)
149EEVojtech Rödl, Mark H. Siggers: Color critical hypergraphs with many edges. Journal of Graph Theory 53(1): 56-74 (2006)
148EEBrendan Nagle, Vojtech Rödl, Mathias Schacht: The counting lemma for regular k-uniform hypergraphs. Random Struct. Algorithms 28(2): 113-179 (2006)
147EEVojtech Rödl, Jozef Skokan: Applications of the regularity lemma for uniform hypergraphs. Random Struct. Algorithms 28(2): 180-194 (2006)
2005
146EEPenny E. Haxell, Brendan Nagle, Vojtech Rödl: An Algorithmic Version of the Hypergraph Regularity Method. FOCS 2005: 439-448
145EEEndre Szemerédi, Andrzej Rucinski, Vojtech Rödl: The Generalization of Dirac's Theorem for Hypergraphs. MFCS 2005: 52-56
144EENoga Alon, Vojtech Rödl: Sharp Bounds For Some Multicolor Ramsey Numbers. Combinatorica 25(2): 125-141 (2005)
143EEMike Ferrara, Yoshiharu Kohayakawa, Vojtech Rödl: Distance Graphs on the Integers. Combinatorics, Probability & Computing 14(1-2): 107-131 (2005)
142EEYuejian Peng, Vojtech Rödl, Jozef Skokan: Counting Small Cliques in 3-uniform Hypergraphs. Combinatorics, Probability & Computing 14(3): 371-413 (2005)
141EEVojtech Rödl, Lubos Thoma: On Cover Graphs and Dependent Arcs in Acyclic Orientations. Combinatorics, Probability & Computing 14(4): 585-617 (2005)
140EEChristian Avart, Vojtech Rödl, Mathias Schacht: Every Monotone 3-Graph Property is Testable. Electronic Notes in Discrete Mathematics 22: 539-542 (2005)
139EEVojtech Rödl, Jozef Skokan: Counting subgraphs in quasi-random 4-uniform hypergraphs. Random Struct. Algorithms 26(1-2): 160-203 (2005)
2004
138EEAlexandr V. Kostochka, Vojtech Rödl: On Graphs With Small Ramsey Numbers, II. Combinatorica 24(3): 389-401 (2004)
137 Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht: The Turán Theorem for Random Graphs. Combinatorics, Probability & Computing 13(1): 61-91 (2004)
136EEDhruv Mubayi, Vojtech Rödl: Uniform Edge Distribution in Hypergraphs is Hereditary. Electr. J. Comb. 11(1): (2004)
135EEVojtech Rödl, Jozef Skokan: Regularity Lemma for k-uniform hypergraphs. Random Struct. Algorithms 25(1): 1-42 (2004)
2003
134 Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl: Hereditary Properties Of Triple Systems. Combinatorics, Probability & Computing 12(2): (2003)
133 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)
132EEVojtech Rödl: On homogeneous sets of positive integers. J. Comb. Theory, Ser. A 102(1): 229-240 (2003)
131EEDavid S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtech Rödl: Independent Deuber sets in graphs on the natural numbers. J. Comb. Theory, Ser. A 103(2): 305-322 (2003)
130EEPenny E. Haxell, Brendan Nagle, Vojtech Rödl: Integer and fractional packings in dense 3-uniform hypergraphs. Random Struct. Algorithms 22(3): 248-310 (2003)
129EEYoshiharu Kohayakawa, Vojtech Rödl: Regular pairs in sparse random graphs I. Random Struct. Algorithms 22(4): 359-434 (2003)
128EEBrendan Nagle, Vojtech Rödl: Regularity properties for triple systems. Random Struct. Algorithms 23(3): 264-332 (2003)
127EERichard A. Duke, Paul Erdös, Vojtech Rödl: On large intersecting subfamilies of uniform setfamilies. Random Struct. Algorithms 23(4): 351-356 (2003)
126EEYoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma: An Optimal Algorithm for Checking Regularity. SIAM J. Comput. 32(5): 1210-1235 (2003)
2002
125EEYoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl: Efficient Testing of Hypergraphs. ICALP 2002: 1017-1028
124EEYoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma: An optimal algorithm for checking regularity (extended abstract). SODA 2002: 277-286
123EEYuejian Peng, Vojtech Rödl, Andrzej Rucinski: Holes in Graphs. Electr. J. Comb. 9(1): (2002)
122EEDhruv Mubayi, Vojtech Rödl: On the Turán Number of Triple Systems. J. Comb. Theory, Ser. A 100(1): 136-152 (2002)
121EEYoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan: Hypergraphs, Quasi-randomness, and Conditions for Regularity. J. Comb. Theory, Ser. A 97(2): 307-352 (2002)
120EERonald 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)
119 Peter Frankl, Vojtech Rödl: Extremal problems on set systems. Random Struct. Algorithms 20(2): 131-164 (2002)
118EEY. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl: On characterizing hypergraph regularity. Random Struct. Algorithms 21(3-4): 293-335 (2002)
2001
117EENoga 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
116EEPenny E. Haxell, Vojtech Rödl: Integer and Fractional Packings in Dense Graphs. Combinatorica 21(1): 13-38 (2001)
115EERonald L. Graham, Vojtech Rödl, Andrzej Rucinski: On Bipartite Graphs with Linear Ramsey Numbers. Combinatorica 21(2): 199-209 (2001)
114EEBrendan Nagle, Vojtech Rödl: The asymptotic number of triple systems not containing a fixed one. Discrete Mathematics 235(1-3): 271-290 (2001)
113EEDavid S. Gunderson, Imre Leader, Hans Jürgen Prömel, Vojtech Rödl: Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers. J. Comb. Theory, Ser. A 93(1): 1-17 (2001)
112 Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali: On the chromatic number of set systems. Random Struct. Algorithms 19(2): 87-98 (2001)
111EEVojtech 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
110 Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi: Universality and Tolerance. FOCS 2000: 14-21
109 Yoshiharu Kohayakawa, Vojtech Rödl: Algorithmic Aspects of Regularity. LATIN 2000: 1-17
108 Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan: Equivalent Conditions for Regularity (Extended Abstract). LATIN 2000: 48-57
107EEVojtech Rödl, Endre Szemerédi: On Size Ramsey Numbers of Graphs with Bounded Degree. Combinatorica 20(2): 257-262 (2000)
106EEAndrzej Czygrinow, Vojtech Rödl: An Algorithmic Regularity Lemma for Hypergraphs. SIAM J. Comput. 30(4): 1041-1066 (2000)
1999
105EEVojtech Rödl, Andrzej Rucinski: Perfect Matchings in <epsilon>-Regular Graphs and the Blow-Up Lemma. Combinatorica 19(3): 437-452 (1999)
104 Vojtech Rödl, Andrzej Rucinski, Anusch Taraz: Hypergraph Packing And Graph Embedding. Combinatorics, Probability & Computing 8(4): (1999)
103EEDavid S. Gunderson, Vojtech Rödl, Alexander Sidorenko: Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs. J. Comb. Theory, Ser. A 88(2): 342-367 (1999)
102EEHans Jürgen Prömel, Vojtech Rödl: Non-Ramsey Graphs Are c log n-Universal. J. Comb. Theory, Ser. A 88(2): 379-384 (1999)
101EEAndrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl: Constructive Quasi-Ramsey Numbers and Tournament Ranking. SIAM J. Discrete Math. 12(1): 48-63 (1999)
1998
100EEVojtech Rödl, Andrzej Rucinski, Michelle Wagner: An Algorithmic Embedding of Graphs via Perfect Matchings. RANDOM 1998: 25-34
99EEAlexandr V. Kostochka, Vojtech Rödl: On Large Systems of Sets with No Large Weak <Delta>-subsystems. Combinatorica 18(2): 235-240 (1998)
98EEYoshiharu Kohayakawa, Hans Jürgen Prömel, Vojtech Rödl: Induced Ramsey Numbers. Combinatorica 18(3): 373-404 (1998)
97 Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski: Endomorphisms of Partially Ordered Sets. Combinatorics, Probability & Computing 7(1): 33-46 (1998)
96 David S. Gunderson, Vojtech Rödl: Extremal Problems for Affine Cubes of Integers. Combinatorics, Probability & Computing 7(1): 65-79 (1998)
95 Tomasz Luczak, Vojtech Rödl, Endre Szemerédi: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. Combinatorics, Probability & Computing 7(4): 423-436 (1998)
94EETomasz Luczak, Vojtech Rödl, Tomasz Schoen: Independent finite sums in graphs defined on the natural numbers. Discrete Mathematics 181(1-3): 289-294 (1998)
93EENoga Alon, Vojtech Rödl, Andrzej Rucinski: Perfect Matchings in $\epsilon$-regular Graphs. Electr. J. Comb. 5: (1998)
92EEVojtech Rödl, Andrzej Rucinski: Ramsey Properties of Random Hypergraphs. J. Comb. Theory, Ser. A 81(1): 1-33 (1998)
91 Alexandr V. Kostochka, Vojtech Rödl: Partial Steiner systems and matchings in hypergraphs. Random Struct. Algorithms 13(3-4): 335-347 (1998)
1997
90 Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl: On K4-Free Subgraphs of Random Graphs. Combinatorica 17(2): 173-213 (1997)
89 Vojtech Rödl, Andrzej Rucinski: Bipartite Coverings of Graphs. Combinatorics, Probability & Computing 6(3): 349-352 (1997)
88EENorbert Sauer, Robert E. Woodrow, Vojtech Rödl: Chromatic Ramsey Theory. Eur. J. Comb. 18(1): 93-102 (1997)
87EEVojtech Rödl, Lubos Thoma: On the Size of Set Systems on [n] Not Containing Weak (r, Delta)-Systems. J. Comb. Theory, Ser. A 80(1): 166-173 (1997)
86 Pavel Pudlák, Vojtech Rödl, Jiri Sgall: Boolean Circuits, Tensor Ranks, and Communication Complexity. SIAM J. Comput. 26(3): 605-633 (1997)
1996
85 Nancy Eaton, Vojtech Rödl: Graphs of Small Dimensions. Combinatorica 16(1): 59-85 (1996)
84EEHal A. Kierstead, Vojtech Rödl: Applications of hypergraph coloring to coloring graphs not inducing certain trees. Discrete Mathematics 150(1-3): 187-193 (1996)
83EEHanno Lefmann, Vojtech Rödl, Beata Wysocka: Multicolored Subsets in Colored Hypergraphs. J. Comb. Theory, Ser. A 74(2): 209-248 (1996)
82EETomasz Luczak, Vojtech Rödl: On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree. J. Comb. Theory, Ser. B 66(2): 324-333 (1996)
81 Vojtech Rödl, Lubos Thoma: Asymptotic packing and the random greedy algorithm. Random Struct. Algorithms 8(3): 161-177 (1996)
1995
80 Hanno Lefmann, Vojtech Rödl: On Erdös-Rado Numbers. Combinatorica 15(1): 85-104 (1995)
79 David A. Grable, Kevin T. Phelps, Vojtech Rödl: The Minimum Independence Number for Designs. Combinatorica 15(2): 175-185 (1995)
78 Vojtech Rödl, Norbert Sauer, Xu-Ding Zhu: Ramsey Families which Exclude a Graph. Combinatorica 15(4): 589-596 (1995)
77EEDwight Duffus, Hanno Lefmann, Vojtech Rödl: Shift graphs and lower bounds on Ramsey numbers rk(l; r). Discrete Mathematics 137(1-3): 177-187 (1995)
76 Vojtech Rödl, Alexander Sidorenko: On the Jumping Constant Conjecture for Multigraphs. J. Comb. Theory, Ser. A 69(2): 347-357 (1995)
75 Jirí Matousek, Vojtech Rödl: On Ramsey Sets in Spheres. J. Comb. Theory, Ser. A 70(1): 30-44 (1995)
74EELászló Pyber, Vojtech Rödl, Endre Szemerédi: Dense Graphs without 3-Regular Subgraphs. J. Comb. Theory, Ser. B 63(1): 41-54 (1995)
73 Vojtech Rödl, Robin Thomas: On the Genus of a Random Graph. Random Struct. Algorithms 6(1): 1-12 (1995)
72 Richard A. Duke, Hanno Lefmann, Vojtech Rödl: On Uncrowded Hypergraphs. Random Struct. Algorithms 6(2/3): 209-212 (1995)
71 Paul Erdös, Vojtech Rödl: Covering of r-Graphs by Complete r-Partite Subgraphs. Random Struct. Algorithms 6(2/3): 319-322 (1995)
70 Dwight Duffus, Mark Ginn, Vojtech Rödl: On the Computational Complexity of Ordered Subgraph Recognition. Random Struct. Algorithms 7(3): 223-268 (1995)
69 Richard A. Duke, Hanno Lefmann, Vojtech Rödl: A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph. SIAM J. Comput. 24(3): 598-620 (1995)
1994
68EEPavel Pudlák, Vojtech Rödl: Some combinatorial-algebraic problems from complexity theory. Discrete Mathematics 136(1-3): 253-279 (1994)
67 Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster: The Algorithmic Aspects of the Regularity Lemma. J. Algorithms 16(1): 80-109 (1994)
66 Richard A. Duke, Vojtech Rödl: The Erdös-Ko-Rado Theorem for Small Families. J. Comb. Theory, Ser. A 65(2): 246-251 (1994)
65 Lucien Haddad, Vojtech Rödl: Unbalanced Steiner Triple Systems. J. Comb. Theory, Ser. A 66(1): 1-16 (1994)
64 Vojtech Rödl, Edita Sinajová: Note on Independent Sets in Steiner Systems. Random Struct. Algorithms 5(1): 183-190 (1994)
63 Vojtech Rödl, Andrzej Rucinski: Random Graphs with Monochromatic Triangles in Every Edge Coloring. Random Struct. Algorithms 5(2): 253-270 (1994)
1993
62EEPavel Pudlák, Vojtech Rödl: Modified ranks of tensors and the size of circuits. STOC 1993: 523-531
61EEF. Franek, Vojtech Rödl: 2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs. Discrete Mathematics 114(1-3): 199-203 (1993)
60EERonald J. Gould, Vojtech Rödl: On isomorphic subgraphs. Discrete Mathematics 118(1-3): 259-262 (1993)
59 Hanno Lefmann, Kevin T. Phelps, Vojtech Rödl: Rigid Linear Binary Codes. J. Comb. Theory, Ser. A 63(1): 110-128 (1993)
58EEHanno Lefmann, Vojtech Rödl: On Canonical Ramsey Numbers for Complete Graphs versus Paths. J. Comb. Theory, Ser. B 58(1): 1-13 (1993)
57EEVojtech Rödl, Bernd Voigt: Monochromatic Trees with Respect to Edge Partitions. J. Comb. Theory, Ser. B 58(2): 291-298 (1993)
56EEDavid S. Gunderson, Vojtech Rödl, Norbert W. Sauer: Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs. J. Comb. Theory, Ser. B 59(2): 199-209 (1993)
1992
55 Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster: The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) FOCS 1992: 473-481
54 Pavel Pudlák, Vojtech Rödl: A combinatorial approach to complexity. Combinatorica 12(2): 221-226 (1992)
53EEJaroslav Nesetril, Vojtech Rödl: On Ramsey graphs without bipartite subgraphs. Discrete Mathematics 101(1-3): 223-229 (1992)
52EERichard A. Duke, Paul Erdös, Vojtech Rödl: Cycle-connected graphs. Discrete Mathematics 108(1-3): 261-278 (1992)
51EEJan Pelant, Vojtech Rödl: On coverings of infinite- dimentional metric spaces. Discrete Mathematics 108(1-3): 75-81 (1992)
50EEJan Reiterman, Vojtech Rödl, Edita Sinajová: On embedding of graphs into euclidean spaces of small dimension. J. Comb. Theory, Ser. B 56(1): 1-8 (1992)
49 Vojtech Rödl, Zsolt Tuza: Rainbow Subgraphs in Properly Edge-colored Graphs. Random Struct. Algorithms 3(2): 175-182 (1992)
48 Nancy Eaton, Vojtech Rödl: A Canonical Ramsey Theorem. Random Struct. Algorithms 3(4): 427-444 (1992)
1991
47 Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtech Rödl, Peter Winkler: The number of t-wise balance designs. Combinatorica 11(3): 207-218 (1991)
46EEJason I. Brown, Vojtech Rödl: A ramsey type problem concerning vertex colourings. J. Comb. Theory, Ser. B 52(1): 45-52 (1991)
1990
45EEPeter Frankl, Ronald L. Graham, Vojtech Rödl: Iterated combinatorial density theorems. J. Comb. Theory, Ser. A 54(1): 95-111 (1990)
44 László Babai, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi: Lower Bounds to the Complexity of Symmetric Boolean Functions. Theor. Comput. Sci. 74(3): 313-323 (1990)
1989
43 Jan Reiterman, Vojtech Rödl, Edita Sinajová: Embeddings of Graphs in Euclidean Spaces. Discrete & Computational Geometry 4: 349-364 (1989)
42EEJan Reiterman, Vojtech Rödl, Edita Sinajová: Geometrical embeddings of graphs. Discrete Mathematics 74(3): 291-319 (1989)
41EEJaroslav Nesetril, Vojtech Rödl: The partite construction and ramsey set systems. Discrete Mathematics 75(1-3): 327-334 (1989)
40EECharles J. Colbourn, Vojtech Rödl: Percentages in pairwise balanced designs. Discrete Mathematics 77(1-3): 57-63 (1989)
39EEJaroslav Nesetril, Vojtech Rödl: Chromatically optimal rigid graphs. J. Comb. Theory, Ser. B 46(2): 133-141 (1989)
38 Vojtech Rödl, Peter Winkler: A Ramsey-Type Theorem for Orderings of a Graph. SIAM J. Discrete Math. 2(3): 402-406 (1989)
1988
37 Pavel Pudlák, Vojtech Rödl, Petr Savický: Graph Complexity. Acta Inf. 25(5): 515-535 (1988)
36 Peter Frankl, Vojtech Rödl: Some Ramsey - Turán type results for hypergraphs. Combinatorica 8(4): 323-332 (1988)
35EEPeter Frankl, Ronald L. Graham, Vojtech Rödl: Quantitative theorems for regular systems of equations. J. Comb. Theory, Ser. A 47(2): 246-261 (1988)
34EEPeter Frankl, Vojtech Rödl, Richard M. Wilson: The number of submatrices of a given type in a Hadamard matrix and related results. J. Comb. Theory, Ser. B 44(3): 317-328 (1988)
33 Svatopluk Poljak, Vojtech Rödl, Joel Spencer: Tournament Ranking with Expected Profit in Polynomial Time. SIAM J. Discrete Math. 1(3): 372-376 (1988)
1987
32EEVojtech Rödl, William T. Trotter: A note on ranking functions. Discrete Mathematics 67(3): 307-309 (1987)
31 Vojtech Rödl, C. Tovey: Multiple Optima in Local Search. J. Algorithms 8(2): 250-259 (1987)
30EEPeter Frankl, Ronald L. Graham, Vojtech Rödl: Induced restricted Ramsey theorems for spaces. J. Comb. Theory, Ser. A 44(1): 120-128 (1987)
29EEPeter Frankl, Ronald L. Graham, Vojtech Rödl: On subsets of abelian groups with no 3-term arithmetic progression. J. Comb. Theory, Ser. A 45(1): 157-161 (1987)
28EEAndrás Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza: Local k-colorings of graphs and hypergraphs. J. Comb. Theory, Ser. B 43(2): 127-139 (1987)
1986
27 Miklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi, György Turán: Two lower bounds for branching programs STOC 1986: 30-38
26EEVojtech Rödl: On universality of graphs with uniformly distributed edges. Discrete Mathematics 59(1-2): 125-134 (1986)
25EEPaul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress: Coloring graphs with locally few colors. Discrete Mathematics 59(1-2): 21-34 (1986)
24EEHans Jürgen Prömel, Vojtech Rödl: An elementary proof of the canonizing version of Gallai-Witt's theorem. J. Comb. Theory, Ser. A 42(1): 144-149 (1986)
23EEDavid Preiss, Vojtech Rödl: Note on decomposition of spheres in Hilbert spaces. J. Comb. Theory, Ser. A 43(1): 38-44 (1986)
1985
22 Noga Alon, Peter Frankl, Vojtech Rödl: Geometrical Realization of Set Systems and Probabilistic Communication Complexity FOCS 1985: 277-280
21EEStefan A. Burr, Jaroslav Nesetril, Vojtech Rödl: On the use of senders in generalized ramsey theory for graphs. Discrete Mathematics 54(1): 1-13 (1985)
20EEJan Reiterman, Vojtech Rödl, Edita Sinajová, Miroslav Tuma: Threshold hypergraphs. Discrete Mathematics 54(2): 193-200 (1985)
19EEJaroslav Nesetril, Vojtech Rödl: Two remarks on Ramsey's theorem. Discrete Mathematics 54(3): 339-341 (1985)
18 Jaroslav Nesetril, Hans Jürgen Prömel, Vojtech Rödl, Bernd Voigt: Canonizing Ordering Theorems for Hales Jewett Structures. J. Comb. Theory, Ser. A 40(2): 394-408 (1985)
17EEVojtech Rödl, Zsolt Tuza: On color critical graphs. J. Comb. Theory, Ser. B 38(3): 204-213 (1985)
1984
16 Jaroslav Nesetril, Vojtech Rödl: Sparse Ramsey graphs. Combinatorica 4(1): 71-78 (1984)
15 Kevin T. Phelps, Vojtech Rödl: On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems. Combinatorica 4(1): 79-88 (1984)
14 Peter Frankl, Vojtech Rödl: Families of finite sets with three intersections. Combinatorica 4(2): 141-148 (1984)
13 Vojtech Rödl: On combinatorial properties of spheres in eulidean spaces. Combinatorica 4(4): 345-349 (1984)
12EEVáclav Koubek, Vojtech Rödl: On the minimum order of graphs with given semigroup. J. Comb. Theory, Ser. B 36(2): 135-155 (1984)
1983
11EEVojtech Rödl: On a problem in combinatorial geometry. Discrete Mathematics 45(1): 129-131 (1983)
10 Jaroslav Nesetril, Vojtech Rödl: Another Proof of the Folkman-Rado-Sanders Theorem. J. Comb. Theory, Ser. A 34(1): 108-109 (1983)
9 Jaroslav Nesetril, Vojtech Rödl: Ramsey Classes of Set Systems. J. Comb. Theory, Ser. A 34(2): 183-201 (1983)
8EEC. Chvatál, Vojtech Rödl, Endre Szemerédi, W. T. Trotter Jr.: The Ramsey number of a graph with bounded maximum degree. J. Comb. Theory, Ser. B 34(3): 239-243 (1983)
1982
7 Vladimír Müller, Vojtech Rödl: Monotone paths in ordered graphs. Combinatorica 2(2): 193-201 (1982)
6 Vojtech Rödl: Nearly bipartite graphs with large chromatic number. Combinatorica 2(4): 377-383 (1982)
5EEPavel Pudlák, Vojtech Rödl: Partition theorems for systems of finite subsets of integers. Discrete Mathematics 39(1): 67-73 (1982)
1981
4 Pavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl: Fast Recognition of Rings and Lattices. FCT 1981: 137-145
3 Jaroslav Nesetril, Vojtech Rödl: Simple proof of the existence of restricted Ramsey graphs by means of a partite construction. Combinatorica 1(2): 199-202 (1981)
2EESvatopluk Poljak, Vojtech Rödl: On set systems determined by intersections. Discrete Mathematics 34(2): 173-184 (1981)
1979
1EEJaroslav Nesetril, Vojtech Rödl: A short proof of the existence of highly chromatic hypergraphs without short cycles. J. Comb. Theory, Ser. B 27(2): 225-227 (1979)

Coauthor Index

1Miklós Ajtai [27]
2Noga Alon [22] [55] [67] [93] [110] [117] [144] [156] [168]
3Christian Avart [140] [159] [172]
4László Babai [27] [44]
5Jason I. Brown [46]
6Stefan A. Burr [21]
7Michael R. Capalbo [110] [117]
8C. Chvatál [8]
9Amin Coja-Oghlan [168]
10Charles J. Colbourn [40] [47]
11Andrzej Czygrinow [101] [106]
12Domingos Dellamonica Jr. [176]
13Y. Dementieva [118]
14Andrzej Dudek [173] [177]
15Dwight Duffus [70] [77] [97]
16Richard A. Duke [52] [55] [66] [67] [69] [72] [127]
17Nancy Eaton [48] [85]
18Paul Erdös [25] [52] [71] [127]
19Mike Ferrara [143]
20F. Franek [61]
21Peter Frankl [14] [22] [29] [30] [34] [35] [36] [45] [119] [161]
22Ehud Friedgut [133]
23Zoltán Füredi [25]
24Stefanie Gerke [162]
25Mark Ginn [70]
26Pavel Goralcik [4]
27A. Goralciková [4]
28Ronald J. Gould [60]
29David A. Grable [79]
30Ronald L. Graham [29] [30] [35] [45] [115] [120]
31David S. Gunderson [56] [96] [103] [113] [131]
32András Gyárfás [28]
33Lucien Haddad [65]
34András Hajnal [25]
35Péter Hajnal [27]
36Hiêp Hàn [168]
37Penny E. Haxell [116] [118] [130] [146] [153] [170] [178]
38Dean G. Hoffman [47]
39Mihyun Kang [168]
40Hal A. Kierstead (Henry A. Kierstead) [84]
41Yoshiharu Kohayakawa [90] [98] [108] [109] [110] [117] [121] [124] [125] [126] [129] [133] [134] [137] [143] [156] [162] [164] [176]
42Péter Komjáth [25] [172]
43János Komlós [27]
44Alexandr V. Kostochka [91] [99] [112] [138] [151]
45Václav Koubek [4] [12]
46Imre Leader [113] [131]
47Hanno Lefmann [55] [58] [59] [67] [69] [72] [77] [80] [83]
48Jenö Lehel (Jeno Lehel) [28]
49Tomasz Luczak [82] [90] [94] [95] [97] [120] [153] [172] [178]
50Jirí Matousek [75]
51Christian Mauduit [156]
52C. G. Moreira [156]
53Dhruv Mubayi [112] [122] [136] [157] [163]
54Vladimír Müller [7]
55Brendan Nagle [114] [118] [125] [128] [130] [134] [146] [148] [170] [174] [179]
56Jaroslav Nesetril (Jarik Nesetril) [1] [3] [9] [10] [16] [18] [19] [21] [28] [39] [41] [53]
57Jan Pelant [51]
58Yuejian Peng [123] [142] [153] [161] [178]
59Kevin T. Phelps [15] [47] [59] [79]
60Annika Poerschke [179]
61Joanna Polcyn [150]
62Svatopluk Poljak [2] [33] [101]
63David Preiss [23]
64Hans Jürgen Prömel [18] [24] [98] [102] [113] [131]
65Pavel Pudlák [5] [27] [37] [44] [54] [62] [68] [86]
66László Pyber [74]
67Jan Reiterman [20] [42] [43] [50]
68Andrzej Rucinski [63] [89] [92] [93] [97] [100] [104] [105] [110] [111] [115] [117] [120] [123] [133] [145] [150] [153] [154] [155] [158] [175] [176] [178]
69Norbert Sauer (Norbert W. Sauer) [56] [78] [88]
70Petr Savický [37]
71Mathias Schacht [137] [140] [148] [158] [159] [160] [164] [165] [166] [167] [168] [174] [179]
72Richard H. Schelp [28]
73Tomasz Schoen [94]
74Ákos Seress [25]
75Jiri Sgall [86]
76Alexander Sidorenko [76] [103]
77Mark H. Siggers [149] [160] [169]
78Miklós Simonovits [153]
79Edita Sinajová [20] [42] [43] [50] [64]
80Papa Sissokho [164]
81Jozef Skokan [108] [121] [135] [139] [142] [147] [153] [164] [178]
82Joel H. Spencer (Joel Spencer) [33]
83Angelika Steger [162]
84Endre Szemerédi [8] [27] [44] [74] [95] [107] [110] [117] [145] [150] [154] [155] [175]
85John M. Talbot [161]
86Anusch Taraz [104]
87E. Tengan [152]
88Prasad Tetali [112] [133]
89Lubos Thoma [81] [87] [124] [126] [141]
90Robin Thomas [73]
91Norihide Tokushige [160]
92C. Tovey [31]
93William T. Trotter [32]
94W. T. Trotter Jr. [8]
95Miroslav Tuma [20]
96György Turán [27]
97Zsolt Tuza [17] [28] [49]
98Bernd Voigt [18] [57]
99Michelle Wagner [100] [111]
100Richard M. Wilson [34]
101Peter Winkler (Peter M. Winkler) [38] [47]
102Robert E. Woodrow [88]
103Beata Wysocka [83]
104Raphael Yuster [55] [67]
105Xu-Ding Zhu [78]
106Jan Zich [171]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Complete | Author
Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)