Research Interests
- Graph theory, graph structure and width parameters
- Graph algorithms related with width parameters and fixed parameter tractable algorithms
Position
- Technische Universitat Berlin, Berlin, Germany (Jul. 2016 - )
- Postdoctor in Institut fur Softwaretechnik und Theoretische Informatik
- Advisor: Stephan Kreutzer
- Hungarian Academy of Sciences, Budapest, Hungary (Jul. 2015 - Jun. 2016)
- Researcher in Institute for Computer Science and Control (MTA SZTAKI)
- Advisor: Dániel Marx
Education
- Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea (Sep. 2012 - Aug. 2015)
- Ph.D. in Mathematical Science
- National Research Scholarship by the Korea Student Aid Foundation
- Advisor: Prof. Sang-il Oum
- Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea (Sep. 2010 - Aug. 2012)
- M.S. in Mathematical Science
- National Research Scholarship by the Korea Student Aid Foundation
- Advisor: Prof. Sang-il Oum
- Hanyang University, Seoul, Korea ( - Aug. 2010)
- B.S. in Mathmatics
- National Scholarship for Science and Engineering Students (KOSAF)
Submitted Manuscripts and Preprints
- 12. An optimal algorithm for hamiltonian cycle on graphs of bounded clique-width (with Benjamin Bergougnoux and Mamadou Kanté)
- preprint 2016
- 11. Chi-boundedness of graphs without wheel vertex-minors (with Hojin Choi, Sang-il Oum, and Paul Wollan)
- preprint 2016
- 10. Scattered sets (with Sang-il Oum)
- preprint 2016
- 9. Linear rank-width of claw pivot-minor free graphs
- (with Konrad Dabrowski, Francois Dross, Jisu Jeong, Mamadou Kanté, Sang-il Oum, and Daniel Paulusma)
- preprint 2016
- 8. Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
- (with Edouard Bonnet, Nick Brettell, and
Dániel Marx)
- preprint 2016
- 7. A polynomial kernel of Distance-Hereditary Vertex Deletion (with Eun Jung Kim)
- arXiv:1610.07229 preprint 2016
- 6. A width parameter useful for chordal and co-comparability graphs (with Dong Yeup Kang, Torstein Stromme, and Jan Arne Telle)
- arXiv:1606.08087 preprint 2016 (WALCOM 2017 accepted)
- 5. A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion
(with Eduard Eiben and Robert Ganian)
- arXiv:1604:06056 preprint 2016 (MFCS 2016 accepted)
- 4. Parameterized vertex deletion problems for hereditary graph classes with a block property (with Edouard Bonnet, Nick Brettell, and
Dániel Marx)
- arXiv:1603.05945 submitted 2016 (WG 2016 accepted)
- 3. Packing and covering immersion models of planar subcubic graphs (with Archontia Giannopoulou, Jean-Florent Raymond, and
Dimitrios M. Thilikos)
- arXiv:1602.04042 submitted 2016 (WG 2016 accepted)
- 2. A polynomial kernel for Block Graph Vertex Deletion (with Eun Jung Kim)
- arXiv:1506.08477 submitted 2015 (IPEC 2015 accepted)
- 1. Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions (with Isolde Adler and Mamadou Kanté)
- arXiv:1508.04718 submitted 2015
Journal Papers
- 8. Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (with Ilkyoo Choi and Sang-il Oum)
- 7. An FPT algorithm and a polynomial kernel for Linear Rankwidth-1 Vertex Deletion (with Mamadou Kanté, Eun Jung Kim, and Christophe Paul)
- 6. Linear rank-width of distance-hereditary graphs I. A polynomial time algorithm (with Isolde Adler and Mamadou Kanté)
- 5. Characterizing width two for variants of treewidth (with Hans L. Bodlaender, Stefan Kratsch, Vincent Kreuzen, and Seongmin Ok)
- 4. Tree-depth and vertex-minors (with Pétr Hlineny, Jan Obdrzalek, and Sebastian Ordyniak)
- 3. Excluded vertex-minors for graphs of linear rank-width k (with Jisu Jeong and Sang-il Oum)
- 2. Unavoidable vertex-minors in large prime graphs (with Sang-il Oum)
- 1. Graphs of small rank-width are pivot-minors of graphs of small tree-width (with Sang-il Oum)
Thesis
- Ph.D. Thesis
- On the structural and algorithmic properties of linear rank-width [File]
- Master Thesis
- Connecting rank-width and tree-width via pivot-minors [File]
Refereed Conference Papers
- 8. A width parameter useful for chordal and co-comparability graphs (with Dong Yeup Kang, Torstein Stromme, and Jan Arne Telle)
- WALCOM 2017 accepted
- 7. A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion (with Eduard Eiben and Robert Ganian)
- MFCS 2016, DOI: 10.4230/LIPIcs.MFCS.2016.34
- 6. Packing and covering immersion models of planar subcubic graphs (with Archontia Giannopoulou, Jean-Florent Raymond, and
Dimitrios M. Thilikos)
- WG 2016, DOI: 10.1007/978-3-662-53536-3_7
- 5. Parameterized vertex deletion problems for hereditary graph classes with a block property (with Edouard Bonnet, Nick Brettell, and
Dániel Marx)
- WG 2016, DOI: 10.1007/978-3-662-53536-3_20
- 4. A polynomial kernel for Block Graph Vertex Deletion (with Eun Jung Kim)
- IPEC 2015, DOI:10.4230/LIPIcs.IPEC.2015.270
- 3. FPT algorithm and polynomial kernel for linear rank-width one vertex deletion (with Mamadou Kanté, Eun Jung Kim, and Christophe Paul)
- IPEC 2015, DOI:10.4230/LIPIcs.IPEC.2015.138
- 2. Linear rank-width of distance-hereditary graphs (with Isolde Adler and Mamadou Kanté)
- WG 2014, DOI: 10.1007/978-3-319-12340-0_4
- 1. Excluded vertex-minors for graphs of linear rank-width k (with Jisu Jeong and Sang-il Oum)
- STACS 2013, DOI: 10.4230/LIPIcs.STACS.2013.221
Research Project
- Unavoidable vertex-minors for linear rank-width at most k
- Kernel for rank-width deletion problem, general rank-width protrusion concepts, ..
- A generalization of Mader's S-path theorem and applications
- Properties of Matroid path-width
- Properties of H-pivot-minor / H-vertex-minor graphs
Grants
- RWTH Aachen University Research Fellowship Korea, Jan - Mar, 2015
- KIAS Fellowship for Seoul ICM 2014
- SIAM Student Travel Award - SIAM Conference on Discrete Mathematics, June, 2014
- Travel Grants for graduate students and young researchers - 14th Max Planck Advanced Course on the Foundations of Computer Science, Aug, 2013
Research Visitings
- Durham University, Durham, UK (27. Feb. 2017 ~ 3. Mar. 2017)
- University of Warsaw, Warsaw, Poland (11. Jan. 2017 ~ 13. Jan. 2017)
- KAIST, South Korea (20. Nov. 2016 ~ 10. Nov. 2016)
- Universite Blaise Pascal in Clermont-ferrand, France (7. Nov. 2016 ~ 12. Nov. 2016)
- University of Bergen in Bergen, Norway (22. May. 2016 ~ 28. May. 2016)
- TU Wien in Vienna, Austria (14. Mar. 2016 ~ 18. Mar. 2016)
- Masaryk University in Brno, Czech (16. Nov. 2015 ~ 20. Nov. 2015)
- MTA SZTAKI in Budapest, Hungary (22. Mar, 2015 ~ 28. Mar, 2015)
- DTU in Lyngby, Denmark (23. Feb, 2015 ~ 27. Feb, 2015)
- Bonn University, Germany (16. Feb, 2015 ~ 18. Feb, 2015)
- LIRMM in Montpellier, France (26. Jan, 2015 ~ 30. Jan, 2015)
- RWTH Aachen University in Aachen, Germany (6. Jan, 2015 ~ 31. Mar, 2015)
- Universite Blaise Pascal in Clermont-ferrand, France (7. July. 2014 ~ 22. July. 2014)
- Utrecht University in Utrecht, Netherlands (15. Feb. 2014 ~ 7. Mar. 2014)
- Universite Blaise Pascal in Clermont-ferrand, France (8. July. 2013 ~ 21. July. 2013)
- Masaryk University in Brno, Czech (19. May. 2013 ~ 24. May. 2013)
- University of Hamburg in Hamburg, Germany (13. Feb. 2013 ~ 31. Aug. 2013)
Teaching Experiences
- Teaching assistance : Introduction to Graph Theory (MAS477) , Fall 2014
- Teaching assistance : Discrete Math (MAS255) , Spring 2014
- Teaching assistance : Introduction to Graph Theory (MAS477) , Fall 2012
- Teaching assistance : Discrete Math (MAS255) , Spring 2012
- Teaching assistance : Introduction to Graph Theory (MAS477) , Fall 2011
- Teaching assistance : Discrete Math (MAS255) , Spring 2011