Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoshiharu Kohayakawa
Person information
- affiliation: University of Sao Paulo, Brazil
- award (2018): Fulkerson Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j116]Yoshiharu Kohayakawa, Flávio Keidi Miyazawa:
Guest Editorial: Special Issue on Theoretical Informatics. Algorithmica 85(8): 2482-2484 (2023)- [j115]Yoshiharu Kohayakawa
, Guilherme Oliveira Mota, Olaf Parczyk, Jakob Schnitzer:
The anti-Ramsey threshold of complete graphs. Discret. Math. 346(5): 113343 (2023) - [j114]Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa:
The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$. J. Graph Theory 102(1): 197-200 (2023) - [j113]Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa:
The mod k $k$ chromatic index of random graphs. J. Graph Theory 103(4): 767-779 (2023) - 2022
- [j112]Yulin Chang, Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota:
Factors in randomly perturbed hypergraphs. Random Struct. Algorithms 60(2): 153-165 (2022) - 2021
- [j111]Jie Han, Yoshiharu Kohayakawa, Yury Person:
Near-perfect clique-factors in sparse pseudorandom graphs. Comb. Probab. Comput. 30(4): 570-590 (2021) - [j110]Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
A tight lower bound for the online bounded space hypercube bin packing problem. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - [j109]Yoshiharu Kohayakawa, Sang June Lee, Carlos Gustavo Moreira, Vojtech Rödl:
On strong Sidon sets of integers. J. Comb. Theory, Ser. A 183: 105490 (2021) - [j108]Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person:
Finding any given 2-factor in sparse pseudorandom graphs efficiently. J. Graph Theory 96(1): 87-108 (2021) - [j107]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
On the Query Complexity of Estimating the Distance to Hereditary Graph Properties. SIAM J. Discret. Math. 35(2): 1238-1251 (2021) - [j106]Yoshiharu Kohayakawa, Walner Mendonça, Guilherme Oliveira Mota, Bjarne Schülke:
Covering 3-Edge-Colored Random Graphs with Monochromatic Trees. SIAM J. Discret. Math. 35(2): 1447-1459 (2021) - [j105]Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Yoshiharu Kohayakawa, Tássio Naia:
Orientation Ramsey Thresholds for Cycles and Cliques. SIAM J. Discret. Math. 35(4): 2844-2857 (2021) - 2020
- [j104]Marcos Kiwi, Yoshiharu Kohayakawa, Sergio Rajsbaum, Francisco Rodríguez-Henríquez, Jayme Luiz Szwarcfiter, Alfredo Viola:
A perspective on theoretical computer science in Latin America. Commun. ACM 63(11): 102-107 (2020) - [j103]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
Estimating parameters associated with monotone properties. Comb. Probab. Comput. 29(4): 616-632 (2020) - [j102]Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Barnaby Roberts:
The multicolour size-Ramsey number of powers of paths. J. Comb. Theory, Ser. B 145: 359-375 (2020) - [j101]Maurício Collares Neto, Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota:
Counting restricted orientations of random graphs. Random Struct. Algorithms 56(4): 1016-1030 (2020) - 2019
- [j100]Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person:
Clique-factors in sparse pseudorandom graphs. Eur. J. Comb. 82 (2019) - [j99]Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa, Natasha Morrison, Guilherme Oliveira Mota, Damian Reding, Barnaby Roberts:
The size?Ramsey number of powers of paths. J. Graph Theory 91(3): 290-299 (2019) - [j98]Yoshiharu Kohayakawa, Troy Retter, Vojtech Rödl:
The size Ramsey number of short subdivisions of bounded degree graphs. Random Struct. Algorithms 54(2): 304-339 (2019) - [j97]Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa, Guilherme Oliveira Mota:
Powers of tight Hamilton cycles in randomly perturbed hypergraphs. Random Struct. Algorithms 55(4): 795-807 (2019) - [j96]Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk, Yury Person:
Universality for bounded degree spanning trees in randomly perturbed graphs. Random Struct. Algorithms 55(4): 854-864 (2019) - 2018
- [j95]Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Barnaby Roberts:
Triangle-Free Subgraphs of Random Graphs. Comb. Probab. Comput. 27(2): 141-161 (2018) - [j94]Jie Han, Yoshiharu Kohayakawa:
On hypergraphs without loose cycles. Discret. Math. 341(4): 946-949 (2018) - [j93]Jie Han, Yoshiharu Kohayakawa, Yury Person:
Near-perfect clique-factors in sparse pseudorandom graphs. Electron. Notes Discret. Math. 68: 221-226 (2018) - [j92]Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota:
On an anti-Ramsey threshold for sparse graphs with one triangle. J. Graph Theory 87(2): 176-187 (2018) - [j91]Yoshiharu Kohayakawa, Sangjune Lee, Carlos Gustavo Moreira, Vojtech Rödl:
Infinite Sidon Sets Contained in Sparse Random Sets of Integers. SIAM J. Discret. Math. 32(1): 410-449 (2018) - 2017
- [j90]Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person:
Powers of Hamilton cycles in pseudorandom graphs. Comb. 37(4): 573-616 (2017) - [j89]Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu:
Densities in large permutations and parameter testing. Eur. J. Comb. 60: 89-99 (2017) - [j88]Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
Counting results for sparse pseudorandom hypergraphs I. Eur. J. Comb. 65: 276-287 (2017) - [j87]Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
Counting results for sparse pseudorandom hypergraphs II. Eur. J. Comb. 65: 288-301 (2017) - [j86]Maurício Collares Neto, Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota:
On the number of r-transitive orientations of G(n, p). Electron. Notes Discret. Math. 61: 255-261 (2017) - [j85]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
Estimating the distance to a hereditary graph property. Electron. Notes Discret. Math. 61: 607-613 (2017) - [j84]Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht:
Monochromatic trees in random graphs. Electron. Notes Discret. Math. 61: 759-764 (2017) - [j83]Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris:
Chromatic thresholds in dense random graphs. Random Struct. Algorithms 51(2): 185-214 (2017) - [j82]Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris:
Chromatic thresholds in sparse random graphs. Random Struct. Algorithms 51(2): 215-236 (2017) - 2016
- [j81]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
On the Number of Bh -Sets. Comb. Probab. Comput. 25(1): 108-129 (2016) - [j80]Peter Frankl, Yoshiharu Kohayakawa, Vojtech Rödl:
A note on supersaturated set systems. Eur. J. Comb. 51: 190-199 (2016) - [j79]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
The number of B3-sets of a given cardinality. J. Comb. Theory, Ser. A 142: 44-76 (2016) - 2015
- [j78]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. Discret. Math. 338(2): 262-271 (2015) - [j77]Peter Allen, Julia Böttcher, Barnaby Roberts, Yoshiharu Kohayakawa:
Triangle-Free Subgraphs of Random Graphs. Electron. Notes Discret. Math. 49: 393-397 (2015) - [j76]Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz:
A counting lemma for sparse pseudorandom hypergraphs. Electron. Notes Discret. Math. 50: 421-426 (2015) - [j75]Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. Random Struct. Algorithms 46(1): 1-25 (2015) - [j74]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
An improved upper bound on the density of universal random graphs. Random Struct. Algorithms 46(2): 274-299 (2015) - [j73]Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Yury Person:
Tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms 46(3): 446-465 (2015) - [j72]Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz, Andreas Würfl:
An Extension of the Blow-up Lemma to Arrangeable Graphs. SIAM J. Discret. Math. 29(2): 962-1001 (2015) - 2014
- [j71]Peter Allen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Roberto F. Parente:
On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length. Electron. J. Comb. 21(1): 1 (2014) - [j70]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. Eur. J. Comb. 35: 354-373 (2014) - [j69]Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota:
On an anti-Ramsey threshold for random graphs. Eur. J. Comb. 40: 26-41 (2014) - [j68]Yoshiharu Kohayakawa, Mathias Schacht, Reto Spöhel:
Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Struct. Algorithms 44(1): 1-28 (2014) - 2013
- [j67]Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz:
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal. Comb. Probab. Comput. 22(5): 639-683 (2013) - [j66]Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person:
An approximate blow-up lemma for sparse pseudorandom graphs. Electron. Notes Discret. Math. 44: 393-398 (2013) - [j65]Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Balázs Ráth, Rudini Menezes Sampaio:
Limits of permutation sequences. J. Comb. Theory, Ser. B 103(1): 93-113 (2013) - 2012
- [j64]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size. Comb. Probab. Comput. 21(1-2): 203-218 (2012) - [j63]Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio:
A note on permutation regularity. Discret. Appl. Math. 160(18): 2716-2727 (2012) - [j62]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Hypergraphs with many Kneser colorings. Eur. J. Comb. 33(5): 816-843 (2012) - [j61]Julia Böttcher, Yoshiharu Kohayakawa, Aldo Procacci:
Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Struct. Algorithms 40(4): 425-436 (2012) - [j60]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
Universality of Random Graphs. SIAM J. Discret. Math. 26(1): 353-374 (2012) - 2011
- [j59]Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Roberto F. Parente:
A note on counting orientations. Electron. Notes Discret. Math. 37: 3-8 (2011) - [j58]Ricardo C. Corrêa, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio:
A note on random k-dimensional posets. Electron. Notes Discret. Math. 37: 51-56 (2011) - [j57]Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota:
On an anti-Ramsey property of random graphs. Electron. Notes Discret. Math. 37: 237-242 (2011) - [j56]Antônio J. O. Bastos, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio:
Every hereditary permutation property is testable. Electron. Notes Discret. Math. 38: 123-128 (2011) - [j55]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. Electron. Notes Discret. Math. 38: 469-474 (2011) - [j54]Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio:
Testing permutation properties through subpermutations. Theor. Comput. Sci. 412(29): 3555-3567 (2011) - 2010
- [j53]Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht:
Weak hypergraph regularity and linear hypergraphs. J. Comb. Theory, Ser. B 100(2): 151-160 (2010) - 2009
- [j52]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Kneser Colorings of Uniform Hypergraphs. Electron. Notes Discret. Math. 34: 219-223 (2009) - [j51]Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio:
A note on permutation regularity. Electron. Notes Discret. Math. 35: 183-188 (2009) - [j50]Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz:
Almost spanning subgraphs of random graphs after adversarial edge removal. Electron. Notes Discret. Math. 35: 335-340 (2009) - 2008
- [j49]Domingos Dellamonica Jr., Yoshiharu Kohayakawa:
An Algorithmic Friedman-Pippenger Theorem on Tree Embeddings and Applications. Electron. J. Comb. 15(1) (2008) - [j48]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Martin Marciniszyn, Angelika Steger:
On the Resilience of Long Cycles in Random Graphs. Electron. J. Comb. 15(1) (2008) - [j47]Jan Zich, Yoshiharu Kohayakawa, Vojtech Rödl, V. Sunderam:
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness. Internet Math. 5(3): 227-250 (2008) - 2007
- [j46]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) - [j45]Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa A. Sissokho, Jozef Skokan:
Turán's theorem for pseudo-random graphs. J. Comb. Theory, Ser. A 114(4): 631-657 (2007) - [j44]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 Trans. Algorithms 3(1): 9:1-9:22 (2007) - 2006
- [j43]Noga Alon, Yoshiharu Kohayakawa, Christian Mauduit, Carlos Gustavo T. de A. Moreira, Vojtech Rödl:
Measures of Pseudorandomness for Finite Sequences: Minimal Values. Comb. Probab. Comput. 15(1-2): 1-29 (2006) - 2005
- [j42]Mike Ferrara, Yoshiharu Kohayakawa, Vojtech Rödl:
Distance Graphs on the Integers. Comb. Probab. Comput. 14(1-2): 107-131 (2005) - [j41]Yoshiharu Kohayakawa, Miklós Simonovits, Jozef Skokan:
The 3-colored Ramsey number of odd cycles. Electron. Notes Discret. Math. 19: 397-402 (2005) - [j40]Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa:
A note on the Size-Ramsey number of long subdivisions of graphs. RAIRO Theor. Informatics Appl. 39(1): 191-206 (2005) - 2004
- [j39]Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi:
Multidimensional Cube Packing. Algorithmica 40(3): 173-187 (2004) - [j38]Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht:
The Turán Theorem for Random Graphs. Comb. Probab. Comput. 13(1): 61-91 (2004) - [j37]Carlos Gustavo T. de A. Moreira, Yoshiharu Kohayakawa:
Bounds for optimal coverings. Discret. Appl. Math. 141(1-3): 263-276 (2004) - [j36]Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber:
Searching in random partially ordered sets. Theor. Comput. Sci. 321(1): 41-57 (2004) - 2003
- [j35]Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl:
Hereditary Properties Of Triple Systems. Comb. Probab. Comput. 12(2): 155-189 (2003) - [j34]Béla Bollobás, Graham R. Brightwell, Yoshiharu Kohayakawa, Imre Leader, Alex D. Scott:
Special Issue on Ramsey Theory. Comb. Probab. Comput. 12(5-6): 467-468 (2003) - [j33]Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali:
Ramsey Games Against a One-Armed Bandit. Comb. Probab. Comput. 12(5-6): 515-545 (2003) - [j32]Yoshiharu Kohayakawa, Vojtech Rödl:
Regular pairs in sparse random graphs I. Random Struct. Algorithms 22(4): 359-434 (2003) - [j31]Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma:
An Optimal Algorithm for Checking Regularity. SIAM J. Comput. 32(5): 1210-1235 (2003) - 2002
- [j30]Jair Donadelli, Yoshiharu Kohayakawa:
A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall. Electron. J. Comb. 9(1) (2002) - [j29]Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan:
Hypergraphs, Quasi-randomness, and Conditions for Regularity. J. Comb. Theory, Ser. A 97(2): 307-352 (2002) - [j28]Yoshiharu Kohayakawa, Bernd Kreuter:
The Width of Random Subsets of Boolean Lattices. J. Comb. Theory, Ser. A 100(2): 376-386 (2002) - 2001
- [j27]Carlos Gustavo T. de A. Moreira, Yoshiharu Kohayakawa:
Bounds for Optimal Coverings. Electron. Notes Discret. Math. 7: 62-65 (2001) - [j26]Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi:
Multidimensional Cube Packing. Electron. Notes Discret. Math. 7: 110-113 (2001) - [j25]Béla Bollobás, Jair Donadelli, Yoshiharu Kohayakawa, Richard H. Schelp:
Ramsey minimal graphs. J. Braz. Comput. Soc. 7(3): 27-37 (2001) - 2000
- [j24]Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed:
Finding Skew Partitions Efficiently. J. Algorithms 37(2): 505-521 (2000) - [j23]Yoshiharu Kohayakawa, Bernd Kreuter, Deryk Osthus:
The length of random subsets of Boolean lattices. Random Struct. Algorithms 16(2): 177-194 (2000) - 1998
- [j22]Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger:
An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth. Comb. 18(1): 101-120 (1998) - [j21]Yoshiharu Kohayakawa, Hans Jürgen Prömel, Vojtech Rödl:
Induced Ramsey Numbers. Comb. 18(3): 373-404 (1998) - [j20]Penny E. Haxell, Yoshiharu Kohayakawa:
Packing and Covering Triangles in Tripartite Graphs. Graphs Comb. 14(1): 1-10 (1998) - 1997
- [j19]Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl:
On K4-Free Subgraphs of Random Graphs. Comb. 17(2): 173-213 (1997) - [j18]Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa:
The size of the largest bipartite subgraphs. Discret. Math. 177(1-3): 267-271 (1997) - [j17]Yoshiharu Kohayakawa, Bernd Kreuter:
Threshold functions for asymmetric Ramsey properties involving cycles. Random Struct. Algorithms 11(3): 245-276 (1997) - 1996
- [j16]Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak:
Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. Comb. 16(1): 107-122 (1996) - [j15]Penny E. Haxell, Yoshiharu Kohayakawa:
Partitioning by Monochromatic Trees. J. Comb. Theory, Ser. B 68(2): 218-222 (1996) - [j14]Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl:
Ramsey-type results for oriented trees. J. Graph Theory 22(1): 1-8 (1996) - 1995
- [j13]Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak:
The Induced Size-Ramsey Number of Cycles. Comb. Probab. Comput. 4: 217-239 (1995) - [j12]Yoshiharu Kohayakawa, Tomasz Luczak:
Sparse Anti-Ramsey Graphs. J. Comb. Theory, Ser. B 63(1): 146-152 (1995) - [j11]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) - [j10]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) - [j9]Penny E. Haxell, Yoshiharu Kohayakawa:
On the Anti-Ramsey Property of Ramanujan Graphs. Random Struct. Algorithms 6(4): 417-432 (1995) - 1994
- [j8]Béla Bollobás, Yoshiharu Kohayakawa:
An Extension of the Erdös-Stone Theorem. Comb. 14(3): 279-286 (1994) - [j7]Béla Bollobás, Yoshiharu Kohayakawa:
Percolation in High Dimensions. Eur. J. Comb. 15(2): 113-125 (1994) - [j6]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
- [j5]Graham R. Brightwell, Yoshiharu Kohayakawa:
Ramsey Properties of Orientations of Graphs. Random Struct. Algorithms 4(4): 413-428 (1993) - 1992
- [j4]Yoshiharu Kohayakawa, Jerzy Wojciechowski:
On small graphs with highly imperfect powers. Discret. Math. 104(3): 245-261 (1992) - [j3]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
- [j2]Yoshiharu Kohayakawa:
A note on induced cycles in Kneser graphs. Comb. 11(3): 245-251 (1991) - 1990
- [j1]Yoshiharu Kohayakawa:
A Note on Kernels of Intersecting Families. Eur. J. Comb. 11(2): 155-164 (1990)
Conference and Workshop Papers
- 2023
- [c27]José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota:
A canonical Ramsey theorem with list constraints in random graphs. LAGOS 2023: 13-19 - [c26]José D. Alvarado, Yoshiharu Kohayakawa, Richard Lang, Guilherme Oliveira Mota, Henrique Stagni:
Resilience for loose Hamilton cycles. LAGOS 2023: 193-200 - 2021
- [c25]Maurício Collares Neto, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Guilherme Oliveira Mota:
Constrained colourings of random graphs. LAGOS 2021: 368-375 - [c24]Maurício Collares Neto, Yoshiharu Kohayakawa, Taísa Martins, Roberto Parente, Victor Souza:
Hitting times for arc-disjoint arborescences in random digraph processes. LAGOS 2021: 376-384 - 2019
- [c23]Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni:
Extremal and probabilistic results for order types. SODA 2019: 426-435 - [c22]Gabriel Coutinho, Yoshiharu Kohayakawa, Vinícius Fernandes dos Santos, Sebastián Urrutia:
Preface. LAGOS 2019: 1-2 - 2018
- [c21]Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni:
Property Testing for Point Sets on the Plane. LATIN 2018: 584-596 - [c20]Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game. LATIN 2018: 697-711 - 2016
- [c19]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
Estimating Parameters Associated with Monotone Properties. APPROX-RANDOM 2016: 35:1-35:13 - 2014
- [c18]Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person:
Powers of Hamilton Cycles in Pseudorandom Graphs. LATIN 2014: 355-366 - 2013
- [c17]Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
An Unstable Hypergraph Problem with a Unique Optimal Solution. Information Theory, Combinatorics, and Search Theory 2013: 432-450 - 2012
- [c16]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
An Improved Upper Bound on the Density of Universal Random Graphs. LATIN 2012: 231-242 - 2011
- [c15]Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl:
The maximum size of a Sidon set contained in a sparse random set of integers. SODA 2011: 159-171 - 2010
- [c14]Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio:
Property Testing and Parameter Testing for Permutations. SODA 2010: 66-75 - 2008
- [c13]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
Universality of random graphs. SODA 2008: 782-788 - 2006
- [c12]Domingos Dellamonica Jr., Yoshiharu Kohayakawa:
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing. SODA 2006: 1038-1044 - 2005
- [c11]Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Ziviani:
A Practical Minimal Perfect Hashing Method. WEA 2005: 488-500 - 2004
- [c10]Yoshiharu Kohayakawa:
Advances in the Regularity Method. LATIN 2004: 2 - [c9]Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa:
Querying Priced Information in Databases: The Conjunctive Case. LATIN 2004: 6-15 - 2002
- [c8]Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl:
Efficient Testing of Hypergraphs. ICALP 2002: 1017-1028 - [c7]Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber:
Searching in Random Partially Ordered Sets. LATIN 2002: 278-292 - [c6]Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma:
An optimal algorithm for checking regularity (extended abstract). SODA 2002: 277-286 - 2001
- [c5]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 - 2000
- [c4]Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Universality and Tolerance. FOCS 2000: 14-21 - [c3]Yoshiharu Kohayakawa, Vojtech Rödl:
Algorithmic Aspects of Regularity. LATIN 2000: 1-17 - [c2]Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan:
Equivalent Conditions for Regularity (Extended Abstract). LATIN 2000: 48-57 - [c1]Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed:
Finding Skew Partitions Efficiently. LATIN 2000: 163-172
Editorship
- 2020
- [e3]Yoshiharu Kohayakawa, Flávio Keidi Miyazawa:
LATIN 2020: Theoretical Informatics - 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings. Lecture Notes in Computer Science 12118, Springer 2020, ISBN 978-3-030-61791-2 [contents] - 2019
- [e2]Gabriel Coutinho, Yoshiharu Kohayakawa, Vinícius Fernandes dos Santos, Sebastián Urrutia:
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2019, Belo Horizonte, Brazil, June 2-7, 2019. Electronic Notes in Theoretical Computer Science 346, Elsevier 2019 [contents] - 2006
- [e1]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. IFIP 209, Springer 2006, ISBN 0-387-34633-3 [contents]
Informal and Other Publications
- 2021
- [i6]Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
A tight lower bound for the online bounded space hypercube bin packing problem. CoRR abs/2107.14161 (2021) - 2019
- [i5]Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person:
Finding any given 2-factor in sparse pseudorandom graphs efficiently. CoRR abs/1902.06164 (2019) - [i4]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
On the query complexity of estimating the distance to hereditary graph properties. CoRR abs/1912.01081 (2019) - 2017
- [i3]Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
Estimating parameters associated with monotone properties. CoRR abs/1707.08225 (2017) - [i2]Yoshiharu Kohayakawa, Flavio Keidi Miyazawa, Yoshiko Wakabayashi:
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. CoRR abs/1712.06763 (2017) - 2014
- [i1]Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu:
Large permutations and parameter testing. CoRR abs/1412.5622 (2014)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
