Young-San Lin

Orcid: 0000-0002-5719-6708

According to our database1, Young-San Lin authored at least 12 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives.
CoRR, 2024

Directed Buy-at-Bulk Spanners.
CoRR, 2024

2023
Approximation Algorithms for Directed Weighted Spanners.
Proceedings of the Approximation, 2023

2022
Allocation with Weak Priorities and General Constraints.
Oper. Res., 2022

Learning-Augmented Algorithms for Online Linear and Semidefinite Programming.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
The Maximum Binary Tree Problem.
Algorithmica, 2021

Online Directed Spanners and Steiner Forests.
Proceedings of the Approximation, 2021

2020
Market Equilibrium in Multi-tier Supply Chain Networks.
Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2017
On Variants of Network Flow Stability.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

2015
Combination of feature engineering and ranking models for paper-author identification in KDD cup 2013.
J. Mach. Learn. Res., 2015

2014
Effective string processing and matching for author disambiguation.
J. Mach. Learn. Res., 2014


  Loading...