Geewon Suh

According to our database, Geewon Suh authored at least 7 papers between 2017 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

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

Graph-assisted Matrix Completion in a Multi-clustered Graph Model.

Geewon Suh, Changho Suh

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

When to Use Graph Side Information in Matrix Completion.

Geewon Suh, Sangwoo Jeon, Changho Suh

Proceedings of the IEEE International Symposium on Information Theory, 2021

2018

Characterizing graphs of maximum matching width at most 2.

Jisu Jeong, Seongmin Ok, Geewon Suh

Discret. Appl. Math., 2018

2017

Sparse Spanning k-Connected Subgraphs in Tournaments.

Dong Yeap Kang, Jaehoon Kim, Younjin Kim, Geewon Suh

SIAM J. Discret. Math., 2017

(1, <i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface.

Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Geewon Suh

J. Graph Theory, 2017

Matrix sparsification for coded matrix multiplication.

Geewon Suh, Kangwook Lee, Changho Suh

Proceedings of the 55th Annual Allerton Conference on Communication, 2017