Geewon Suh

activity

20142020

most citedMC2G: An Efficient Algorithm for Matrix Completion with Social and Item Similarity Graphs

19 citations · 25 across the 4 of their papers we have counts for

collaborators

4 papers

cs.LG2020★ 19 cited

MC2G: An Efficient Algorithm for Matrix Completion with Social and Item Similarity Graphs

Qiaosheng Zhang, Geewon Suh, Changho Suh +1

In this paper, we design and analyze MC2G (Matrix Completion with 2 Graphs), an algorithm that performs matrix completion in the presence of social and item similarity graphs. MC2G…

math.CO2016★ 1 cited

Characterizing graphs of maximum matching width at most 2

Jisu Jeong, Seongmin Ok, Geewon Suh

The maximum matching width is a width-parameter that is defined on a branch-decomposition over the vertex set of a graph. The size of a maximum matching in the bipartite graph is u…

math.CO2016★ 3 cited

Sparse spanning $k$ -connected subgraphs in tournaments

Dong Yeap Kang, Jaehoon Kim, Younjin Kim +1

In 2009, Bang-Jensen asked whether there exists a function $g (k)$ such that every strongly $k$ -connected $n$ -vertex tournament contains a strongly $k$ -connected spanning subgraph w…

math.CO2014★ 2 cited

$(1, k)$ -coloring of graphs with girth at least $5$ on a surface

Hojin Choi, Ilkyoo Choi, Jisu Jeong +1

A graph is $(d_{1}, ..., d_{r})$ -colorable if its vertex set can be partitioned into $r$ sets $V_{1}, ..., V_{r}$ so that the maximum degree of the graph induced by $V_{i}$ is at most $d_{i}$ …

MC2G: An Efficient Algorithm for Matrix Completion with Social and Item Similarity Graphs

Characterizing graphs of maximum matching width at most 2

Sparse spanning k-connected subgraphs in tournaments

(1,k)-coloring of graphs with girth at least 5 on a surface

Sparse spanning $k$ -connected subgraphs in tournaments

$(1, k)$ -coloring of graphs with girth at least $5$ on a surface