PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Thang, Nguyen Kim"

Author of the publication

copydeleteadd this publication to your clipboard
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems.

, , and . ESA, volume 9294 of Lecture Notes in Computer Science, page 35-46. Springer, (2015)

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. You can also use the button next to the name to display some publications already assigned to the person.

Kim Meliani University of Stuttgart

Joel Kimmich University of Stuttgart

Do Yeon Kim University of Stuttgart

Dr. Wolfgang Kimmerle University of Stuttgart

Dr. -Ing. Kim Riedmüller University of Stuttgart

 

Other publications of authors with the same name

NPNP-hardness of pure Nash equilibrium in Scheduling and Network Design Games.. Theor. Comput. Sci., (2013)Online Algorithms for Multi-Level Aggregation., , , , , , , , , and . ESA, volume 57 of LIPIcs, page 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach., , and . CoRR, (2016)Congestion Games with Capacitated Resources., , , and . SAGT, volume 7615 of Lecture Notes in Computer Science, page 204-215. Springer, (2012)Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality., , , and . ESA, volume 57 of LIPIcs, page 63:1-63:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing.. ISAAC, volume 149 of LIPIcs, page 39:1-39:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On (Group) Strategy-Proof Mechanisms without Payment for Facility Location Games.. WINE, volume 6484 of Lecture Notes in Computer Science, page 531-538. Springer, (2010)A Greedy Algorithm for Subspace Approximation Problem.. SWAT, volume 101 of LIPIcs, page 30:1-30:7. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Maximum Colorful Cliques in Vertex-Colored Graphs., , , and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 480-491. Springer, (2018)Tile-Packing Tomography Is \mathbbNPNP-hard., , , , and . COCOON, volume 6196 of Lecture Notes in Computer Science, page 254-263. Springer, (2010)