Nguyen Kim Thang

Available identifiers

zbMath Open thang.nguyen-kimMaRDI QIDQ278715

List of research outcomes

Publication	Date of Publication	Type
Competitive algorithms for demand response management in a smart grid	2024-04-02	Paper
https://portal.mardi4nfdi.de/entity/Q6087217	2023-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q5875658	2023-02-03	Paper
An improved approximation algorithm for scheduling under arborescence precedence constraints	2022-07-18	Paper
Tropical paths in vertex-colored graphs	2021-11-25	Paper
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines	2021-08-04	Paper
New results on multi-level aggregation	2021-03-09	Paper
Online Algorithms for Multilevel Aggregation	2020-11-04	Paper
A greedy algorithm for subspace approximation problem	2020-08-25	Paper
Competitive algorithms for demand response management in smart grid	2020-02-12	Paper
Maximum colorful cycles in vertex-colored graphs	2018-11-28	Paper
Maximum colorful cliques in vertex-colored graphs	2018-10-04	Paper
Approximating \(k\)-forest with resource augmentation: a primal-dual approach	2018-03-26	Paper
Online algorithms for multi-level aggregation	2018-03-02	Paper
Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality	2018-03-02	Paper
Non-preemptive throughput maximization for speed-scaling with power-down	2018-01-11	Paper
Lagrangian duality based algorithms in online energy-efficient scheduling	2017-10-17	Paper
The local-global conjecture for scheduling with non-linear cost	2017-09-01	Paper
Throughput maximization in multiprocessor speed-scaling	2016-05-02	Paper
Congestion games with capacitated resources	2016-01-13	Paper
Improved local search for universal facility location	2015-07-10	Paper
Online scheduling of bounded length jobs to maximize throughput	2014-02-05	Paper
\(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games	2014-01-09	Paper
Improved local search for universal facility location	2013-06-11	Paper
Congestion games with capacitated resources	2013-03-13	Paper
Tile-packing tomography is \(\mathbb{NP}\)-hard	2012-11-21	Paper
Strategy-proof mechanisms for facility location games with many facilities	2011-10-28	Paper
Tile-packing tomography is \({\mathbb{NP}}\)-hard	2010-07-20	Paper
$\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games	2009-02-03	Paper
Nash Equilibria in Voronoi Games on Graphs	2008-09-25	Paper

Research outcomes over time

This page was built for person: Nguyen Kim Thang