| What changes can large-scale language models bring? intensive study on hyperclova: Billions-scale korean generative pretrained transformers B Kim, HS Kim, SW Lee, G Lee, D Kwak, DH Jeon, S Park, S Kim, S Kim, ... arXiv preprint arXiv:2109.04650, 2021 | 58 | 2021 |
| Excluded vertex-minors for graphs of linear rank-width at most k J Jeong, O Kwon, S Oum European Journal of Combinatorics 41, 242-257, 2014 | 25 | 2014 |
| Constructive algorithm for path-width of matroids J Jeong, EJ Kim, S Oum Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 20 | 2016 |
| Metropolis-hastings data augmentation for graph neural networks H Park, S Lee, S Kim, J Park, J Jeong, KM Kim, JW Ha, HJ Kim Advances in Neural Information Processing Systems 34, 19010-19020, 2021 | 16 | 2021 |
| Finding branch-decompositions of matroids, hypergraphs, and more J Jeong, EJ Kim, S Oum SIAM Journal on Discrete Mathematics 35 (4), 2544-2617, 2021 | 15 | 2021 |
| One4all user representation for recommender systems in e-commerce K Shin, H Kwak, KM Kim, M Kim, YJ Park, J Jeong, S Jung arXiv preprint arXiv:2106.00573, 2021 | 14 | 2021 |
| (1, k)‐Coloring of Graphs with Girth at Least Five on a Surface H Choi, I Choi, J Jeong, G Suh Journal of Graph Theory 84 (4), 521-535, 2017 | 14* | 2017 |
| (1, k)‐Coloring of Graphs with Girth at Least Five on a Surface H Choi, I Choi, J Jeong, G Suh Journal of Graph Theory 84 (4), 521-535, 2017 | 12 | 2017 |
| The “art of trellis decoding” is fixed-parameter tractable J Jeong, EJ Kim, S Oum IEEE Transactions on Information Theory 63 (11), 7178-7205, 2017 | 10 | 2017 |
| Maximum matching width: new characterizations and a fast algorithm for dominating set J Jeong, SH Sæther, JA Telle arXiv preprint arXiv:1507.02384, 2015 | 10 | 2015 |
| Scaling law for recommendation models: Towards general-purpose user representations K Shin, H Kwak, SY Kim, MN Ramstrom, J Jeong, JW Ha, KM Kim arXiv preprint arXiv:2111.11294, 2021 | 9 | 2021 |
| Computing small pivot-minors KK Dabrowski, F Dross, J Jeong, MM Kanté, O Kwon, S Oum, D Paulusma Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018 | 8 | 2018 |
| Maximum matching width: New characterizations and a fast algorithm for dominating set J Jeong, SH Sæther, JA Telle Discrete Applied Mathematics 248, 114-124, 2018 | 7 | 2018 |
| Characterizing graphs of maximum matching width at most 2 J Jeong, S Ok, G Suh Discrete Applied Mathematics 248, 102-113, 2018 | 4 | 2018 |
| div2vec: Diversity-emphasized node embedding J Jeong, JM Yun, H Keam, YJ Park, Z Park, J Cho arXiv preprint arXiv:2009.09588, 2020 | 3 | 2020 |
| Global-local item embedding for temporal set prediction S Jung, YJ Park, J Jeong, KM Kim, H Kim, M Kim, H Kwak Proceedings of the 15th ACM Conference on Recommender Systems, 674-679, 2021 | 2 | 2021 |
| Learning Augmentation for GNNs With Consistency Regularization H Park, S Lee, D Hwang, J Jeong, KM Kim, JW Ha, HJ Kim IEEE Access 9, 127961-127972, 2021 | 2 | 2021 |
| Tree pivot-minors and linear rank-width KK Dabrowski, F Dross, J Jeong, MM Kanté, O Kwon, S Oum, D Paulusma Acta Mathematica Universitatis Comenianae 88 (3), 577-583, 2019 | 2 | 2019 |
| Computing the maximum matching width is NP-hard K Ahn, J Jeong arXiv preprint arXiv:1710.05117, 2017 | 2 | 2017 |
| Recognizing Small Pivot-Minors KK Dabrowski, F Dross, J Jeong, M Kanté, O Kwon, S Oum, D Paulusma 42nd Conference on Very Important Topics (CVIT 2016), 23, 0 | 2 | |
