Yoshiharu Kohayakawa

154 papers A* 8B 11C 6Journal 124Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Canonical Ramsey Theorem with List Constraints in Random (Hyper-)graphs. Electron. J. Comb. José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota
2024	J	`jnl`	Directed graphs with lower orientation Ramsey thresholds. RAIRO Oper. Res. Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Tássio Naia
2023	C	`conf`	A canonical Ramsey theorem with list constraints in random graphs. LAGOS José D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota
2023	J	`jnl`	Guest Editorial: Special Issue on Theoretical Informatics. Algorithmica Yoshiharu Kohayakawa, Flávio Keidi Miyazawa
2023	C	`conf`	Resilience for loose Hamilton cycles. LAGOS José D. Alvarado, Yoshiharu Kohayakawa, Richard Lang, Guilherme Oliveira Mota, Henrique Stagni
2023	J	`jnl`	The anti-Ramsey threshold of complete graphs. Discret. Math. Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Olaf Parczyk, Jakob Schnitzer
2023	J	`jnl`	The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$. J. Graph Theory Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa
2023	J	`jnl`	The mod k $k$ chromatic index of random graphs. J. Graph Theory Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa
2022	J	`jnl`	Factors in randomly perturbed hypergraphs. Random Struct. Algorithms Yulin Chang, Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Guilherme Oliveira Mota
2021	J	`jnl`	A tight lower bound for the online bounded space hypercube bin packing problem. CoRR Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
2021	J	`jnl`	A tight lower bound for the online bounded space hypercube bin packing problem. Discret. Math. Theor. Comput. Sci. Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
2021	C	`conf`	Constrained colourings of random graphs. LAGOS Maurício Collares Neto, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Guilherme Oliveira Mota
2021	J	`jnl`	Covering 3-Edge-Colored Random Graphs with Monochromatic Trees. SIAM J. Discret. Math. Yoshiharu Kohayakawa, Walner Mendonça, Guilherme Oliveira Mota, Bjarne Schülke
2021	J	`jnl`	Finding any given 2-factor in sparse pseudorandom graphs efficiently. J. Graph Theory Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person
2021	C	`conf`	Hitting times for arc-disjoint arborescences in random digraph processes. LAGOS Maurício Collares Neto, Yoshiharu Kohayakawa, Taísa Martins, Roberto Parente, Victor Souza
2021	J	`jnl`	Near-perfect clique-factors in sparse pseudorandom graphs. Comb. Probab. Comput. Jie Han, Yoshiharu Kohayakawa, Yury Person
2021	J	`jnl`	On strong Sidon sets of integers. J. Comb. Theory A Yoshiharu Kohayakawa, Sang June Lee, Carlos Gustavo Moreira, Vojtech Rödl
2021	J	`jnl`	On the Query Complexity of Estimating the Distance to Hereditary Graph Properties. SIAM J. Discret. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2021	J	`jnl`	Orientation Ramsey Thresholds for Cycles and Cliques. SIAM J. Discret. Math. Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Yoshiharu Kohayakawa, Tássio Naia
2020	J	`jnl`	A perspective on theoretical computer science in Latin America. Commun. ACM Marcos Kiwi, Yoshiharu Kohayakawa, Sergio Rajsbaum, Francisco Rodríguez-Henríquez, Jayme Luiz Szwarcfiter, Alfredo Viola
2020	J	`jnl`	Counting restricted orientations of random graphs. Random Struct. Algorithms Maurício Collares Neto, Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota
2020	J	`jnl`	Estimating parameters associated with monotone properties. Comb. Probab. Comput. Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2020	B	`ed.`	LATIN 2020: Theoretical Informatics - 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings LATIN Yoshiharu Kohayakawa, Flávio Keidi Miyazawa
2020	J	`jnl`	The multicolour size-Ramsey number of powers of paths. J. Comb. Theory B Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Barnaby Roberts
2019	J	`jnl`	Clique-factors in sparse pseudorandom graphs. Eur. J. Comb. Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person
2019	A*	`conf`	Extremal and probabilistic results for order types. SODA Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni
2019	J	`jnl`	Finding any given 2-factor in sparse pseudorandom graphs efficiently. CoRR Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person
2019	J	`jnl`	On the query complexity of estimating the distance to hereditary graph properties. CoRR Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2019	J	`jnl`	Powers of tight Hamilton cycles in randomly perturbed hypergraphs. Random Struct. Algorithms Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa, Guilherme Oliveira Mota
2019	C	`conf`	Preface. LAGOS Gabriel Coutinho, Yoshiharu Kohayakawa, Vinícius Fernandes dos Santos, Sebastián Urrutia
2019	C	`ed.`	Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2019, Belo Horizonte, Brazil, June 2-7, 2019 LAGOS Gabriel Coutinho, Yoshiharu Kohayakawa, Vinícius Fernandes dos Santos, Sebastián Urrutia
2019	J	`jnl`	The size Ramsey number of short subdivisions of bounded degree graphs. Random Struct. Algorithms Yoshiharu Kohayakawa, Troy Retter, Vojtech Rödl
2019	J	`jnl`	The size?Ramsey number of powers of paths. J. Graph Theory Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa, Natasha Morrison, Guilherme Oliveira Mota, Damian Reding, Barnaby Roberts
2019	J	`jnl`	Universality for bounded degree spanning trees in randomly perturbed graphs. Random Struct. Algorithms Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk, Yury Person
2018	B	`conf`	A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game. LATIN Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
2018	J	`jnl`	Infinite Sidon Sets Contained in Sparse Random Sets of Integers. SIAM J. Discret. Math. Yoshiharu Kohayakawa, Sangjune Lee, Carlos Gustavo Moreira, Vojtech Rödl
2018	J	`jnl`	Near-perfect clique-factors in sparse pseudorandom graphs. Electron. Notes Discret. Math. Jie Han, Yoshiharu Kohayakawa, Yury Person
2018	J	`jnl`	On an anti-Ramsey threshold for sparse graphs with one triangle. J. Graph Theory Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota
2018	J	`jnl`	On hypergraphs without loose cycles. Discret. Math. Jie Han, Yoshiharu Kohayakawa
2018	B	`conf`	Property Testing for Point Sets on the Plane. LATIN Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni
2018	J	`jnl`	Triangle-Free Subgraphs of Random Graphs. Comb. Probab. Comput. Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Barnaby Roberts
2017	J	`jnl`	A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. CoRR Yoshiharu Kohayakawa, Flavio Keidi Miyazawa, Yoshiko Wakabayashi
2017	J	`jnl`	Chromatic thresholds in dense random graphs. Random Struct. Algorithms Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris
2017	J	`jnl`	Chromatic thresholds in sparse random graphs. Random Struct. Algorithms Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris
2017	J	`jnl`	Counting results for sparse pseudorandom hypergraphs I. Eur. J. Comb. Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
2017	J	`jnl`	Counting results for sparse pseudorandom hypergraphs II. Eur. J. Comb. Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
2017	J	`jnl`	Densities in large permutations and parameter testing. Eur. J. Comb. Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu
2017	J	`jnl`	Estimating parameters associated with monotone properties. CoRR Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2017	J	`jnl`	Estimating the distance to a hereditary graph property. Electron. Notes Discret. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2017	J	`jnl`	Monochromatic trees in random graphs. Electron. Notes Discret. Math. Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht
2017	J	`jnl`	On the number of r-transitive orientations of G(n, p). Electron. Notes Discret. Math. Maurício Collares Neto, Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota
2017	J	`jnl`	Powers of Hamilton cycles in pseudorandom graphs. Comb. Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
2016	J	`jnl`	A note on supersaturated set systems. Eur. J. Comb. Peter Frankl, Yoshiharu Kohayakawa, Vojtech Rödl
2016	—	`conf`	Estimating Parameters Associated with Monotone Properties. APPROX-RANDOM Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2016	J	`jnl`	On the Number of Comb. Probab. Comput. Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
2016	J	`jnl`	The number of B J. Comb. Theory A Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
2015	J	`jnl`	A counting lemma for sparse pseudorandom hypergraphs. Electron. Notes Discret. Math. Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch Taraz
2015	J	`jnl`	An Extension of the Blow-up Lemma to Arrangeable Graphs. SIAM J. Discret. Math. Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz, Andreas Würfl
2015	J	`jnl`	An improved upper bound on the density of universal random graphs. Random Struct. Algorithms Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
2015	J	`jnl`	Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. Discret. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2015	J	`jnl`	The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. Random Struct. Algorithms Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij
2015	J	`jnl`	Tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Yury Person
2015	J	`jnl`	Triangle-Free Subgraphs of Random Graphs. Electron. Notes Discret. Math. Peter Allen, Julia Böttcher, Barnaby Roberts, Yoshiharu Kohayakawa
2014	J	`jnl`	Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. Eur. J. Comb. Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2014	J	`jnl`	Large permutations and parameter testing. CoRR Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu
2014	J	`jnl`	On an anti-Ramsey threshold for random graphs. Eur. J. Comb. Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota
2014	J	`jnl`	On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length. Electron. J. Comb. Peter Allen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Roberto F. Parente
2014	B	`conf`	Powers of Hamilton Cycles in Pseudorandom Graphs. LATIN Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
2014	J	`jnl`	Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Struct. Algorithms Yoshiharu Kohayakawa, Mathias Schacht, Reto Spöhel
2013	J	`jnl`	Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal. Comb. Probab. Comput. Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz
2013	—	`conf`	An Unstable Hypergraph Problem with a Unique Optimal Solution. Information Theory, Combinatorics, and Search Theory Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2013	J	`jnl`	An approximate blow-up lemma for sparse pseudorandom graphs. Electron. Notes Discret. Math. Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
2013	J	`jnl`	Limits of permutation sequences. J. Comb. Theory B Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Balázs Ráth, Rudini Menezes Sampaio
2012	J	`jnl`	A note on permutation regularity. Discret. Appl. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
2012	B	`conf`	An Improved Upper Bound on the Density of Universal Random Graphs. LATIN Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
2012	J	`jnl`	Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size. Comb. Probab. Comput. Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2012	J	`jnl`	Hypergraphs with many Kneser colorings. Eur. J. Comb. Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2012	J	`jnl`	Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Struct. Algorithms Julia Böttcher, Yoshiharu Kohayakawa, Aldo Procacci
2012	J	`jnl`	Universality of Random Graphs. SIAM J. Discret. Math. Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
2011	J	`jnl`	A note on counting orientations. Electron. Notes Discret. Math. Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Roberto F. Parente
2011	J	`jnl`	A note on random k-dimensional posets. Electron. Notes Discret. Math. Ricardo C. Corrêa, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
2011	J	`jnl`	Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. Electron. Notes Discret. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2011	J	`jnl`	Every hereditary permutation property is testable. Electron. Notes Discret. Math. Antônio J. O. Bastos, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
2011	J	`jnl`	On an anti-Ramsey property of random graphs. Electron. Notes Discret. Math. Yoshiharu Kohayakawa, P. B. Konstadinidis, Guilherme Oliveira Mota
2011	J	`jnl`	Testing permutation properties through subpermutations. Theor. Comput. Sci. Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio
2011	A*	`conf`	The maximum size of a Sidon set contained in a sparse random set of integers. SODA Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl
2010	A*	`conf`	Property Testing and Parameter Testing for Permutations. SODA Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio
2010	J	`jnl`	Weak hypergraph regularity and linear hypergraphs. J. Comb. Theory B Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht
2009	J	`jnl`	A note on permutation regularity. Electron. Notes Discret. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio
2009	J	`jnl`	Almost spanning subgraphs of random graphs after adversarial edge removal. Electron. Notes Discret. Math. Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz
2009	J	`jnl`	Kneser Colorings of Uniform Hypergraphs. Electron. Notes Discret. Math. Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
2008	J	`jnl`	An Algorithmic Friedman-Pippenger Theorem on Tree Embeddings and Applications. Electron. J. Comb. Domingos Dellamonica Jr., Yoshiharu Kohayakawa
2008	J	`jnl`	JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness. Internet Math. Jan Zich, Yoshiharu Kohayakawa, Vojtech Rödl, V. Sunderam
2008	J	`jnl`	On the Resilience of Long Cycles in Random Graphs. Electron. J. Comb. Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Martin Marciniszyn, Angelika Steger
2008	A*	`conf`	Universality of random graphs. SODA Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski
2007	J	`jnl`	Querying priced information in databases: The conjunctive case. ACM Trans. Algorithms Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas
2007	J	`jnl`	Small subsets inherit sparse epsilon-regularity. J. Comb. Theory B Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger
2007	J	`jnl`	Turán's theorem for pseudo-random graphs. J. Comb. Theory A Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa A. Sissokho, Jozef Skokan
2006	A*	`conf`	An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing. SODA Domingos Dellamonica Jr., Yoshiharu Kohayakawa
2006	—	`ed.`	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 TCS Gonzalo Navarro, Leopoldo E. Bertossi, Yoshiharu Kohayakawa
2006	J	`jnl`	Measures of Pseudorandomness for Finite Sequences: Minimal Values. Comb. Probab. Comput. Noga Alon, Yoshiharu Kohayakawa, Christian Mauduit, Carlos Gustavo T. de A. Moreira, Vojtech Rödl
2005	—	`conf`	A Practical Minimal Perfect Hashing Method. WEA Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Ziviani
2005	J	`jnl`	A note on the Size-Ramsey number of long subdivisions of graphs. RAIRO Theor. Informatics Appl. Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa
2005	J	`jnl`	Distance Graphs on the Integers. Comb. Probab. Comput. Mike Ferrara, Yoshiharu Kohayakawa, Vojtech Rödl
2005	J	`jnl`	The 3-colored Ramsey number of odd cycles. Electron. Notes Discret. Math. Yoshiharu Kohayakawa, Miklós Simonovits, Jozef Skokan
2004	B	`conf`	Advances in the Regularity Method. LATIN Yoshiharu Kohayakawa
2004	J	`jnl`	Bounds for optimal coverings. Discret. Appl. Math. Carlos Gustavo T. de A. Moreira, Yoshiharu Kohayakawa
2004	J	`jnl`	Multidimensional Cube Packing. Algorithmica Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi
2004	B	`conf`	Querying Priced Information in Databases: The Conjunctive Case. LATIN Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa
2004	J	`jnl`	Searching in random partially ordered sets. Theor. Comput. Sci. Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber
2004	J	`jnl`	The Turán Theorem for Random Graphs. Comb. Probab. Comput. Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht
2003	J	`jnl`	An Optimal Algorithm for Checking Regularity. SIAM J. Comput. Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma
2003	J	`jnl`	Hereditary Properties Of Triple Systems. Comb. Probab. Comput. Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl
2003	J	`jnl`	Ramsey Games Against a One-Armed Bandit. Comb. Probab. Comput. Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali
2003	J	`jnl`	Regular pairs in sparse random graphs I. Random Struct. Algorithms Yoshiharu Kohayakawa, Vojtech Rödl
2003	J	`jnl`	Special Issue on Ramsey Theory. Comb. Probab. Comput. Béla Bollobás, Graham R. Brightwell, Yoshiharu Kohayakawa, Imre Leader, Alex D. Scott
2002	J	`jnl`	A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall. Electron. J. Comb. Jair Donadelli, Yoshiharu Kohayakawa
2002	A*	`conf`	An optimal algorithm for checking regularity (extended abstract). SODA Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma
2002	A*	`conf`	Efficient Testing of Hypergraphs. ICALP Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl
2002	J	`jnl`	Hypergraphs, Quasi-randomness, and Conditions for Regularity. J. Comb. Theory A Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan
2002	B	`conf`	Searching in Random Partially Ordered Sets. LATIN Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber
2002	J	`jnl`	The Width of Random Subsets of Boolean Lattices. J. Comb. Theory A Yoshiharu Kohayakawa, Bernd Kreuter
2001	J	`jnl`	Bounds for Optimal Coverings. Electron. Notes Discret. Math. Carlos Gustavo T. de A. Moreira, Yoshiharu Kohayakawa
2001	J	`jnl`	Multidimensional Cube Packing. Electron. Notes Discret. Math. Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Prabhakar Raghavan, Yoshiko Wakabayashi
2001	—	`conf`	Near-optimum Universal Graphs for Graphs with Bounded Degrees. RANDOM-APPROX Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
2001	J	`jnl`	Ramsey minimal graphs. J. Braz. Comput. Soc. Béla Bollobás, Jair Donadelli, Yoshiharu Kohayakawa, Richard H. Schelp
2000	B	`conf`	Algorithmic Aspects of Regularity. LATIN Yoshiharu Kohayakawa, Vojtech Rödl
2000	B	`conf`	Equivalent Conditions for Regularity (Extended Abstract). LATIN Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan
2000	B	`conf`	Finding Skew Partitions Efficiently. LATIN Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
2000	J	`jnl`	Finding Skew Partitions Efficiently. J. Algorithms Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
2000	J	`jnl`	The length of random subsets of Boolean lattices. Random Struct. Algorithms Yoshiharu Kohayakawa, Bernd Kreuter, Deryk Osthus
2000	A*	`conf`	Universality and Tolerance. FOCS Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
1998	J	`jnl`	An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth. Comb. Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger
1998	J	`jnl`	Induced Ramsey Numbers. Comb. Yoshiharu Kohayakawa, Hans Jürgen Prömel, Vojtech Rödl
1998	J	`jnl`	Packing and Covering Triangles in Tripartite Graphs. Graphs Comb. Penny E. Haxell, Yoshiharu Kohayakawa
1997	J	`jnl`	On Comb. Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl
1997	J	`jnl`	The size of the largest bipartite subgraphs. Discret. Math. Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa
1997	J	`jnl`	Threshold functions for asymmetric Ramsey properties involving cycles. Random Struct. Algorithms Yoshiharu Kohayakawa, Bernd Kreuter
1996	J	`jnl`	Partitioning by Monochromatic Trees. J. Comb. Theory, Ser. B Penny E. Haxell, Yoshiharu Kohayakawa
1996	J	`jnl`	Ramsey-type results for oriented trees. J. Graph Theory Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl
1996	J	`jnl`	Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. Comb. Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
1995	J	`jnl`	Connectivity Properties of Random Subgraphs of the Cube. Random Struct. Algorithms Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
1995	J	`jnl`	On the Anti-Ramsey Property of Ramanujan Graphs. Random Struct. Algorithms Penny E. Haxell, Yoshiharu Kohayakawa
1995	J	`jnl`	Sparse Anti-Ramsey Graphs. J. Comb. Theory B Yoshiharu Kohayakawa, Tomasz Luczak
1995	J	`jnl`	The Induced Size-Ramsey Number of Cycles. Comb. Probab. Comput. Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
1995	J	`jnl`	Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles. J. Comb. Theory B Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
1994	J	`jnl`	An Extension of the Erdös-Stone Theorem. Comb. Béla Bollobás, Yoshiharu Kohayakawa
1994	J	`jnl`	On the Diameter and Radius of Random Subgraphs of the Cube. Random Struct. Algorithms Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
1994	J	`jnl`	Percolation in High Dimensions. Eur. J. Comb. Béla Bollobás, Yoshiharu Kohayakawa
1993	J	`jnl`	Ramsey Properties of Orientations of Graphs. Random Struct. Algorithms Graham R. Brightwell, Yoshiharu Kohayakawa
1992	J	`jnl`	On small graphs with highly imperfect powers. Discret. Math. Yoshiharu Kohayakawa, Jerzy Wojciechowski
1992	J	`jnl`	The Evaluation of Random Subgraphs of the Cube. Random Struct. Algorithms Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
1991	J	`jnl`	A note on induced cycles in Kneser graphs. Comb. Yoshiharu Kohayakawa
1990	J	`jnl`	A Note on Kernels of Intersecting Families. Eur. J. Comb. Yoshiharu Kohayakawa