default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoung-San Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Elena Grigorescu, Nithish Kumar, Young-San Lin:
Directed Buy-at-Bulk Spanners. CoRR abs/2404.05172 (2024)- [i10]Elena Grigorescu, Young-San Lin, Maoyuan Song:
A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives. CoRR abs/2406.03574 (2024) - [i9]Elena Grigorescu, Young-San Lin, Maoyuan Song:
Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems. CoRR abs/2411.08332 (2024) - [i8]Elena Grigorescu, Nithish Kumar Kumar, Young-San Lin:
Multicriteria Spanners - A New Tool for Network Design. CoRR abs/2412.05526 (2024) - 2023
- [c10]Elena Grigorescu, Nithish Kumar, Young-San Lin:
Approximation Algorithms for Directed Weighted Spanners. APPROX/RANDOM 2023: 8:1-8:23 - [i7]Elena Grigorescu, Nithish Kumar, Young-San Lin:
Approximation Algorithms for Directed Weighted Spanners. CoRR abs/2307.02774 (2023) - 2022
- [j4]Young-San Lin, Hai Nguyen, Thành Nguyen
, Kemal Altinkemer:
Allocation with Weak Priorities and General Constraints. Oper. Res. 70(5): 2804-2819 (2022) - [c9]Elena Grigorescu, Young-San Lin, Sandeep Silwal, Maoyuan Song, Samson Zhou:
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming. NeurIPS 2022 - [i6]Elena Grigorescu, Young-San Lin, Sandeep Silwal, Maoyuan Song, Samson Zhou:
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming. CoRR abs/2209.10614 (2022) - 2021
- [j3]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
The Maximum Binary Tree Problem. Algorithmica 83(8): 2427-2468 (2021) - [c8]Elena Grigorescu, Young-San Lin, Kent Quanrud:
Online Directed Spanners and Steiner Forests. APPROX-RANDOM 2021: 5:1-5:25 - [c7]Young-San Lin, Hai Nguyen, Thành Nguyen, Kemal Altinkemer:
Allocation with Weak Priorities and General Constraints. EC 2021: 690-691 - [i5]Elena Grigorescu, Young-San Lin, Kent Quanrud:
Online Directed Spanners and Steiner Forests. CoRR abs/2103.04543 (2021) - [i4]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. CoRR abs/2110.00495 (2021) - 2020
- [c6]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
The Maximum Binary Tree Problem. ESA 2020: 30:1-30:22 - [c5]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. IPEC 2020: 7:1-7:16 - [c4]Tao Jiang, Young-San Lin, Thành Nguyen:
Market Equilibrium in Multi-tier Supply Chain Networks. WINE 2020: 467 - [i3]Tao Jiang, Young-San Lin, Thanh Nguyen:
Market Equilibrium in Multi-tier Supply Chain Networks. CoRR abs/2009.13021 (2020)
2010 – 2019
- 2019
- [i2]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
The Maximum Binary Tree Problem. CoRR abs/1909.07915 (2019) - 2017
- [c3]Young-San Lin, Thanh Nguyen:
On Variants of Network Flow Stability. WINE 2017: 403-404 - [i1]Young-San Lin, Thanh Nguyen:
On Variants of Network Flow Stability. CoRR abs/1710.03091 (2017) - 2015
- [j2]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, Wei-Sheng Chin, Yu-Chin Juan, Hsiao-Yu Tung, Jui-Pin Wang, Cheng-Kuang Wei, Felix Wu, Tu-Chun Yin, Tong Yu, Yong Zhuang, Shou-De Lin, Hsuan-Tien Lin, Chih-Jen Lin:
Combination of feature engineering and ranking models for paper-author identification in KDD cup 2013. J. Mach. Learn. Res. 16: 2921-2947 (2015) - 2014
- [j1]Wei-Sheng Chin, Yong Zhuang, Yu-Chin Juan, Felix Wu, Hsiao-Yu Tung, Tong Yu, Jui-Pin Wang, Cheng-Xia Chang, Chun-Pai Yang, Wei-Cheng Chang, Kuan-Hao Huang, Tzu-Ming Kuo, Shan-Wei Lin, Young-San Lin, Yu-Chen Lu, Yu-Chuan Su, Cheng-Kuang Wei, Tu-Chun Yin, Chun-Liang Li, Ting-Wei Lin, Cheng-Hao Tsai, Shou-De Lin, Hsuan-Tien Lin, Chih-Jen Lin:
Effective string processing and matching for author disambiguation. J. Mach. Learn. Res. 15(1): 3037-3064 (2014) - 2013
- [c2]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, Wei-Sheng Chin, Yu-Chin Juan, Hsiao-Yu Tung, Jui-Pin Wang, Cheng-Kuang Wei, Felix Wu, Tu-Chun Yin, Tong Yu, Yong Zhuang, Shou-de Lin, Hsuan-Tien Lin, Chih-Jen Lin:
Combination of feature engineering and ranking models for paper-author identification in KDD Cup 2013. KDD Cup 2013: 2:1-2:7 - [c1]Wei-Sheng Chin, Yu-Chin Juan, Yong Zhuang, Felix Wu, Hsiao-Yu Tung, Tong Yu, Jui-Pin Wang, Cheng-Xia Chang, Chun-Pai Yang, Wei-Cheng Chang, Kuan-Hao Huang, Tzu-Ming Kuo, Shan-Wei Lin, Young-San Lin, Yu-Chen Lu, Yu-Chuan Su, Cheng-Kuang Wei, Tu-Chun Yin, Chun-Liang Li, Ting-Wei Lin, Cheng-Hao Tsai, Shou-De Lin, Hsuan-Tien Lin, Chih-Jen Lin:
Effective string processing and matching for author disambiguation. KDD Cup 2013: 7:1-7:9
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-16 23:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
