PDI - Resultado de Búsqueda

Hiep Han

Profesor

UNIVERSIDAD DE SANTIAGO DE CHILE

Santiago, Chile

Discrete Mathematics; Extremal Combinatorics; Algorithms and complexity; Discrete Probability

Computer Science, HUMBOLDT-UNIVERSITÄT ZU BERLIN. Alemania, 2010
Computer Science, HUMBOLDT UNIVERSITAT ZU BERLIN. Alemania, 2006

Postdoc Full Time

UNIVERSIDAD DE CHILE

Chile

2015 - 2016
Profesor Full Time

UNIVERSIDAD DE SANTIAGO DE CHILE

Chile

2017 - At present
Associated Researcher Full Time

PONTIFICIA UNIVERSIDAD CATOLICA DE VALPARAISO

Chile

2016 - 2017
Postdoc Full Time

UNIVERSITAT HAMBURG

Atlanta, Alemania

2010 - 2011
Postdoc Full Time

UNIVERSIDADE DE SAO PAULO

Brasil

2011 - 2015
Postdoc Full Time

EMORY UNIVERSITY

Estados Unidos

2013 - 2015

Grupo de Estudio Fondecyt Other

ANID

Chile

2020 - At present

Doctoral student: Matias Pavez-Signe, 2017-2021
Undergraduate: Gonzalo Toro, 2020-

Invited lectures, mini-courses and workshops (selected)
* Sub-plenary talk at the Somachi 2017, Talca
* Mini-course "Quasi-random graphs and regularity", III Escuela Latinamericana en Algoritmos, EPN, Quito
* Invited speaker at SIAM Conference on Discrete Mathematics, Minneapolis, 2014
* Invited speaker at Atlanta Lecture Series, 2014
* Participant of the "Ergodic Theory and Combinatorial Number Theory" workshop, Oberwolfach, 2012
* Participant of the long program "Combinatorics: Methods and Applications in Mathematics and Computer Science", IPAM, UCLA, 2009


Ramsey numbers involving graphs and hypergraphs with large girth Han, Hiep; Retter, Troy; Rodl, Vojtech; Schacht, Mathias Article COMBINATORICS PROBABILITY AND COMPUTING (2021)
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs Han, Hiep; Han, Jie; Morris, Patrick Article ACM-SIAM Symposium on Discrete Algorithms (SODA20) (2020)
Linear quasi-randomness of subsets of abelian groups and hypergraphs Aigner-Horev E.; HÃ n H. Article SCOPUS European Journal of Combinatorics (2020)
Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles Bustamante, S; Han, H; Stein, M Article ISI SCOPUS JOURNAL OF GRAPH THEORY (2019)
IMPROVED BOUND ON THE MAXIMUM NUMBER OF CLIQUE-FREE COLORINGS WITH TWO AND THREE COLORS Han, Hiep; Jimenez, Andrea Article ISI SCOPUS SIAM JOURNAL ON DISCRETE MATHEMATICS (2018)
Maximum number of sum-free colorings in finite abelian groups Hiep Han; Jimenez, Andrea Article ISI SCOPUS ISRAEL JOURNAL OF MATHEMATICS (2018)
Quasirandomness for hypergraphs Conlon, D.; Aigner-Horev, E.; Han, H.; Person, Y.; Schacht, M. Article ISI The Electronic Journal of Combinatorics (2018)
VERTEX FOLKMAN NUMBERS AND THE MINIMUM DEGREE OF MINIMAL RAMSEY GRAPHS Han, Hiep; Rodl, Vojtech; Szabo, Tibor Article ISI SCOPUS SIAM JOURNAL ON DISCRETE MATHEMATICS (2018)
Erdos-Ko-Rado for Random Hypergraphs: Asymptotics and Stability Gauy M.M.; Hàn H.; Oliveira I.C. Article ISI SCOPUS COMBINATORICS PROBABILITY & COMPUTING (2017)
POWERS OF HAMILTON CYCLES IN PSEUDORANDOM GRAPHS Allen P.; Böttcher J.; Hàn H.; Kohayakawa Y.; Person Y. Article ISI SCOPUS COMBINATORICA (2017)
Quasirandomness in hypergraphs Aigner-Horev E., Conlon D.; Hàn H., Person Y. Article Electronic Notes in Discrete Mathematics (2017)
A sharp threshold for van der Waerden's theorem in random subsets Schacht, Mathias; Person, Yury; Hàn, Hiêp; Friedgut, Ehud Article Discrete Analysis (2016)
Polynomial configurations in subsets of random and pseudo-random sets Aigner-Horev, E; Han, H Article ISI SCOPUS JOURNAL OF NUMBER THEORY (2016)
Extremal results for odd cycles in sparse pseudorandom graphs Aigner-Horev, Elad; Han, Hiep; Schacht, Mathias Article ISI COMBINATORICA (2014)
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs Buss, Enno; Han, Hiep; Schacht, Mathias Article ISI JOURNAL OF COMBINATORIAL THEORY SERIES B (2013)
Weak quasi-randomness for uniform hypergraphs Conlon, David; Hàn, Hiêp; Person, Yury; Schacht, Mathias Article Random Structures & Algorithms (2012)
Dirac-type results for loose Hamilton cycles in uniform hypergraphs Han, Hiep; Schacht, Mathias Article ISI JOURNAL OF COMBINATORIAL THEORY SERIES B (2010)
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions Alon, Noga; Coja-Oghlan, Amin; Hàn, Hiêp; Kang, Mihyun; Rödl, Vojt?ch; Schacht, Mathias Article SIAM JOURNAL ON COMPUTING (2010)
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree Hàn, Hiep; Person, Yury; Schacht, Mathias Article ISI SIAM Journal on Discrete Mathematics (2009)


