Advanced search
Start date
Betweenand

Yoshiharu Kohayakawa

CV Lattes GoogleMyCitations ResearcherID ORCID


Universidade de São Paulo (USP). Instituto de Matemática e Estatística (IME)  (Institutional affiliation for the last research proposal)
Birthplace: Brazil

Yoshiharu Kohayakawa in research grants and scholarships supported by FAPESP.

Research grants
Scholarships in Brazil
Scholarships abroad
FAPESP support in numbers * Updated November 16, 2019
Total / Available in English
Most frequent collaborators in research granted by FAPESP
Contact researcher

Use this Research Supported by FAPESP (BV/FAPESP) channel only to send messages referring to FAPESP-funded scientific projects.


 

 

 

 

Keywords used by the researcher
Scientific publications resulting from Research Grants and Scholarships under the grantee's responsibility (110)

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

Publications88
Citations346
Cit./Article3.9
Data from Web of Science

KOHAYAKAWA‚ Y.; KREUTER‚ B.; OSTHUS‚ D.. The length of random subsets of Boolean lattices. RANDOM STRUCTURES & ALGORITHMS, v. 16, n. 2, p. 177-194, . (96/04505-2)

DE A MOREIRA‚ C.G.T.; KOHAYAKAWA‚ Y.. Bounds for optimal coverings. DISCRETE APPLIED MATHEMATICS, v. 141, n. 1, p. 263-276, . (96/04505-2)

VAN DER HOLST‚ H.; DE PINA‚ JC. Length-bounded disjoint paths in planar graphs. DISCRETE APPLIED MATHEMATICS, v. 120, n. 1, p. 251-261, . (96/04505-2)

KOHAYAKAWA‚ Y.; RÖDL‚ V.. Regular pairs in sparse random graphs I. RANDOM STRUCTURES & ALGORITHMS, v. 22, n. 4, p. 359-434, . (96/04505-2)

KOHAYAKAWA‚ Y.; KREUTER‚ B.; STEGER‚ A.. An extremal problem for random graphs and the number of graphs with large even-girth. COMBINATORICA, v. 18, n. 1, p. 101-120, . (96/04505-2)

SOARES‚ J.; STEFANES‚ M.A.. Algorithms for maximum independent set in convex bipartite graphs. ALGORITHMICA, v. 53, n. 1, p. 35-49, . (96/04505-2)

LEE‚ O.; WAKABAYASHI‚ Y.. On the circuit cover problem for mixed graphs. COMBINATORICS PROBABILITY & COMPUTING, v. 11, n. 01, p. 43-59, . (96/04505-2)

KOHAYAKAWA‚ Y.; PRÖMEL‚ H.J.; RÖDL‚ V.. Induced ramsey numbers. COMBINATORICA, v. 18, n. 3, p. 373-404, . (96/04505-2)

KOHAYAKAWA, YOSHIHARU; ROEDL, VOJTECH; SCHACHT, MATHIAS; SZEMEREDI, ENDRE. Sparse partition universal graphs for graphs of bounded degree. ADVANCES IN MATHEMATICS, v. 226, n. 6, p. 5041-5065, . Web of Science Citations: 16. (03/09925-5)

XAVIER‚ E.C.; MIYAZAWA‚ F.K.. The class constrained bin packing problem with applications to video-on-demand. THEORETICAL COMPUTER SCIENCE, v. 393, n. 1, p. 240-259, . (03/09925-5)

CAVALCANTE‚ V.F.; DE SOUZA‚ C.C.; LUCENA‚ A.. A Relax-and-Cut algorithm for the set partitioning problem. Computers & Operations Research, v. 35, n. 6, p. 1963-1981, . (03/09925-5)

KIM‚ S.J.; NAKPRASIT‚ K.; PELSMAJER‚ M.J.; SKOKAN‚ J.. Transversal numbers of translates of a convex body. DISCRETE MATHEMATICS, v. 306, n. 18, p. 2166-2173, . (03/09925-5)

LEMOS‚ M.; MELO‚ TRB. Non-separating cocircuits in matroids. DISCRETE APPLIED MATHEMATICS, v. 156, n. 7, p. 1019-1024, . (03/09925-5)

MIYAZAWA‚ FK; WAKABAYASHI‚ Y.. Two-and three-dimensional parametric packing. Computers & Operations Research, v. 34, n. 9, p. 2589-2603, . (03/09925-5)

