The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Vojtech Rödl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  162. New Upper Bound on Vertex Folkman Numbers. [Citation Graph (, )][DBLP]


  163. Universality of random graphs. [Citation Graph (, )][DBLP]


  164. Hypergraph regularity and quasi-randomness. [Citation Graph (, )][DBLP]


  165. An approximate Dirac-type theorem for k -uniform hypergraphs. [Citation Graph (, )][DBLP]


  166. Regular Partitions of Hypergraphs: Counting Lemmas. [Citation Graph (, )][DBLP]


  167. Measures of Pseudorandomness for Finite Sequences: Minimal Values. [Citation Graph (, )][DBLP]


  168. A Dirac-Type Theorem for 3-Uniform Hypergraphs. [Citation Graph (, )][DBLP]


  169. Regular Partitions of Hypergraphs: Regularity Lemmas. [Citation Graph (, )][DBLP]


  170. The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. [Citation Graph (, )][DBLP]


  171. On Colourings of Hypergraphs Without Monochromatic Fano Planes. [Citation Graph (, )][DBLP]


  172. A Note on Universal and Canonically Coloured Sequences. [Citation Graph (, )][DBLP]


  173. Note on the 3-graph counting lemma. [Citation Graph (, )][DBLP]


  174. On k-chromatically connected graphs. [Citation Graph (, )][DBLP]


  175. Note on robust critical graphs with large odd girth. [Citation Graph (, )][DBLP]


  176. On the number of graphs with a given endomorphism monoid. [Citation Graph (, )][DBLP]


Search in 0.442secs, Finished in 0.447secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002