# overview
Graph Theory, Combinatorics and algorithms

# educationAndTraining[].organization.label
National Taiwan University - (Taipei, Taipei, Taiwan)

# educationAndTraining[].organization.label
Georgia Institute of Technology - (Atlanta, Georgia, United States)

# educationAndTraining[].organization.label
National Taiwan University - (Taipei, Taipei, Taiwan)

# educationAndTraining[].field
Mathematics, Minor: Computer Science and Information Engineering

# publications[].label
Packing and covering immersions in 4-edge-connected graphs

# publications[].label
Partitioning H-minor free graphs into three subgraphs with no large components

# publications[].label
Size of the largest induced forest in subcubic graphs of girth at least four and five

# publications[].label
A Unified Proof of Conjectures on Cycle Lengths in Graphs

# publications[].label
Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth

# publications[].label
Deploying Robots With Two Sensors in K1, 6Free Graphs

# publications[].label
Phase transition of degeneracy in minor-closed families

# publications[].label
Roman domination on strongly chordal graphs

# publications[].label
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three

# publications[].label
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation

# publications[].label
Triangle-free graphs that do not contain an induced subdivision of K 4 are 3-colorable

# publications[].label
Excluding subdivisions of bounded degree graphs

# publications[].label
Asymptotic dimension of minor-closed families and AssouadNagata dimension of surfaces

# publications[].publisher
European Mathematical Society - EMS - Publishing House

# publications[].label
Cycle lengths and minimum degree of graphs

# publications[].label
Clustered coloring of graphs with bounded layered treewidth and bounded degree

# publications[].label
Recent Progress on Well-Quasi-ordering Graphs

# publications[].label
Minimum size of feedback vertex sets of planar graphs of girth at least five

# publications[].label
An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs

# publications[].publisher
Society for Industrial & Applied Mathematics (SIAM)

# publications[].label
Defective Coloring is Perfect for Minors

# publications[].label
Partitioning H-minor free graphs into three subgraphs with no large components

# publications[].label
Trees with strong equality between the Roman domination number and the unique response Roman domination number

# publications[].label
Upper bounds on Roman domination numbers of graphs

# publications[].publisher
Society for Industrial & Applied Mathematics (SIAM)

# publications[].label
Disjoint Paths Problem with Group-Expressable Constraints

# publications[].publisher
Association for Computing Machinery (ACM)

# publications[].label
Proper Conflict-Free Coloring of Graphs with Large Maximum Degree

# publications[].publisher
Society for Industrial & Applied Mathematics (SIAM)

# publications[].label
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation

# publications[].label
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs

# publications[].publisher
Society for Industrial & Applied Mathematics (SIAM)

# publications[].label
Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth

# publications[].label
On the Minimum EdgeDensity of 4Critical Graphs of Girth Five

# publications[].label
Proper Conflict-free Coloring of Graphs with Large Maximum Degree

# researcherOn[].label
Graph minors, topological minors, and immersions

# researcherOn[].awardedBy.label
Directorate for Mathematical & Physical Sciences - (Arlington, Virginia, United States)

# researcherOn[].label
Graph Decompositions and Their Applications

# researcherOn[].awardedBy.label
Directorate for Mathematical & Physical Sciences - (Arlington, Virginia, United States)