| 2008 | ||
|---|---|---|
| 57 | Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski: Universality of random graphs. SODA 2008: 782-788 | |
| 2007 | ||
| 56 | Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas: Querying priced information in databases: The conjunctive case. ACM Transactions on Algorithms 3(1): (2007) | |
| 55 | Yoshiharu 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) | |
| 54 | Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger: Small subsets inherit sparse epsilon-regularity. J. Comb. Theory, Ser. B 97(1): 34-56 (2007) | |
| 2006 | ||
| 53 | Gonzalo Navarro, Leopoldo E. Bertossi, Yoshiharu Kohayakawa: Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), IFIP 19th World Computer Congress, TC-1 Foundations of Computer Science, August 23-24, 2006, Santiago, Chile Springer 2006 | |
| 52 | Domingos Dellamonica Jr., Yoshiharu Kohayakawa: An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing. SODA 2006: 1038-1044 | |
| 51 | Noga 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) | |
| 2005 | ||
| 50 | Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Ziviani: A Practical Minimal Perfect Hashing Method. WEA 2005: 488-500 | |
| 49 | Mike Ferrara, Yoshiharu Kohayakawa, Vojtech Rödl: Distance Graphs on the Integers. Combinatorics, Probability & Computing 14(1-2): 107-131 (2005) | |
| 48 | Yoshiharu Kohayakawa, Miklós Simonovits, Jozef Skokan: The 3-colored Ramsey number of odd cycles. Electronic Notes in Discrete Mathematics 19: 397-402 (2005) | |
| 47 | Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa: A note on the Size-Ramsey number of long subdivisions of graphs. ITA 39(1): 191-206 (2005) | |
| 2004 | ||
| 46 | Yoshiharu Kohayakawa: Advances in the Regularity Method. LATIN 2004: 2 | |
| 45 | Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa: Querying Priced Information in Databases: The Conjunctive Case. LATIN 2004: 6-15 | |
| 44 | Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi: Multidimensional Cube Packing. Algorithmica 40(3): 173-187 (2004) | |
| 43 | Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht: The Turán Theorem for Random Graphs. Combinatorics, Probability & Computing 13(1): 61-91 (2004) | |
| 42 | Carlos Gustavo T. de A. Moreira, Yoshiharu Kohayakawa: Bounds for optimal coverings. Discrete Applied Mathematics 141(1-3): 263-276 (2004) | |
| 41 | Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber: Searching in random partially ordered sets. Theor. Comput. Sci. 321(1): 41-57 (2004) | |
| 2003 | ||
| 40 | Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl: Hereditary Properties Of Triple Systems. Combinatorics, Probability & Computing 12(2): (2003) | |
| 39 | Béla Bollobás, Graham Brightwell, Yoshiharu Kohayakawa, Imre Leader, Alex D. Scott: Special Issue on Ramsey Theory. Combinatorics, Probability & Computing 12(5-6): 467-468 (2003) | |
| 38 | 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) | |
| 37 | Yoshiharu Kohayakawa, Vojtech Rödl: Regular pairs in sparse random graphs I. Random Struct. Algorithms 22(4): 359-434 (2003) | |
| 36 | Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma: An Optimal Algorithm for Checking Regularity. SIAM J. Comput. 32(5): 1210-1235 (2003) | |
| 2002 | ||
| 35 | Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl: Efficient Testing of Hypergraphs. ICALP 2002: 1017-1028 | |
| 34 | Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber: Searching in Random Partially Ordered Sets. LATIN 2002: 278-292 | |
| 33 | Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma: An optimal algorithm for checking regularity (extended abstract). SODA 2002: 277-286 | |
| 32 | Jair Donadelli, Yoshiharu Kohayakawa: A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall. Electr. J. Comb. 9(1): (2002) | |
| 31 | Yoshiharu Kohayakawa, Bernd Kreuter: The Width of Random Subsets of Boolean Lattices. J. Comb. Theory, Ser. A 100(2): 376-386 (2002) | |
| 30 | Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan: Hypergraphs, Quasi-randomness, and Conditions for Regularity. J. Comb. Theory, Ser. A 97(2): 307-352 (2002) | |
| 2001 | ||
| 29 | 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 | Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi: Multidimensional Cube Packing. Electronic Notes in Discrete Mathematics 7: 110-113 (2001) | |
| 27 | Carlos Gustavo T. de A. Moreira, Yoshiharu Kohayakawa: Bounds for Optimal Coverings. Electronic Notes in Discrete Mathematics 7: 62-65 (2001) | |
| 26 | Béla Bollobás, Jair Donadelli, Yoshiharu Kohayakawa, Richard H. Schelp: Ramsey minimal graphs. J. Braz. Comp. Soc. 7(3): 27-37 (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 | Yoshiharu Kohayakawa, Vojtech Rödl: Algorithmic Aspects of Regularity. LATIN 2000: 1-17 | |
| 23 | Celina M. Herrera de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed: Finding Skew Partitions Efficiently. LATIN 2000: 163-172 | |
| 22 | Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan: Equivalent Conditions for Regularity (Extended Abstract). LATIN 2000: 48-57 | |
| 21 | Celina M. Herrera de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed: Finding Skew Partitions Efficiently. J. Algorithms 37(2): 505-521 (2000) | |
| 20 | Yoshiharu Kohayakawa, Bernd Kreuter, Deryk Osthus: The length of random subsets of Boolean lattices. Random Struct. Algorithms 16(2): 177-194 (2000) | |
| 1998 | ||
| 19 | Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger: An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth. Combinatorica 18(1): 101-120 (1998) | |
| 18 | Yoshiharu Kohayakawa, Hans Jürgen Prömel, Vojtech Rödl: Induced Ramsey Numbers. Combinatorica 18(3): 373-404 (1998) | |
| 1997 | ||
| 17 | Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl: On K4-Free Subgraphs of Random Graphs. Combinatorica 17(2): 173-213 (1997) | |
| 16 | Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa: The size of the largest bipartite subgraphs. Discrete Mathematics 177(1-3): 267-271 (1997) | |
| 15 | Yoshiharu Kohayakawa, Bernd Kreuter: Threshold functions for asymmetric Ramsey properties involving cycles. Random Struct. Algorithms 11(3): 245-276 (1997) | |
| 1996 | ||
| 14 | Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak: Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. Combinatorica 16(1): 107-122 (1996) | |
| 13 | Penny E. Haxell, Yoshiharu Kohayakawa: Partitioning by Monochromatic Trees. J. Comb. Theory, Ser. B 68(2): 218-222 (1996) | |
| 1995 | ||
| 12 | Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak: The Induced Size-Ramsey Number of Cycles. Combinatorics, Probability & Computing 4: 217-239 (1995) | |
| 11 | Yoshiharu Kohayakawa, Tomasz Luczak: Sparse Anti-Ramsey Graphs. J. Comb. Theory, Ser. B 63(1): 146-152 (1995) | |
| 10 | Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak: Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles. J. Comb. Theory, Ser. B 64(2): 273-287 (1995) | |
| 9 | Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak: Connectivity Properties of Random Subgraphs of the Cube. Random Struct. Algorithms 6(2/3): 221-230 (1995) | |
| 8 | Penny E. Haxell, Yoshiharu Kohayakawa: On the Anti-Ramsey Property of Ramanujan Graphs. Random Struct. Algorithms 6(4): 417-432 (1995) | |
| 1994 | ||
| 7 | Béla Bollobás, Yoshiharu Kohayakawa: An Extension of the Erdös-Stone Theorem. Combinatorica 14(3): 279-286 (1994) | |
| 6 | Béla Bollobás, Yoshiharu Kohayakawa: Percolation in High Dimensions. Eur. J. Comb. 15(2): 113-125 (1994) | |
| 5 | Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak: On the Diameter and Radius of Random Subgraphs of the Cube. Random Struct. Algorithms 5(5): 627-648 (1994) | |
| 1993 | ||
| 4 | Graham Brightwell, Yoshiharu Kohayakawa: Ramsey Properties of Orientations of Graphs. Random Struct. Algorithms 4(4): 413-428 (1993) | |
| 1992 | ||
| 3 | Yoshiharu Kohayakawa, Jerzy Wojciechowski: On small graphs with highly imperfect powers. Discrete Mathematics 104(3): 245-261 (1992) | |
| 2 | Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak: The Evaluation of Random Subgraphs of the Cube. Random Struct. Algorithms 3(1): 55-90 (1992) | |
| 1991 | ||
| 1 | Yoshiharu Kohayakawa: A note on induced cycles in Kneser graphs. Combinatorica 11(3): 245-251 (1991) | |