RODRIGUES‚ E.M.; SAGOT‚ M.F.; WAKABAYASHI‚ Y.. The maximum agreement forest problem: Approximation algorithms and computational experiments. THEORETICAL COMPUTER SCIENCE, v. 374, n. 1, p. 91-110, . (03/09925-5)

XAVIER‚ EC; MIYAZAWA‚ FK. Approximation schemes for knapsack problems with shelf divisions. THEORETICAL COMPUTER SCIENCE, v. 352, n. 1, p. 71-84, . (03/09925-5)

ADI‚ S.S.; BRAGA‚ M.D.V.; FERNANDES‚ C.G.; FERREIRA‚ C.E.; MARTINEZ‚ F.V.; SAGOT‚ M.F.; STEFANES‚ M.A.; TJANDRAATMADJA‚ C.; WAKABAYASHI‚ Y.. Repetition-free longest common subsequence. DISCRETE APPLIED MATHEMATICS, v. 158, n. 12, p. 1315-1324, . (03/09925-5)

XAVIER‚ EC; MIYAZAWA‚ F.K.. A one-dimensional bin packing problem with shelf divisions. DISCRETE APPLIED MATHEMATICS, v. 156, n. 7, p. 1083-1096, . (03/09925-5)

ALON‚ N.; KOHAYAKAWA‚ Y.; MAUDUIT‚ C.; MOREIRA‚ CG; RODL‚ V.. Measures of pseudorandomness for finite sequences: minimal values. COMBINATORICS PROBABILITY & COMPUTING, v. 15, n. 1/2, p. 1, . (03/09925-5)

MARCINISZYN‚ M.; SKOKAN‚ J.; SPÖHEL‚ R.; STEGER‚ A.. Asymmetric Ramsey properties of random graphs involving cliques. RANDOM STRUCTURES & ALGORITHMS, v. 34, n. 4, p. 419-453, . (03/09925-5)

ALLEN, PETER; BOETTCHER, JULIA; GRIFFITHS, SIMON; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT. The chromatic thresholds of graphs. ADVANCES IN MATHEMATICS, v. 235, p. 261-295, . Web of Science Citations: 12. (09/17831-7, 10/09555-7)

AIGNER-HOREV, ELAD; HAN, HIEP; SCHACHT, MATHIAS. Extremal results for odd cycles in sparse pseudorandom graphs. COMBINATORICA, v. 34, n. 4, p. 379-406, . Web of Science Citations: 0. (10/16526-3)

ALLEN, PETER; BOETTCHER, JULIA; PERSON, YURY. An improved error term for minimum H-decompositions of graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 108, p. 92-101, . Web of Science Citations: 7. (09/17831-7, 10/09555-7)

BOETTCHER, JULIA; TARAZ, ANUSCH; WUERFL, ANDREAS. Perfect Graphs of Fixed Density: Counting and Homogeneous Sets. COMBINATORICS PROBABILITY & COMPUTING, v. 21, n. 5, p. 661-682, . Web of Science Citations: 1. (09/17831-7)

ALLEN, PETER; KEEVASH, PETER; SUDAKOV, BENNY; VERSTRAETE, JACQUES. Turan numbers of bipartite graphs plus an odd cycle. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 106, p. 134-162, . Web of Science Citations: 10. (10/09555-7)

KOHAYAKAWA, Y.; KONSTADINIDIS, P. B.; MOTA, G. O.. On an anti-Ramsey threshold for random graphs. EUROPEAN JOURNAL OF COMBINATORICS, v. 40, p. 26-41, . Web of Science Citations: 3. (13/03447-6, 12/00036-2, 13/07699-0, 09/06294-0)

BOETTCHER, JULIA; FONIOK, JAN. Ramsey Properties of Permutations. ELECTRONIC JOURNAL OF COMBINATORICS, v. 20, n. 1, . Web of Science Citations: 7. (09/17831-7)

HAN, JIE; ZHAO, YI. Forbidding Hamilton cycles in uniform hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 143, p. 107-115, . Web of Science Citations: 1. (14/18641-5, 15/07869-8)

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing highly edge-connected graphs into paths of any given length. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 122, p. 508-542, . Web of Science Citations: 7. (13/03447-6, 13/11431-2, 11/08033-0, 14/01460-8, 13/20733-2)

