Yoshiharu Kohayakawa

ORCID

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 52

Top Venues

Random Struct. Algorithms

Eur. J. Comb.

CoRR

Electron. Notes Discret. Math.

Publications

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) (2023)
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa
Guest Editorial: Special Issue on Theoretical Informatics. Algorithmica 85 (8) (2023)
José D. Alvarado, Yoshiharu Kohayakawa, Richard Lang, Guilherme Oliveira Mota, Henrique Stagni
Resilience for loose Hamilton cycles. LAGOS (2023)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Olaf Parczyk, Jakob Schnitzer
The anti-Ramsey threshold of complete graphs. Discret. Math. 346 (5) (2023)
Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa
The mod k $k$ chromatic index of random graphs. J. Graph Theory 103 (4) (2023)
José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota
A canonical Ramsey theorem with list constraints in random graphs. LAGOS (2023)
Yulin Chang, Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota
Factors in randomly perturbed hypergraphs. Random Struct. Algorithms 60 (2) (2022)
Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person
Finding any given 2-factor in sparse pseudorandom graphs efficiently. J. Graph Theory 96 (1) (2021)
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)
Maurício Collares Neto, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Guilherme Oliveira Mota
Constrained colourings of random graphs. LAGOS (2021)
Jie Han, Yoshiharu Kohayakawa, Yury Person
Near-perfect clique-factors in sparse pseudorandom graphs. Comb. Probab. Comput. 30 (4) (2021)
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) (2021)
Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Yoshiharu Kohayakawa, Tássio Naia
Orientation Ramsey Thresholds for Cycles and Cliques. SIAM J. Discret. Math. 35 (4) (2021)
Yoshiharu Kohayakawa, Sang June Lee, Carlos Gustavo Moreira, Vojtech Rödl
On strong Sidon sets of integers. J. Comb. Theory, Ser. A 183 (2021)
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) (2021)
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)
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
A tight lower bound for the online bounded space hypercube bin packing problem. CoRR (2021)
Maurício Collares Neto, Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota
Counting restricted orientations of random graphs. Random Struct. Algorithms 56 (4) (2020)
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) (2020)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
Estimating parameters associated with monotone properties. Comb. Probab. Comput. 29 (4) (2020)
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 (2020)
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) (2019)
Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person
Clique-factors in sparse pseudorandom graphs. Eur. J. Comb. 82 (2019)
Gabriel Coutinho, Yoshiharu Kohayakawa, Vinícius Fernandes dos Santos, Sebastián Urrutia
Preface. LAGOS (2019)
Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person
Finding any given 2-factor in sparse pseudorandom graphs efficiently. CoRR (2019)
Yoshiharu Kohayakawa, Troy Retter, Vojtech Rödl
The size Ramsey number of short subdivisions of bounded degree graphs. Random Struct. Algorithms 54 (2) (2019)
Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni
Extremal and probabilistic results for order types. SODA (2019)
Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa, Guilherme Oliveira Mota
Powers of tight Hamilton cycles in randomly perturbed hypergraphs. Random Struct. Algorithms 55 (4) (2019)
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) (2019)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
On the query complexity of estimating the distance to hereditary graph properties. CoRR (2019)
Jie Han, Yoshiharu Kohayakawa, Yury Person
Near-perfect clique-factors in sparse pseudorandom graphs. Electron. Notes Discret. Math. 68 (2018)
Jie Han, Yoshiharu Kohayakawa
On hypergraphs without loose cycles. Discret. Math. 341 (4) (2018)
Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni
Property Testing for Point Sets on the Plane. LATIN (2018)
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) (2018)
Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota
On an anti-Ramsey threshold for sparse graphs with one triangle. J. Graph Theory 87 (2) (2018)
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)
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Barnaby Roberts
Triangle-Free Subgraphs of Random Graphs. Comb. Probab. Comput. 27 (2) (2018)
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 (2017)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
Counting results for sparse pseudorandom hypergraphs I. Eur. J. Comb. 65 (2017)
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
Powers of Hamilton cycles in pseudorandom graphs. Comb. 37 (4) (2017)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
Estimating the distance to a hereditary graph property. Electron. Notes Discret. Math. 61 (2017)
Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu
Densities in large permutations and parameter testing. Eur. J. Comb. 60 (2017)
Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris
Chromatic thresholds in sparse random graphs. Random Struct. Algorithms 51 (2) (2017)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht
Monochromatic trees in random graphs. Electron. Notes Discret. Math. 61 (2017)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
Estimating parameters associated with monotone properties. CoRR (2017)
Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris
Chromatic thresholds in dense random graphs. Random Struct. Algorithms 51 (2) (2017)
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 (2017)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
Counting results for sparse pseudorandom hypergraphs II. Eur. J. Comb. 65 (2017)
Peter Frankl, Yoshiharu Kohayakawa, Vojtech Rödl
A note on supersaturated set systems. Eur. J. Comb. 51 (2016)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
-sets of a given cardinality. J. Comb. Theory, Ser. A 142 (2016)
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
Estimating Parameters Associated with Monotone Properties. APPROX-RANDOM (2016)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
-Sets. Comb. Probab. Comput. 25 (1) (2016)
Peter Allen, Julia Böttcher, Barnaby Roberts, Yoshiharu Kohayakawa
Triangle-Free Subgraphs of Random Graphs. Electron. Notes Discret. Math. 49 (2015)
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) (2015)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
A counting lemma for sparse pseudorandom hypergraphs. Electron. Notes Discret. Math. 50 (2015)
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) (2015)
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) (2015)
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Yury Person
Tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms 46 (3) (2015)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. Discret. Math. 338 (2) (2015)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. Eur. J. Comb. 35 (2014)
Yoshiharu Kohayakawa, Mathias Schacht, Reto Spöhel
Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Struct. Algorithms 44 (1) (2014)
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
Powers of Hamilton Cycles in Pseudorandom Graphs. LATIN (2014)
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) (2014)
Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu
Large permutations and parameter testing. CoRR (2014)
Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota
On an anti-Ramsey threshold for random graphs. Eur. J. Comb. 40 (2014)
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal. Comb. Probab. Comput. 22 (5) (2013)
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) (2013)
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 (2013)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
An Unstable Hypergraph Problem with a Unique Optimal Solution. Information Theory, Combinatorics, and Search Theory (2013)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
Universality of Random Graphs. SIAM J. Discret. Math. 26 (1) (2012)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
An Improved Upper Bound on the Density of Universal Random Graphs. LATIN (2012)
Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
A note on permutation regularity. Discret. Appl. Math. 160 (18) (2012)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Hypergraphs with many Kneser colorings. Eur. J. Comb. 33 (5) (2012)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size. Comb. Probab. Comput. 21 (1-2) (2012)
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) (2012)
Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl
The maximum size of a Sidon set contained in a sparse random set of integers. SODA (2011)
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 (2011)
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Roberto F. Parente
A note on counting orientations. Electron. Notes Discret. Math. 37 (2011)
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio
Testing permutation properties through subpermutations. Theor. Comput. Sci. 412 (29) (2011)
Antônio J. O. Bastos, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
Every hereditary permutation property is testable. Electron. Notes Discret. Math. 38 (2011)
Ricardo C. Corrêa, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
A note on random k-dimensional posets. Electron. Notes Discret. Math. 37 (2011)
Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota
On an anti-Ramsey property of random graphs. Electron. Notes Discret. Math. 37 (2011)
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio
Property Testing and Parameter Testing for Permutations. SODA (2010)
Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht
Weak hypergraph regularity and linear hypergraphs. J. Comb. Theory, Ser. B 100 (2) (2010)
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz
Almost spanning subgraphs of random graphs after adversarial edge removal. Electron. Notes Discret. Math. 35 (2009)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
Kneser Colorings of Uniform Hypergraphs. Electron. Notes Discret. Math. 34 (2009)
Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
A note on permutation regularity. Electron. Notes Discret. Math. 35 (2009)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa
An Algorithmic Friedman-Pippenger Theorem on Tree Embeddings and Applications. Electron. J. Comb. 15 (1) (2008)
Jan Zich, Yoshiharu Kohayakawa, Vojtech Rödl, V. Sunderam
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness. Internet Math. 5 (3) (2008)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Martin Marciniszyn, Angelika Steger
On the Resilience of Long Cycles in Random Graphs. Electron. J. Comb. 15 (1) (2008)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
Universality of random graphs. SODA (2008)
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) (2007)
Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger
Small subsets inherit sparse epsilon-regularity. J. Comb. Theory, Ser. B 97 (1) (2007)
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) (2007)
Domingos Dellamonica Jr., Yoshiharu Kohayakawa
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing. SODA (2006)
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) (2006)
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) (2005)
Yoshiharu Kohayakawa, Miklós Simonovits, Jozef Skokan
The 3-colored Ramsey number of odd cycles. Electron. Notes Discret. Math. 19 (2005)
Mike Ferrara, Yoshiharu Kohayakawa, Vojtech Rödl
Distance Graphs on the Integers. Comb. Probab. Comput. 14 (1-2) (2005)
Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Ziviani
A Practical Minimal Perfect Hashing Method. WEA (2005)

Yoshiharu Kohayakawa.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yoshiharu Kohayakawa