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

Search the dblp DataBase

Title:
Author:
Yoshiharu Kohayakawa: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl
    Efficient Testing of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:1017-1028 [Conf]
  3. Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber
    Searching in Random Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:278-292 [Conf]
  4. Celina M. Herrera de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
    Finding Skew Partitions Efficiently. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:163-172 [Conf]
  5. Yoshiharu Kohayakawa
    Advances in the Regularity Method. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:2- [Conf]
  6. Yoshiharu Kohayakawa, Vojtech Rödl
    Algorithmic Aspects of Regularity. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:1-17 [Conf]
  7. Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan
    Equivalent Conditions for Regularity (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:48-57 [Conf]
  8. Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa
    Querying Priced Information in Databases: The Conjunctive Case. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:6-15 [Conf]
  9. 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]
  10. D. Dellamonica Jr., Yoshiharu Kohayakawa
    An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1038-1044 [Conf]
  11. 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]
  12. Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Ziviani
    A Practical Minimal Perfect Hashing Method. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:488-500 [Conf]
  13. Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi
    Multidimensional Cube Packing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:3, pp:173-187 [Journal]
  14. Béla Bollobás, Yoshiharu Kohayakawa
    An Extension of the Erdös-Stone Theorem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:3, pp:279-286 [Journal]
  15. Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
    Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:1, pp:107-122 [Journal]
  16. Yoshiharu Kohayakawa
    A note on induced cycles in Kneser graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:3, pp:245-251 [Journal]
  17. Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger
    An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:1, pp:101-120 [Journal]
  18. 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]
  19. 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]
  20. Jair Donadelli, Yoshiharu Kohayakawa
    A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  21. Béla Bollobás, Graham Brightwell, Yoshiharu Kohayakawa, Imre Leader, Alex D. Scott
    Special Issue on Ramsey Theory. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:467-468 [Journal]
  22. 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]
  23. Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
    The Induced Size-Ramsey Number of Cycles. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:217-239 [Journal]
  24. 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]
  25. 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]
  26. 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]
  27. Carlos Gustavo T. de A. Moreira, Yoshiharu Kohayakawa
    Bounds for optimal coverings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:263-276 [Journal]
  28. Béla Bollobás, Yoshiharu Kohayakawa
    Percolation in High Dimensions. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1994, v:15, n:2, pp:113-125 [Journal]
  29. Celina M. Herrera de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
    Finding Skew Partitions Efficiently. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:505-521 [Journal]
  30. Béla Bollobás, Jair Donadelli, Yoshiharu Kohayakawa, Richard H. Schelp
    Ramsey minimal graphs. [Citation Graph (0, 0)][DBLP]
    J. Braz. Comp. Soc., 2001, v:7, n:3, pp:27-37 [Journal]
  31. Penny E. Haxell, Yoshiharu Kohayakawa
    Partitioning by Monochromatic Trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:68, n:2, pp:218-222 [Journal]
  32. Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
    Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:273-287 [Journal]
  33. Yoshiharu Kohayakawa, Bernd Kreuter
    The Width of Random Subsets of Boolean Lattices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:100, n:2, pp:376-386 [Journal]
  34. Yoshiharu Kohayakawa, Tomasz Luczak
    Sparse Anti-Ramsey Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:146-152 [Journal]
  35. 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]
  36. 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]
  37. Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
    The Evaluation of Random Subgraphs of the Cube. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:1, pp:55-90 [Journal]
  38. Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
    On the Diameter and Radius of Random Subgraphs of the Cube. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:5, pp:627-648 [Journal]
  39. Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
    Connectivity Properties of Random Subgraphs of the Cube. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:221-230 [Journal]
  40. Graham Brightwell, Yoshiharu Kohayakawa
    Ramsey Properties of Orientations of Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:4, pp:413-428 [Journal]
  41. Penny E. Haxell, Yoshiharu Kohayakawa
    On the Anti-Ramsey Property of Ramanujan Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:4, pp:417-432 [Journal]
  42. Yoshiharu Kohayakawa, Bernd Kreuter
    Threshold functions for asymmetric Ramsey properties involving cycles. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:3, pp:245-276 [Journal]
  43. Yoshiharu Kohayakawa, Bernd Kreuter, Deryk Osthus
    The length of random subsets of Boolean lattices. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:2, pp:177-194 [Journal]
  44. 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]
  45. 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]
  46. 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. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  47. Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber
    Searching in random partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:1, pp:41-57 [Journal]
  48. Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa
    The size of the largest bipartite subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:177, n:1-3, pp:267-271 [Journal]
  49. Yoshiharu Kohayakawa, Jerzy Wojciechowski
    On small graphs with highly imperfect powers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:104, n:3, pp:245-261 [Journal]
  50. 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]

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


  52. Property Testing and Parameter Testing for Permutations. [Citation Graph (, )][DBLP]


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


Search in 0.004secs, Finished in 0.007secs
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