HAN, JIE; KOHAYAKAWA, YOSHIHARU. THE MAXIMUM SIZE OF A NON-TRIVIAL INTERSECTING UNIFORM FAMILY THAT IS NOT A SUBFAMILY OF THE HILTON-MILNER FAMILY. Proceedings of the American Mathematical Society, v. 145, n. 1, p. 73-87, . Web of Science Citations: 5. (13/03447-6, 15/07869-8, 14/18641-5, 13/07699-0)

FERNANDES, CRISTINA G.; STEIN, MAYA. Geodesic stability for memoryless binary long-lived consensus. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, v. 81, n. 7, p. 1210-1220, . Web of Science Citations: 0.

BOTLER, F.; MOTA, G. O.; WAKABAYASHI, Y.. Decompositions of triangle-free 5-regular graphs into paths of length five. DISCRETE MATHEMATICS, v. 338, n. 11, p. 1845-1855, . Web of Science Citations: 4. (13/11431-2, 13/20733-2, 11/08033-0, 14/01460-8)

ALLEN, PETER; BOETTCHER, JULIA; HLADKY, JAN; PIGUET, DIANA. A Density Corradi-Hajnal Theorem. CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, v. 67, n. 4, p. 721-758, . Web of Science Citations: 4. (09/17831-7, 10/09555-7)

BLINOVSKY, V. M.. Minimum Number of Edges in a Hypergraph Guaranteeing a Perfect Fractional Matching and the MMS Conjecture. PROBLEMS OF INFORMATION TRANSMISSION, v. 50, n. 4, p. 340-349, . Web of Science Citations: 2. (12/13341-8, 13/07699-0)

BLINOVSKY, VLADIMIR; GREENHILL, CATHERINE. Asymptotic enumeration of sparse uniform hypergraphs with given degrees. EUROPEAN JOURNAL OF COMBINATORICS, v. 51, p. 287-296, . Web of Science Citations: 3. (12/13341-8, 13/07699-0)

AIGNER-HOREV, ELAD; HAN, HIEP. Polynomial configurations in subsets of random and pseudo-random sets. JOURNAL OF NUMBER THEORY, v. 165, p. 363-381, . Web of Science Citations: 0. (13/11353-1, 10/16526-3)

ALLEN, P.; KOHAYAKAWA, Y.; MOTA, G. O.; PARENTE, R. F.. On the number of orientations of random graphs with no directed cycles of a given length. ELECTRONIC JOURNAL OF COMBINATORICS, v. 21, n. 1, . Web of Science Citations: 0. (13/07699-0, 10/09555-7, 12/00036-2, 13/03447-6, 13/20733-2, 09/06294-0)

BOETTCHER, JULIA; KOHAYAKAWA, YOSHIHARU; PROCACCI, ALDO. Properly coloured copies and rainbow copies of large graphs with small maximum degree. RANDOM STRUCTURES & ALGORITHMS, v. 40, n. 4, p. 425-436, . Web of Science Citations: 15. (09/17831-7)

BENJAMINI, ITAI; HOPPEN, CARLOS; OFEK, ERAN; PRATAT, PAWET; WORMALD, NICK. Geodesics and Almost Geodesic Cycles in Random Regular Graphs. JOURNAL OF GRAPH THEORY, v. 66, n. 2, p. 115-136, . Web of Science Citations: 4.

KOHAYAKAWA, YOSHIHARU; NAGLE, BRENDAN; RODL, VOJTECH; SCHACHT, MATHIAS. Weak hypergraph regularity and linear hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 100, n. 2, p. 151-160, . Web of Science Citations: 23. (03/09925-5)

BRUHN, HENNING; STEIN, MAYA. Duality of Ends. COMBINATORICS PROBABILITY & COMPUTING, v. 19, n. 1, p. 47-60, . Web of Science Citations: 10.

LEMOS, MANOEL; MELO, T. R. B.. Connected hyperplanes in binary matroids. Linear Algebra and its Applications, v. 432, n. 1, p. 259-274, . Web of Science Citations: 2. (03/09925-5)

CORDOVIL, RAUL; MAIA, JR., BRAULIO; LEMOS, MANOEL. The 3-connected binary matroids with circumference 6 or 7. EUROPEAN JOURNAL OF COMBINATORICS, v. 30, n. 8, p. 1810-1824, . Web of Science Citations: 4. (03/09925-5)

CORDOVIL, RAUL; LEMOS, MANOEL. The 3-connected matroids with circumference 6. DISCRETE MATHEMATICS, v. 310, n. 8, p. 1354-1365, . Web of Science Citations: 0. (03/09925-5)

