Document

Ilkyoo Choi
Curriculum Vitae
Department of Mathematical Sciences
KAIST, 291 Daehak-ro, Yuseong-gu
Daejeon, Korea 305-701
B [email protected]
http://mathsci.kaist.ac.kr/~ilkyoo/
Research Interests
– Discrete mathematics, combinatorics, and especially graph theory.
– Coloring and list coloring of graphs, as well as variants of graph coloring.
– The probabilistic method, the discharging method.
Positions
2014–present
BK21plus Post-doctoral Researcher
Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea.
MANDATORY MILITARY SERVICE for the Korean government
Education
2010–2014
University of Illinois at Urbana–Champaign, Urbana, IL, USA.
Ph.D. in Mathematics
Thesis Advisor: Alexandr V. Kostochka
Thesis Title:“Extremal Problems on Variations of Graph Colorings”
M.S. in Applied Mathematics: Optimization and Algorithms.
2006–2010
Carnegie Mellon University, Pittsburgh, PA, USA.
M.S. in Mathematical Sciences
Thesis Advisor: Irina Gheorghiciuc
Thesis Title: “Avoiding Large Squares in Partial Words”
B.S. in Mathematical Sciences
B.S. in Computer Science
Mathematics Departmental Honor’s Program
|
College Honors
Science and Humanities Scholar Program
|
University Honors
Publications
Published
“On Choosability with Separation for Planar Graphs with Forbidden Cycles”
(with B. Lidický and D. Stolee)
Journal of Graph Theory
2015 “Planar graphs with girth at least 5 are (3, 5)-colorable”
(with A. Raspaud)
Discrete Mathematics, 338(4):661–667, 2015
to appear
Ilkyoo Choi, page 1/6
“Vertex Arboricity of Toroidal Graphs with a Forbidden Cycle”
(with H. Zhang)
Discrete Mathematics, 333:101–105, 2014
2014 “Equicovering Subgraphs of Graphs and Hypergraphs”
(with J. Kim, A. Tebbe, and D. B. West)
The Electronic Journal of Combinatorics 21(1):Paper 1.62, 17, 2014
2012 “Locating a robber on a graph via distance queries”
(with J. Carraher, M. Delcourt, L. H. Erickson, and D. B. West),
Theoretical Computer Science 463:54–61, 2012
2011 “Avoiding Large Squares in Partial Words”
(with F. Blanchet-Sadri and R. Mercaş),
Theoretical Computer Science 412(29):3752–3758, 2011
2014
Selected Preprints
accepted
submitted
submitted
submitted
in preparation
“(1, k)-coloring of graphs with girth at least 5 on a surface”
(with H. Choi, J. Jeong, and G. Suh)
“Toroidal graphs containing neither K5− nor 6-cycles are 4-choosable”
“3-coloring triangle-free planar graphs with a precolored 9-cycle”
(with J. Ekstein, P. Holub, and B. Lidický)
“The difference and ratio of the fractional matching number and the matching number of
graphs”
(with J. Kim and S. O)
“The list version of the Borodin-Kostochka Conjecture for graphs with large max degree”
(with H. Kierstead, L. Rabern, and B. Reed)
Talks and Conferences
Invited Talks
2015/01/29
2014/12/11
2014/12/06
2014/10/13
2014/03/11
2013/12/21
“Improper coloring of planar graphs”
The 13th Korea-Japan Workshop on Algebra and Combinatorics
Kyushu institute of Technology, Kitakyushu, Japan
“On Choosability with Separation of Planar Graphs with Forbidden Cycles”
CMC Discrete Math Workshop
KAIST, Daejeon, South Korea
“Improper coloring of planar graphs”
KPPY Combinatorics Workshop
Kyungpook National University, Daegu, South Korea
“Improper coloring of planar graphs”
NIMS PostDoc. Seminar
National Institute for Mathematical Sciences (NIMS), Daejeon, South Korea
“Choosability of Toroidal Graphs with Forbidden Structures”
Graph Theory Seminar
University of West Bohemia, Plzeň, Czech Republic
“3-coloring triangle-free planar graphs with a precolored 9-cycle”
The 2nd KIAS Combinatorics Workshop
Korea Institute for Advanced Study (KIAS), Seoul, South Korea
Ilkyoo Choi, page 2/6
“Toroidal graphs containing neither K5− nor 6-cycles are 4-choosable”
Discrete Mathematics Seminar
Georgia State University, Atlanta, GA, USA
2013/04/27 “The List version of the Borodin-Kostochka Conjecture for graphs with large max degree”
1090th AMS Meeting: Special Session on Graphs, Hypergraphs and Counting
Iowa State University, Ames, IA, USA
2013/03/03 “On (3, 1)-Choosability of Planar Graphs with Forbidden Cycles”
1087th AMS Meeting: Special Session on Graph Theory
University of Mississippi, Oxford, MS, USA
2013/09/09
Contributed Talks
2015/04/25
2014/11/20
2014/09/13
2014/09/12
2014/08/06
2014/07/07
2013/04/06
2013/03/05
2013/01/09
2012/12/27
2012/05/11
2012/04/12
“The difference and ratio of the fractional matching number and the matching number”
Korean Mathematical Society Spring Meeting 2015
Pusan National University, Busan, Korea
“Extending 3-colorings of a cycle to a triangle-free planar graph”
Bordeaux Graph Workshop 2014
University of Bordeaux , Talence, France
“On Choosability with Separation of Planar Graphs with Forbidden Cycles”
Hereditarnia 2014
Nový Smokovec, High Tatras, Slovakia
“3-coloring triangle-free planar graphs with a precolored 9-cycle”
23rd Workshop on Cycles and Colourings
Nový Smokovec, High Tatras, Slovakia
“Choosability of Toroidal Graphs with Forbidden Structures”
ICM2014 Satellite Conference on Extremal and Structural Graph Theory
Gyeongju, South Korea
“Choosability of Toroidal Graphs with Forbidden Structures”
Discrete Mathematics Seminar
KAIST, Daejeon, South Korea
“On Choosability with Separation of Planar Graphs with Forbidden Cycles”
MIdwest GrapH TheorY (MIGHTY LIV)
Miami University, Oxford, OH, USA
“The List version of the Borodin-Kostochka Conjecture for graphs with large max degree”
Seminar in Graph Theory and Combinatorics
University of Illinois at Urbana-Champaign, IL, USA
“The List version of the Borodin-Kostochka Conjecture for graphs with large max degree”
Discrete Math Seminar
Konkuk University, Seoul, South Korea
“The List version of the Borodin-Kostochka Conjecture for graphs with large max degree”
Discrete Math Seminar
KAIST, Daejeon, South Korea
“Equicovering Subgraphs of Graphs and Hypergraphs”
Cumberland Conference on Combinatorics, Graph Theory, and Computing
East Tennessee State University, Johnson City, TN, USA
“Equicovering Subgraphs of Graphs and Hypergraphs”
Graduate Student Combinatorics Conference
University of Illinois at Urbana-Champaign, Urbana, IL, USA
Ilkyoo Choi, page 3/6
“Avoiding Large Squares in Binary Partial Words”
Discrete Math Seminar
KAIST, Daejeon, South Korea
2011/05/14 “Avoiding Large Squares in Binary Partial Words”
Cumberland Conference on Combinatorics, Graph Theory, and Computing
University of Louisville, Louisville, KY, USA
2011/04/09 “Avoiding Large Squares in Binary Partial Words”
Graduate Student Combinatorics Conference
Penn State University, University Park, PA, USA
2010/11/30 “Avoiding Large Squares in Binary Partial Words”
Seminar in Graph Theory and Combinatorics
University of Illinois at Urbana-Champaign, Urbana, IL, USA
2011/12/22
Other Conferences Attended
2015/03/24–
25
2015/02/10–
13
2014/12/19–
20
2014/09/26–
27
2014/08/12–
21
2014/05/30–
31
2013/10/05–
06
2013/03/16–
18
2012/09/20–
22
2011/04/15–
16
2010/11/05–
07
Combinatorial Optimization at Work
National Institute for Mathematical Sciences (NIMS), Daejeon, South Korea
Algebraic Combinatorics School
Korea Institute for Advanced Study (KIAS), Seoul, South Korea
The 6th KIAS Combinatorics Workshop
Korea Institute for Advanced Study (KIAS), Seoul, South Korea
The 5th KIAS Combinatorics Workshop
Korea Institute for Advanced Study (KIAS), Seoul, South Korea
International Congress of Mathematicians (ICM)
Seoul, South Korea
The 4th KIAS Combinatorics Workshop
Korea Institute for Advanced Study (KIAS), Seoul, South Korea
1092th AMS Meeting: Special Session on Extremal Graph Theory
University of Louisville, Louisville, KY, USA
Extremal Combinatorics at Illinois 2 (EXCILL2)
University of Illinois at Urbana-Champaign, Urbana, IL, USA
MIdwest GrapH TheorY (MIGHTY LIII)
Iowa State University, Ames, IA, USA
MIdwest GrapH TheorY (MIGHTY LI)
Indiana-Purdue University, Fort Wayne, IN, USA
1064th AMS Meeting: Special Session on Graphs and Hypergraphs
University of Notre Dame, Notre Dame, IN, USA
Invited Visits, Workshops, and Research Experience
2015/08
2015/07
2014/03
2013/09
Sum12
Sum12
Sum11
Iowa State University, Ames, IA, USA
University of Illinois at Urbana–Champaign, Urbana, IL, USA Republic
University of West Bohemia, Plzeň, Czech Republic
Georgia State University, Atlanta, GA, USA
Second Montreal Spring School in Graph Theory, McGill University, Montréal, QC, Canada
Séminaire de Mathématiques Supérieures, Université de Montréal, Montréal, QC, Canada
Combinatorics, Research Experience for Graduate Students (REGS), Urbana, IL, USA
Ilkyoo Choi, page 4/6
Sum09
Algorithmic Combinatorics on Partial Words, Research Experience for Undergraduates
(REU), Greensboro, NC, USA
Awards and Honors
Fellowships
KIAS Fellowship for ICM 2014, Korea Institute for Advanced Study (KIAS).
S14 Gene H. Golub Fund, University of Illinois at Urbana–Champaign.
Sum14
Research Assistantships
Prof. Alexandr V. Kostochka
Sum11 Research Experience for Graduate Students (REGS), Prof. Douglas B. West
Sum11 NetMath, Debora Woods
Sum13, F12
Departmental Travel Grant
Sum12
University of Illinois at Urbana-Champaign
Honors
S11
Listed as “outstanding” (top 10%) on “List of Teachers Rated Excellent”
Teaching Experience
F14–S17
NOT ALLOWED to teach by the Korea Military Manpower Administration
Primary Instructor
F13
UIUC Math 181, A Mathematical World
Blended Format Course Instructor
S12–S13
UIUC Math 124, Finite Mathematics
Student Led Course Instructor
F08–S10
CMU 98-099, How to Solve a Cube, and More!
Online Teaching Assistant
netMath 348, Fundamental Mathematics-ACP
Sum12 netMath 402, Non Euclidean Geometry
Sum12 netMath 403, Euclidean Geometry
Sum12
Teaching Assistant
UIUC Math 220, Calculus
S11 UIUC Math 231, Calculus II: top 10% on “List of Teachers Rated Excellent”
F09 CMU 21-127, Concepts of Mathematics
F11
Grader
UIUC Math 285, Introduction to Differential Equations
F10 UIUC Math 225, Introductory Matrix Theory
F10 UIUC Math 410, Linear Algebra and Financial Applications
S08 CMU 21-301, Combinatorics
Sum13
Ilkyoo Choi, page 5/6
Services and Activities
Referee: 8 submissions, 6 journals: European Journal of Combinatorics, Discrete Mathematics, Ars. Combinatoria, ORDER, Journal of Korean Mathematical Society , International Journal of Computer Mathematics
2014– Reviewer: Mathematical Reviews
2010–
Illinois Geometry Lab (IGL)
Team Leader: “Creative Blocking I” and “Creative Blocking II”
S12 Team Leader: “Geometry of Optimal Riemann Sums”
F12–S13
International Hospitality Committee (IHC)
Sum11
Instructor: Teaching English conversation classes for non-native speakers
Carnegie Mellon Admissions Council
2013–
Interviewer: Interviewing Carnegie Mellon undergraduate applicants for admission
World Cube Association (WCA)
Board Member: Governing Rubik’s Cube competitions around the world (65+ countries)
2011– Delegate of WCA: Organizing/delegating Rubik’s Cube competitions in Korea and USA
2013–
Languages
English
Fluent Korean
Fluent
References
Alexandr V. Kostochka: University of Illinois at Urbana–Champaign, Urbana, IL, USA
Douglas B. West: University of Illinois at Urbana–Champaign, Urbana, IL, USA
Henry A. Kierstead: Arizona State University, Tempe, AZ, USA
Teaching Alison Ahlgren: University of Illinois at Urbana–Champaign, Urbana, IL, USA
Ph.D. Advisor
Professional Experience
Internship
Sum08
Intern, Search Intelligence Team, Search Back-End, eBay, Inc., San Jose, CA, USA.
Research Assistant
Mathematica Programmer, NetMath.
S08 CMU Usable Privacy and Security Laboratory (CUPS Lab), Pittsburgh, PA, USA
F07 Human-Computer Interaction Institution, Carnegie Mellon University, Pittsburgh, PA, USA
F10–S11
Ilkyoo Choi, page 6/6