( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximation Algorithms for Directed Weighted Spanners.

, , и . APPROX/RANDOM, том 275 из LIPIcs, стр. 8:1-8:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

San San Lin

San-Chin Lin

Peter Chü-San Lin

San San Hmwe

Lin Lin

 

Другие публикации лиц с тем же именем

The Maximum Binary Tree Problem., , , , , и . CoRR, (2019)Online Directed Spanners and Steiner Forests., , и . APPROX-RANDOM, том 207 из LIPIcs, стр. 5:1-5:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Market Equilibrium in Multi-tier Supply Chain Networks., , и . WINE, том 12495 из Lecture Notes in Computer Science, стр. 467. Springer, (2020)Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree., , , , , и . IPEC, том 180 из LIPIcs, стр. 7:1-7:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Combination of feature engineering and ranking models for paper-author identification in KDD cup 2013., , , , , , , , , и 14 other автор(ы). J. Mach. Learn. Res., (2015)Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree., , , , , и . CoRR, (2021)The Maximum Binary Tree Problem., , , , , и . Algorithmica, 83 (8): 2427-2468 (2021)On Variants of Network Flow Stability., и . WINE, том 10660 из Lecture Notes in Computer Science, стр. 403-404. Springer, (2017)Nanorod Arrays Enhanced UV Light Response of Mg-Doped ZnO Films., , , , и . Symmetry, 12 (6): 1005 (2020)The Maximum Binary Tree Problem., , , , , и . ESA, том 173 из LIPIcs, стр. 30:1-30:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)