ALLEN, PETER; BOTTCHER, JULIA; HAN, HIEP; KOHAYAKAWA, YOSHIHARU; PERSON, YURY. POWERS OF HAMILTON CYCLES IN PSEUDORANDOM GRAPHS. COMBINATORICA, v. 37, n. 4, p. 573-616, . Web of Science Citations: 2. (13/03447-6, 09/17831-7, 10/09555-7, 13/07699-0, 10/16526-3)

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing regular graphs with prescribed girth into paths of given length. EUROPEAN JOURNAL OF COMBINATORICS, v. 66, p. 28-36, . Web of Science Citations: 0. (13/03447-6, 13/11431-2, 11/08033-0, 14/01460-8, 13/20733-2)

MOTA, G. O.; SARKOEZY, G. N.; SCHACHT, M.; TARAZ, A.. Ramsey numbers for bipartite graphs with small bandwidth. EUROPEAN JOURNAL OF COMBINATORICS, v. 48, n. SI, p. 165-176, . Web of Science Citations: 4. (12/00036-2, 09/06294-0)

ALLEN, PETER; BOTTCHER, JULIA; COOLEY, OLIVER; MYCROFT, RICHARD. Tight cycles and regular slices in dense hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 149, p. 30-100, . Web of Science Citations: 3. (09/17831-7, 10/09555-7)

HAN, JIE; ZANG, CHUANYUN; ZHAO, YI. Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 149, p. 115-147, . Web of Science Citations: 3. (13/03447-6, 14/18641-5, 15/07869-8)

HAN, JIE. DECISION PROBLEM FOR PERFECT MATCHINGS IN DENSE k-UNIFORM HYPERGRAPHS. Transactions of the American Mathematical Society, v. 369, n. 7, p. 5197-5218, . Web of Science Citations: 3. (15/07869-8, 14/18641-5)

COREGLIANO, LEONARDO NAGAMI; RAZBOROV, ALEXANDER A.. On the Density of Transitive Tournaments. JOURNAL OF GRAPH THEORY, v. 85, n. 1, p. 12-21, . Web of Science Citations: 4. (13/23720-9, 14/15134-5)

GAUY, MARCELO M.; HAN, HIEP; OLIVEIRA, IGOR C.. Erdos-Ko-Rado for Random Hypergraphs: Asymptotics and Stability. COMBINATORICS PROBABILITY & COMPUTING, v. 26, n. 3, p. 406-422, . Web of Science Citations: 0. (13/11353-1, 10/16526-3)

KAWARABAYASHI, KEN-ICHI; LEE, ORLANDO; REED, BRUCE; WOLLAN, PAUL. A weaker version of Lovasz' path removal conjecture. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 98, n. 5, p. 972-979, . Web of Science Citations: 7. (03/09925-5)

HAN, JIE. On vertex-disjoint paths in regular graphs. ELECTRONIC JOURNAL OF COMBINATORICS, v. 25, n. 2, . Web of Science Citations: 0. (13/03447-6, 14/18641-5)

HAN, JIE; KIM, JAEHOON. Two-regular subgraphs of odd-uniform hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 128, p. 175-191, . Web of Science Citations: 0. (13/03447-6, 15/07869-8, 14/18641-5)

HAN, JIE; KOHAYAKAWA, YOSHIHARU. On hypergraphs without loose cycles. DISCRETE MATHEMATICS, v. 341, n. 4, p. 946-949, . Web of Science Citations: 1. (13/03447-6, 14/18641-5, 13/07699-0)

GAO, WEI; HAN, JIE. Minimum Codegree Threshold for C-6(3)-Factors in 3-Uniform Hypergraphs. COMBINATORICS PROBABILITY & COMPUTING, v. 26, n. 4, p. 536-559, . Web of Science Citations: 2. (13/03447-6, 14/18641-5, 15/07869-8)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; TARAZ, ANUSCH. Counting results for sparse pseudorandom hypergraphs I. EUROPEAN JOURNAL OF COMBINATORICS, v. 65, p. 276-287, . Web of Science Citations: 1. (13/03447-6, 13/11431-2, 13/07699-0, 09/06294-0, 13/20733-2)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; TARAZ, ANUSCH. Counting results for sparse pseudorandom hypergraphs II. EUROPEAN JOURNAL OF COMBINATORICS, v. 65, p. 288-301, . Web of Science Citations: 1. (13/03447-6, 13/11431-2, 13/07699-0, 13/20733-2)

