Effective string processing and matching for author disambiguation. - Wei-Sheng Chin; Yong Zhuang; Yu-Chin Juan; Felix Wu; Hsiao-Yu Tung; Tong Yu 001; Jui-Pin Wang; Cheng-Xia Chang; Chun-Pai Yang; Wei-Cheng Chang; Kuan-Hao Huang; Tzu-Ming Kuo; et al. (J. Mach. Learn. Res., 2014)

Combination of feature engineering and ranking models for paper-author identification in KDD cup 2013. - Chun-Liang Li; Yu-Chuan Su; Ting-Wei Lin; Cheng-Hao Tsai; Wei-Cheng Chang; Kuan-Hao Huang; Tzu-Ming Kuo; Shan-Wei Lin; Young-San Lin; Yu-Chen Lu; Chun-Pai Yang; Cheng-Xia Chang; et al. (J. Mach. Learn. Res., 2015)

On Variants of Network Flow Stability. - Young-San Lin; Thanh Nguyen 001 (WINE, 2017)

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. - Karthekeyan Chandrasekaran; Elena Grigorescu; Gabriel Istrate; Shubhang Kulkarni; Young-San Lin; Minshen Zhu (IPEC, 2020)

Market Equilibrium in Multi-tier Supply Chain Networks. - Tao Jiang; Young-San Lin; Thành Nguyen 001 (WINE, 2020)

Online Directed Spanners and Steiner Forests. - Elena Grigorescu; Young-San Lin; Kent Quanrud (APPROX-RANDOM, 2021)

The Maximum Binary Tree Problem. - Karthekeyan Chandrasekaran; Elena Grigorescu; Gabriel Istrate; Shubhang Kulkarni; Young-San Lin; Minshen Zhu (Algorithmica, 2021)

Learning-Augmented Algorithms for Online Linear and Semidefinite Programming. - Elena Grigorescu; Young-San Lin; Sandeep Silwal; Maoyuan Song; Samson Zhou (NeurIPS, 2022)

Allocation with Weak Priorities and General Constraints. - Young-San Lin; Hai Nguyen; Thành Nguyen 001; Kemal Altinkemer (Oper. Res., 2022)

Approximation Algorithms for Directed Weighted Spanners. - Elena Grigorescu; Nithish Kumar; Young-San Lin (APPROX/RANDOM, 2023)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives. - Elena Grigorescu; Young-San Lin; Maoyuan Song (CoRR, 2024)

Multicriteria Spanners - A New Tool for Network Design. - Elena Grigorescu; Nithish Kumar; Young-San Lin (CoRR, 2024)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems. - Elena Grigorescu; Young-San Lin; Maoyuan Song (AISTATS, 2025)

Directed Buy-At-Bulk Spanners. - Elena Grigorescu; Nithish Kumar; Young-San Lin (APPROX/RANDOM, 2025)

A few good choices. - Thanh Nguyen; Haoyu Song; Young-San Lin (CoRR, 2025)