# Jisu Jeong (정지수)

## Moved to Samsung SDS. See Brightics.

Ph.D. Candidate

Department of Mathematical Sciences, KAIST

Office : E6-1 (Natural science building) #3417, KAIST

Email : jjisu [at] kaist [dot] ac [dot] kr, jisujeong89 [at] gmail [dot] com

### Research interests

- Combinatorics, Graph theory, Graph algorithm, Width parameters, Fixed parameter tractable algorithm, Graph coloring

### Submitted Papers

- Online Ramsey theory for a triangle on F-free graphs (with Hojin Choi, Ilkyoo Choi, Sang-il Oum), submitted, 2016.
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (with Robert Brignall, Hojin Choi, Sang-il Oum), submitted, 2016.

### Papers

- Maximum matching width: new characterizations and a fast algorithm for dominating set (with Sigve Hortemo Sæther, Jan Arne Telle), Discrete Appl. Math., accepted, 2017.
- The "art of trellis decoding" is fixed-parameter tractable (with EunJung Kim, Sang-il Oum), IEEE Trans. Inform. Theory, accepted, 2017.
- Characterizing graphs of maximum matching width at most 2 (with Seongmin Ok, Geewon Suh), Discrete Appl. Math., accepted, 2017.
- (1,k)-coloring of graphs with girth at least 5 on a surface (with Hojin Choi, Ilkyoo Choi, Geewon Suh), J. Graph Theory, 84 (April 2017), pp. 521-535.
- Excluded vertex-minors for graphs of linear rank-width at most k (with O-joung Kwon, Sang-il Oum), European J. Combin., 41 (October 2014), pp. 242-257.

### Refereed Conference Papers

- Constructive algorithm for path-width of matroids (with Eunjung Kim, Sang-il Oum), In the the Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA2016, Arlington, VA, 2016). pp. 1695-1704, 2016.
- Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set (with Sigve Hortemo Sæther, Jan Arne Telle), In the Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Dagstuhl, Germany, Leibniz International Proceedings in Informatics (LIPIcs), Vol. 43, pp. 212-223, 2015.
- Excluded vertex-minors for graphs of linear rank-width at most k (with O-joung Kwon, Sang-il Oum), In the Proceedings of the 30th Symposium on Theoretical Aspects of Computer Science (STACS’13), Kiel, Germany, Feb. 27-Mar. 02, 2013, Leibniz International Proceedings in Informatics (LIPIcs), Vol. 20, pp. 221-232, 2013.

### Thesis

- Master, On the minimum rank of a graph, KAIST, 2013 (pdf, slide).
- Ph.D., Parameterized algorithms for width parameters, KAIST, 2018 (pdf, slide).

### Talks

- Nov. 11, 2016: Fall Workshop on Algorithms and Computation, Seoul, Korea.
- Invitation to fixed-parameter algorithms (slide)
- Jun. 9, 2016: SIAM conference on Discrete Mathematics, Atlanta, USA.
- Constructive algorithm for path-width of matroids (slide)
- Apr. 30, 2016: KPPY Combinatorics Workshop, Pusan, Korea.
- Invitation to Fixed-Parameter Algorithms
- Jan. 12, 2016: ACM-SIAM Symposium on Discrete Algorithms, Arlington, USA.
- Constructive algorithm for path-width of matroids (slide)
- Oct. 24, 2015: 2015 KMS Annual Meeting, Seoul, Korea.
- Graph width-parameters and algorithms (slide)
- Oct. 15, 2015: GROW 2015: 7th workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France.
- On maximum matching width (slide)
- Aug. 27, 2015: 1st Korean Workshop on Graph Theory, Daejeon, Korea.
- Maximum Matching Width: new characterizations and a fast algorithm for dominating set (slide)
- Jul. 16, 2015: 2015 Combinatorics Workshop, Daejeon, Korea.
- Constructive algorithm for path-width of matroids (slide)
- Dec. 19, 2014: 6th KIAS Combinatorics Workshop, Seoul, Korea.
- The discharging method (slide)
- Oct. 31, 2014: 2014 Combinatorics Workshop, Suwon, Korea.
- Planar graphs with girth at least 5 are (1,10)-colorable (slide)
- Oct. 25, 2013: 2013 KMS Annual Meeting, Seoul, Korea.
- Minimum rank of a random graph over the binary field (slide)

### Research Visits

- Hong Kong Polytechnic University (Prof. Cao), Hong Kong, China (Jul. 26, 2016 -- Aug. 16, 2016)
- LAMSADE-CNRS (Dr. Kim), Paris, France (Jan. 17, 2016 -- Jan. 29, 2016)
- University of Bergen (Prof. Telle), Bergen, Norway (Jun. 05, 2015 -- Jun. 15, 2015)
- Utrecht University (Prof. Bodlaender), Utrecht, Netherlands (Feb. 15, 2014 -- Mar. 7, 2014)

### Education

**Korea Advanced Institute of Science and Technology (KAIST)**, Daejeon, Korea- Ph.D. Student in Mathematical Sciences (Advisor :
**Prof. Sang-il Oum**), Sep. 2013 -- (Feb. 2018) - M.S. in Mathematical Sciences (Advisor :
**Prof. Sang-il Oum**), Sep. 2011 -- Sep. 2013 - B.S. in Mathematical Sciences, Feb. 2007 -- Sep. 2011

### Teaching Assistant

- Combinatorics
- Introduction to Graph Theory
- Discrete Mathematics
- Applied Mathematical Analysis (Advanced Engineering Mathematics)
- Introduction to Linear Algebra
- Calculus