FRANKL, PETER; HAN, JIE; HUANG, HAO; ZHAO, YI. A degree version of the Hilton-Milner theorem. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 155, p. 493-502, . Web of Science Citations: 3. (13/03447-6, 14/18641-5)

COREGLIANO, LEONARDO NAGAMI. Quasi-carousel tournaments. JOURNAL OF GRAPH THEORY, v. 88, n. 1, p. 192-210, . Web of Science Citations: 1. (13/23720-9, 14/15134-5)

BOTLER, F.; MOTA, G. O.; OSHIRO, M. T. I.; WAKABAYASHI, Y.. Decomposing highly connected graphs into paths of length five. DISCRETE APPLIED MATHEMATICS, v. 245, n. SI, p. 128-138, . Web of Science Citations: 1. (13/03447-6, 13/11431-2, 11/08033-0, 14/01460-8, 13/20733-2)

HAN, JIE. ON PERFECT MATCHINGS AND TILINGS IN UNIFORM HYPERGRAPHS. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 32, n. 2, p. 919-932, . Web of Science Citations: 0. (13/03447-6, 14/18641-5)

ALLEN, PETER; BOTTCHER, JULIA; GRIFFITHS, SIMON; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT. Chromatic Thresholds in Dense Random Graphs. RANDOM STRUCTURES & ALGORITHMS, v. 51, n. 2, p. 185-214, . Web of Science Citations: 0. (13/03447-6, 09/17831-7, 10/09555-7, 13/07699-0)

ALLEN, PETER; BOTTCHER, JULIA; GRIFFITHS, SIMON; KOHAYAKAWA, YOSHIHARU; MORRIS, ROBERT. Chromatic Thresholds in Sparse Random Graphs. RANDOM STRUCTURES & ALGORITHMS, v. 51, n. 2, p. 215-236, . Web of Science Citations: 1. (13/03447-6, 09/17831-7, 10/09555-7, 13/07699-0)

BEDENKNECHT, WIEBKE; HAN, JIE; KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME O.. Powers of tight Hamilton cycles in randomly perturbed hypergraphs. RANDOM STRUCTURES & ALGORITHMS, v. 55, n. 4, . Web of Science Citations: 2. (13/03447-6, 18/04876-1, 14/18641-5)

DELLAMONICA, JR., DOMINGOS; KOHAYAKAWA, YOSHIHARU; ROEDL, VOJTECH; RUCINSKI, ANDRZEJ. UNIVERSALITY OF RANDOM GRAPHS. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 26, n. 1, p. 353-374, . Web of Science Citations: 8. (03/09925-5)

LEMOS, MANOEL; REID, TALMAGE JAMES; WU, HAIDONG. On the circuit-spectrum of binary matroids. EUROPEAN JOURNAL OF COMBINATORICS, v. 32, n. 6, SI, p. 861-869, . Web of Science Citations: 1. (03/09925-5)

HOPPEN, CARLOS; KOHAYAKAWA, YOSHIHARU; MOREIRA, CARLOS GUSTAVO; SAMPAIO, RUDINI MENEZES. Testing permutation properties through subpermutations. THEORETICAL COMPUTER SCIENCE, v. 412, n. 29, p. 3555-3567, . Web of Science Citations: 12.

HOPPEN, CARLOS; KOHAYAKAWA, YOSHIHARU; MOREIRA, CARLOS GUSTAVO; RATH, BALAZS; SAMPAIOE, RUDINI MENEZES. Limits of permutation sequences. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 103, n. 1, p. 93-113, . Web of Science Citations: 26.

ALLEN, PETER; BOETTCHER, JULIA; HLADKY, JAN; PIGUET, DIANA. Turannical hypergraphs. RANDOM STRUCTURES & ALGORITHMS, v. 42, n. 1, p. 29-58, . Web of Science Citations: 2. (09/17831-7, 10/09555-7)

HOPPEN, CARLOS; KOHAYAKAWA, YOSHIHARU; SAMPAIO, RUDINI M.. A note on permutation regularity. DISCRETE APPLIED MATHEMATICS, v. 160, n. 18, SI, p. 2716-2727, . Web of Science Citations: 3.

PIGUET, DIANA; JAKOBINE STEIN, MAYA. An approximate version of the Loebl-Komlos-Sos conjecture. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 102, n. 1, p. 102-125, . Web of Science Citations: 10.

