Matrix sparsification for coded matrix multiplication. - Geewon Suh; Kangwook Lee 001; Changho Suh (Allerton, 2017)

(1, k)-Coloring of Graphs with Girth at Least Five on a Surface. - Ho-Jin Choi; Ilkyoo Choi; Jisu Jeong; Geewon Suh (J. Graph Theory, 2017)

Sparse Spanning k-Connected Subgraphs in Tournaments. - Dong Yeap Kang; Jaehoon Kim; Younjin Kim; Geewon Suh (SIAM J. Discret. Math., 2017)

Characterizing graphs of maximum matching width at most 2. - Jisu Jeong; Seongmin Ok; Geewon Suh (Discret. Appl. Math., 2018)

When to Use Graph Side Information in Matrix Completion. - Geewon Suh; Sangwoo Jeon; Changho Suh (ISIT, 2021)

Graph-assisted Matrix Completion in a Multi-clustered Graph Model. - Geewon Suh; Changho Suh (ISIT, 2022)

Mc2g: An Efficient Algorithm for Matrix Completion With Social and Item Similarity Graphs. - Qiaosheng Eric Zhang; Geewon Suh; Changho Suh; Vincent Y. F. Tan (IEEE Trans. Signal Process., 2022)

Enforcing Constraints in RNA Secondary Structure Predictions: A Post-Processing Framework Based on the Assignment Problem. - Geewon Suh; Gyeongjo Hwang; Seokjun Kang; Doojin Baek; Mingeun Kang (ICML, 2024)