Yoshiharu Kohayakawa

According to our database1, Yoshiharu Kohayakawa authored at least 112 papers between 1990 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Extremal and probabilistic results for order types.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Infinite Sidon Sets Contained in Sparse Random Sets of Integers.
SIAM J. Discrete Math., 2018

On an anti-Ramsey threshold for sparse graphs with one triangle.
Journal of Graph Theory, 2018

Near-perfect clique-factors in sparse pseudorandom graphs.
Electronic Notes in Discrete Mathematics, 2018

On hypergraphs without loose cycles.
Discrete Mathematics, 2018

Triangle-Free Subgraphs of Random Graphs.
Combinatorics, Probability & Computing, 2018

A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Property Testing for Point Sets on the Plane.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Chromatic thresholds in sparse random graphs.
Random Struct. Algorithms, 2017

Chromatic thresholds in dense random graphs.
Random Struct. Algorithms, 2017

On the number of r-transitive orientations of G(n, p).
Electronic Notes in Discrete Mathematics, 2017

Monochromatic trees in random graphs.
Electronic Notes in Discrete Mathematics, 2017

Estimating the distance to a hereditary graph property.
Electronic Notes in Discrete Mathematics, 2017

Counting results for sparse pseudorandom hypergraphs II.
Eur. J. Comb., 2017

Counting results for sparse pseudorandom hypergraphs I.
Eur. J. Comb., 2017

Densities in large permutations and parameter testing.
Eur. J. Comb., 2017

2016
The number of B3-sets of a given cardinality.
J. Comb. Theory, Ser. A, 2016

A note on supersaturated set systems.
Eur. J. Comb., 2016

On the Number of Bh -Sets.
Combinatorics, Probability & Computing, 2016

Estimating Parameters Associated with Monotone Properties.
Proceedings of the Approximation, 2016

2015
An Extension of the Blow-up Lemma to Arrangeable Graphs.
SIAM J. Discrete Math., 2015

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers.
Random Struct. Algorithms, 2015

Tight Hamilton cycles in random hypergraphs.
Random Struct. Algorithms, 2015

A counting lemma for sparse pseudorandom hypergraphs.
Electronic Notes in Discrete Mathematics, 2015

Triangle-Free Subgraphs of Random Graphs.
Electronic Notes in Discrete Mathematics, 2015

Edge-colorings of uniform hypergraphs avoiding monochromatic matchings.
Discrete Mathematics, 2015

2014
Upper bounds on probability thresholds for asymmetric Ramsey properties.
Random Struct. Algorithms, 2014

On an anti-Ramsey threshold for random graphs.
Eur. J. Comb., 2014

Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number.
Eur. J. Comb., 2014

On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length.
Electr. J. Comb., 2014

Powers of Hamilton Cycles in Pseudorandom Graphs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
Limits of permutation sequences.
J. Comb. Theory, Ser. B, 2013

An approximate blow-up lemma for sparse pseudorandom graphs.
Electronic Notes in Discrete Mathematics, 2013

Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal.
Combinatorics, Probability & Computing, 2013

An Unstable Hypergraph Problem with a Unique Optimal Solution.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012
Properly coloured copies and rainbow copies of large graphs with small maximum degree.
Random Struct. Algorithms, 2012

Hypergraphs with many Kneser colorings.
Eur. J. Comb., 2012

A note on permutation regularity.
Discrete Applied Mathematics, 2012

Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size.
Combinatorics, Probability & Computing, 2012

An Improved Upper Bound on the Density of Universal Random Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
Testing permutation properties through subpermutations.
Theor. Comput. Sci., 2011

A note on counting orientations.
Electronic Notes in Discrete Mathematics, 2011

On an anti-Ramsey property of random graphs.
Electronic Notes in Discrete Mathematics, 2011

Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number.
Electronic Notes in Discrete Mathematics, 2011

A note on random k-dimensional posets.
Electronic Notes in Discrete Mathematics, 2011

Every hereditary permutation property is testable.
Electronic Notes in Discrete Mathematics, 2011

The maximum size of a Sidon set contained in a sparse random set of integers.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Weak hypergraph regularity and linear hypergraphs.
J. Comb. Theory, Ser. B, 2010

Property Testing and Parameter Testing for Permutations.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
A note on permutation regularity.
Electronic Notes in Discrete Mathematics, 2009

Kneser Colorings of Uniform Hypergraphs.
Electronic Notes in Discrete Mathematics, 2009

Almost spanning subgraphs of random graphs after adversarial edge removal.
Electronic Notes in Discrete Mathematics, 2009

2008
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness.
Internet Mathematics, 2008

On the Resilience of Long Cycles in Random Graphs.
Electr. J. Comb., 2008