CORREA, JOSE R.; FERNANDES, CRISTINA G.; WAKABAYASHI, YOSHIKO. Approximating a class of combinatorial problems with rational objective function. MATHEMATICAL PROGRAMMING, v. 124, n. 1-2, p. 255-269, . Web of Science Citations: 7. (03/09925-5)

LEMOS, MANOEL; REID, TALMAGE JAMES; WU, HAIDONG. Characterizing 3-Connected Planar Graphs and Graphic Matroids. JOURNAL OF GRAPH THEORY, v. 64, n. 2, p. 165-174, . Web of Science Citations: 4. (03/09925-5)

FERNANDES, CRISTINA G.; LEE, ORLANDO; WAKABAYASHI, YOSHIKO. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. DISCRETE APPLIED MATHEMATICS, v. 157, n. 2, p. 272-279, . Web of Science Citations: 7. (03/09925-5)

DONADELLI, JAIR; KOHAYAKAWA, YOSHIHARU. A density result for random sparse oriented graphs and its relation to a conjecture of Woodall. ELECTRONIC JOURNAL OF COMBINATORICS, v. 9, . Web of Science Citations: 1. (96/04505-2)

KOHAYAKAWA, Y.; KONSTADINIDIS, P. B.; MOTA, G. O.. On an anti-Ramsey threshold for sparse graphs with one triangle. JOURNAL OF GRAPH THEORY, v. 87, n. 2, p. 176-187, . Web of Science Citations: 1. (13/03447-6, 13/11431-2, 13/07699-0, 09/06294-0, 13/20733-2)

COUTINHO, GABRIEL; GODSIL, CHRIS. PERFECT STATE TRANSFER IS POLY-TIME. QUANTUM INFORMATION & COMPUTATION, v. 17, n. 5-6, p. 495-502, . Web of Science Citations: 1. (13/03447-6, 15/16339-2)

BASTOS, JOSEFRAN DE OLIVEIRA; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; SCHNITZER, JAKOB; SCHULENBURG, FABIAN. LOOSE HAMILTONIAN CYCLES FORCED BY LARGE (k-2)-DEGREE-APPROXIMATE VERSION. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 31, n. 4, p. 2328-2347, . Web of Science Citations: 4. (13/11431-2, 13/20733-2)

BASTOS, JOSEFRAN DE OLIVEIRA; COREGLIANO, LEONARDO NAGAMI. Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, v. 18, n. 2, . Web of Science Citations: 0. (13/23720-9)

HAN, JIE. PERFECT MATCHINGS IN HYPERGRAPHS AND THE ERDOS MATCHING CONJECTURE. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 30, n. 3, p. 1351-1357, . Web of Science Citations: 8. (14/18641-5, 15/07869-8)

HAN, JIE. NEAR PERFECT MATCHINGS IN k-UNIFORM HYPERGRAPHS II. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 30, n. 3, p. 1453-1469, . Web of Science Citations: 1. (14/18641-5, 15/07869-8)

HAN, JIE; LO, ALLAN; TREGLOWN, ANDREW; ZHAO, YI. Exact Minimum Codegree Threshold for K-4(-)-Factors. COMBINATORICS PROBABILITY & COMPUTING, v. 26, n. 6, p. 856-885, . Web of Science Citations: 1. (13/03447-6, 14/18641-5)

CHEN, GUANTAO; HAN, JIE; SUIL, O.; SHAN, SONGLING; TSUCHIYA, SHOICHI. Forbidden Pairs and the Existence of a Spanning Halin Subgraph. GRAPHS AND COMBINATORICS, v. 33, n. 5, p. 1321-1345, . Web of Science Citations: 1. (14/18641-5, 15/07869-8)

ALLEN, PETER; BOETTCHER, JULIA; HLADKY, JAN; PIGUET, DIANA. An extension of Turan's Theorem, uniqueness and stability. ELECTRONIC JOURNAL OF COMBINATORICS, v. 21, n. 4, . Web of Science Citations: 1. (09/17831-7, 10/09555-7)

BLINOVSKY, V. M.. Proof of Two Conjectures on Correlation Inequalities for One Class of Monotone Functions. PROBLEMS OF INFORMATION TRANSMISSION, v. 50, n. 3, p. 280-284, . Web of Science Citations: 0. (12/13341-8, 13/07699-0)