Extremal Combinatorics, Random Discrete Structures and the Container Method Han, Hiep Proyecto (2019)
Núcleo Milenio Información y Coordinación en Redes FONDAP (ICM/FIC RC) Proyecto 2016-2018 Investigador(a)
Quasi-randomness and extremal combinatorics FONDECYT (11150913) Proyecto 2016-2018 Inv. Principal
Núcleo Milenio Información y Coordinación en Redes FONDAP (ICM/FIC RC) Proyecto 2015-2016 Postdoctorado
Sparse random structures PROBRAL CAPES/DAAD, Brazil/Germany (430/15) Proyecto 2015-2016 Investigador(a)
Combinatorial structures, optimization and algorithms in Computer Sciences. Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP), Brazil (2013/03447-6) Proyecto 2013-2017 Investigador(a)
Degenerate extremal problems for random discrete structures Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP), Brazil (13/11353-1) Proyecto 2013-2014 Investigador(a)
Solving combinatorial problems using optimization techniques. National Council for Scientific and Technological Development (CNPq), Brazil (477203/2012-4) Proyecto 2012-2015 Investigador(a)
Quasi-random hypergraphs and spanning subhypergraph containment Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP), Brazil (10/16526-3) Proyecto 2011-2015 Inv. Responsable

Hiep Han

Profesor

Departamento de Matemática y Ciencia de la Computación

UNIVERSIDAD DE SANTIAGO DE CHILE

Santiago, Chile

Andrea Jimenez

Assistant Professor

Universidad de Valparaíso

Valparaíso, Chile

Maya Stein

Full Professor

Department of Mathematical Engineering

Universidad de Chile

Santiago, Chile

Hiep Han

Líneas de Investigación

Educación

Computer Science, HUMBOLDT-UNIVERSITÄT ZU BERLIN. Alemania, 2010

Computer Science, HUMBOLDT UNIVERSITAT ZU BERLIN. Alemania, 2006

Experiencia Académica

Postdoc Full Time

Profesor Full Time

Associated Researcher Full Time

Postdoc Full Time

Postdoc Full Time

Postdoc Full Time

Experiencia Profesional

Grupo de Estudio Fondecyt Other

Formación de Capital Humano

Difusión y Transferencia

Article (19)

Proyecto (9)

Núcleo Milenio Información y Coordinación en Redes

Quasi-randomness and extremal combinatorics

Núcleo Milenio Información y Coordinación en Redes

Sparse random structures

Combinatorial structures, optimization and algorithms in Computer Sciences.

Degenerate extremal problems for random discrete structures

Solving combinatorial problems using optimization techniques.

Quasi-random hypergraphs and spanning subhypergraph containment