An Algorithmic Friedman-Pippenger Theorem on Tree Embeddings and Applications.
Electr. J. Comb., 2008

Universality of random graphs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Querying priced information in databases: The conjunctive case.
ACM Trans. Algorithms, 2007

Turán's theorem for pseudo-random graphs.
J. Comb. Theory, Ser. A, 2007

Small subsets inherit sparse epsilon-regularity.
J. Comb. Theory, Ser. B, 2007

2006
Measures of Pseudorandomness for Finite Sequences: Minimal Values.
Combinatorics, Probability & Computing, 2006

An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
A note on the Size-Ramsey number of long subdivisions of graphs.
ITA, 2005

The 3-colored Ramsey number of odd cycles.
Electronic Notes in Discrete Mathematics, 2005

Distance Graphs on the Integers.
Combinatorics, Probability & Computing, 2005

A Practical Minimal Perfect Hashing Method.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2004
Bounds for optimal coverings.
Discrete Applied Mathematics, 2004

The Turán Theorem for Random Graphs.
Combinatorics, Probability & Computing, 2004

Multidimensional Cube Packing.
Algorithmica, 2004

Querying Priced Information in Databases: The Conjunctive Case.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Advances in the Regularity Method.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
An Optimal Algorithm for Checking Regularity.
SIAM J. Comput., 2003

Regular pairs in sparse random graphs I.
Random Struct. Algorithms, 2003

Hereditary Properties Of Triple Systems.
Combinatorics, Probability & Computing, 2003

Ramsey Games Against a One-Armed Bandit.
Combinatorics, Probability & Computing, 2003

Special Issue on Ramsey Theory.
Combinatorics, Probability & Computing, 2003

2002
Hypergraphs, Quasi-randomness, and Conditions for Regularity.
J. Comb. Theory, Ser. A, 2002

The Width of Random Subsets of Boolean Lattices.
J. Comb. Theory, Ser. A, 2002

A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall.
Electr. J. Comb., 2002

An optimal algorithm for checking regularity (extended abstract).
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Searching in Random Partially Ordered Sets.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Efficient Testing of Hypergraphs.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Ramsey minimal graphs.
J. Braz. Comp. Soc., 2001

Bounds for Optimal Coverings.
Electronic Notes in Discrete Mathematics, 2001

Multidimensional Cube Packing.
Electronic Notes in Discrete Mathematics, 2001

Near-optimum Universal Graphs for Graphs with Bounded Degrees.
Proceedings of the Approximation, 2001

2000
The length of random subsets of Boolean lattices.
Random Struct. Algorithms, 2000

Equivalent Conditions for Regularity (Extended Abstract).
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Algorithmic Aspects of Regularity.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Finding Skew Partitions Efficiently.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Universality and Tolerance.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1998
Packing and Covering Triangles in Tripartite Graphs.
Graphs and Combinatorics, 1998

Induced Ramsey Numbers.
Combinatorica, 1998

An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth.
Combinatorica, 1998

1997
Threshold functions for asymmetric Ramsey properties involving cycles.
Random Struct. Algorithms, 1997

The size of the largest bipartite subgraphs.
Discrete Mathematics, 1997

On K4-Free Subgraphs of Random Graphs.
Combinatorica, 1997

1996
Ramsey-type results for oriented trees.
Journal of Graph Theory, 1996

Partitioning by Monochromatic Trees.
J. Comb. Theory, Ser. B, 1996

Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles.
Combinatorica, 1996

1995
On the Anti-Ramsey Property of Ramanujan Graphs.
Random Struct. Algorithms, 1995

Connectivity Properties of Random Subgraphs of the Cube.
Random Struct. Algorithms, 1995

Sparse Anti-Ramsey Graphs.
J. Comb. Theory, Ser. B, 1995

Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles.
J. Comb. Theory, Ser. B, 1995

The Induced Size-Ramsey Number of Cycles.
Combinatorics, Probability & Computing, 1995

1994
On the Diameter and Radius of Random Subgraphs of the Cube.
Random Struct. Algorithms, 1994

Percolation in High Dimensions.
Eur. J. Comb., 1994

An Extension of the Erdös-Stone Theorem.
Combinatorica, 1994

1993
Ramsey Properties of Orientations of Graphs.
Random Struct. Algorithms, 1993

1992
The Evaluation of Random Subgraphs of the Cube.
Random Struct. Algorithms, 1992

On small graphs with highly imperfect powers.
Discrete Mathematics, 1992

1991
A note on induced cycles in Kneser graphs.
Combinatorica, 1991

1990
A Note on Kernels of Intersecting Families.
Eur. J. Comb., 1990


  Loading...