BLINOVSKY, V. M.. Fractional matchings in hypergraphs. PROBLEMS OF INFORMATION TRANSMISSION, v. 51, n. 1, p. 25-30, . Web of Science Citations: 0. (12/13341-8, 13/07699-0)

ALLEN, PETER; BOETTCHER, JULIA; KOHAYAKAWA, YOSHIHARU; PERSON, YURY. Tight Hamilton Cycles in Random Hypergraphs. RANDOM STRUCTURES & ALGORITHMS, v. 46, n. 3, p. 446-465, . Web of Science Citations: 7. (13/03447-6, 09/17831-7, 10/09555-7, 13/07699-0)

BUSS, ENNO; HAN, HIEP; SCHACHT, MATHIAS. Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 103, n. 6, p. 658-678, . Web of Science Citations: 16. (10/16526-3)

LEMOS, MANOEL. A characterization of graphic matroids using non-separating cocircuits. ADVANCES IN APPLIED MATHEMATICS, v. 42, n. 1, p. 75-81, . Web of Science Citations: 5. (03/09925-5)

HOPPEN, CARLOS; KOHAYAKAWA, YOSHIHARU; LEFMANN, HANNO. Hypergraphs with many Kneser colorings. EUROPEAN JOURNAL OF COMBINATORICS, v. 33, n. 5, SI, p. 816-843, . Web of Science Citations: 9.

BENEVIDES, FABRICIO SIQUEIRA; SKOKAN, JOZEF. The 3-colored Ramsey number of even cycles. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 99, n. 4, p. 690-708, . Web of Science Citations: 22. (03/09925-5)

CHATAIGNER, F.; MANIC, G.; WAKABAYASHI, Y.; YUSTER, R.. Approximation algorithms and hardness results for the clique packing problem. DISCRETE APPLIED MATHEMATICS, v. 157, n. 7, p. 1396-1406, . Web of Science Citations: 4. (03/09925-5)

CORDOVIL, RAUL; MAIA, JR., BRAULIO; LEMOSE, MANOEL. Removing circuits in 3-connected binary matroids. DISCRETE MATHEMATICS, v. 309, n. 4, p. 655-665, . Web of Science Citations: 1. (03/09925-5)

KOHAYAKAWA‚ Y.; NAGLE‚ B.; RÖDL‚ V.. Hereditary properties of triple systems. COMBINATORICS PROBABILITY & COMPUTING, v. 12, n. 02, p. 155-189, . (96/04505-2)

MARTINEZ‚ F.V.; DE PINA‚ J.C.; SOARES‚ J.. Algorithms for terminal Steiner trees. THEORETICAL COMPUTER SCIENCE, v. 389, n. 1, p. 133-142, . (03/09925-5)

HAXELL‚ P.; LUCZAK‚ T.; PENG‚ Y.; RÖDL‚ V.; RUCINSKI‚ A.; SKOKAN‚ J.. The Ramsey number for 3-uniform tight hypergraph cycles. COMBINATORICS PROBABILITY & COMPUTING, v. 18, n. 1-2, p. 165-203, . (03/09925-5)

CLEMENS, DENNIS; JENSSEN, MATTHEW; KOHAYAKAWA, YOSHIHARU; MORRISON, NATASHA; MOTA, GUILHERME OLIVEIRA; REDING, DAMIAN; ROBERTS, BARNABY. The size-Ramsey number of powers of paths. JOURNAL OF GRAPH THEORY, v. 91, n. 3, p. 290-299, . Web of Science Citations: 0. (13/11431-2, 18/04876-1, 13/03447-6)

COUTINHO, GABRIEL; PORTUGAL, RENATO. Discretization of continuous-time quantum walks via the staggered model with Hamiltonians. NATURAL COMPUTING, v. 18, n. 2, 1, SI, p. 403-409, . Web of Science Citations: 1. (13/03447-6, 15/16339-2)

COUTINHO, GABRIEL; GODSIL, CHRIS; GUO, KRYSTAL; ZHAN, HANMENG. A New Perspective on the Average Mixing Matrix. ELECTRONIC JOURNAL OF COMBINATORICS, v. 25, n. 4, . Web of Science Citations: 1. (15/16339-2)

KOHAYAKAWA, YOSHIHARU; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS. Monochromatic trees in random graphs. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, v. 166, n. 1, p. 191-208, . Web of Science Citations: 2. (13/11431-2, 13/20733-2, 13/03447-6, 13/07699-0)

BASTOS, JOSEFRAN DE OLIVEIRA; MOTA, GUILHERME OLIVEIRA; SCHACHT, MATHIAS; SCHNITZER, JAKOB; SCHULENBURG, FABIAN. LOOSE HAMILTONIAN CYCLES FORCED BY LARGE (k-2)-DEGREE - SHARP VERSION. CONTRIBUTIONS TO DISCRETE MATHEMATICS, v. 13, n. 2, p. 88-100, . Web of Science Citations: 0. (13/11431-2, 18/04876-1, 13/20733-2)

COREGLIANO, LEONARDO N.; PARENTE, ROBERTO F.; SATO, CRISTIANE M.. On the maximum density of fixed strongly connected subtournaments. ELECTRONIC JOURNAL OF COMBINATORICS, v. 26, n. 1, . Web of Science Citations: 0. (13/23720-9)

BEDENKNECHT, WIEBKE; MOTA, GUILHERME OLIVEIRA; REIHER, CHRISTIAN; SCHACHT, MATHIAS. On the local density problem for graphs of given odd-girth. JOURNAL OF GRAPH THEORY, v. 90, n. 2, p. 137-149, . Web of Science Citations: 0. (13/03447-6, 13/11431-2, 13/20733-2)

BERGER, S.; KOHAYAKAWA, Y.; MAESAKA, G. S.; MARTINS, T.; MENDONCA, W.; MOTA, G. O.; PARCZYK, O.. THE SIZE-RAMSEY NUMBER OF POWERS OF BOUNDED DEGREE TREES. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, v. 88, n. 3, p. 451-456, . Web of Science Citations: 0. (13/03447-6, 18/04876-1)

HAN, J.; KOHAYAKAWA, Y.; SALES, M. T.; STAGNI, H.. ON SOME EXTREMAL RESULTS FOR ORDER TYPES. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, v. 88, n. 3, p. 779-785, . Web of Science Citations: 0. (13/03447-6, 17/02263-0, 15/15986-4)

KOHAYAKAWA, Y.; MENDONCA, W.; MOTA, G.; SCHUELKE, B.. COVERING 3-COLOURED RANDOM GRAPHS WITH MONOCHROMATIC TREES. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, v. 88, n. 3, p. 871-875, . Web of Science Citations: 0. (13/03447-6, 18/04876-1)

HAN, JIE; KOHAYAKAWA, YOSHIHARU; MORRIS, PATRICK; PERSON, YURY. Clique-factors in sparse pseudorandom graphs. EUROPEAN JOURNAL OF COMBINATORICS, v. 82, . Web of Science Citations: 0. (13/03447-6, 14/18641-5)

CARMO, RENATO; FEDER, TOMAS; KOHAYAKAWA, YOSHIHARU; LABER, EDUARDO; MOTWANI, RAJEEV; O'CALLAGHAN, LIADAN; PANIGRAHY, RINA; THOMAS, DILYS. Querying Priced Information in Databases: The Conjunctive Case. ACM TRANSACTIONS ON ALGORITHMS, v. 3, n. 1, SI, . Web of Science Citations: 0. (03/09925-5)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

COREGLIANO, Leonardo Nagami. Álgebras de flags e torneios. 2015. Dissertação (Mestrado) - Instituto de Matemática e Estatística. Universidade de São Paulo (USP). São Paulo. (13/23720-9)

MOTA, Guilherme Oliveira. Dois resultados em combinatória contemporânea. 2013. Tese (Doutorado) – Instituto de Matemática e Estatística. Universidade de São Paulo (USP). São Paulo. (09/06294-0)

JUNIOR, Domingos Dellamonica. Extração de aleatoriedade a partir de fontes defeituosas. 2007. Dissertação (Mestrado) - Instituto de Matemática e Estatística. Universidade de São Paulo (USP). São Paulo. (04/11501-1)

BENEVIDES, Fabricio Siqueira. Teoria de Ramsey para circuitos e caminhos. 2007. Dissertação (Mestrado) - Instituto de Matemática e Estatística. Universidade de São Paulo (USP). São Paulo. (05/52494-0)

SATO, Cristiane Maria. Homomorfismos de grafos. 2008. Dissertação (Mestrado) - Instituto de Matemática e Estatística. Universidade de São Paulo (USP). São Paulo. (06/58578-4)

Distribution map of accesses to this page
Click here to view the access summary to this page.
Please report errors in researcher information by writing to: cdi@fapesp.br.
X

Report errors in this page


Error details: