Kim Thang Nguyen

Orcid: 0000-0002-6085-9453

According to our database1, Kim Thang Nguyen authored at least 54 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach.
CoRR, 2024

2023
Competitive algorithms for demand response management in a smart grid.
J. Sched., December, 2023

Online Covering with Multiple Experts.
CoRR, 2023

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022
Online learning for min-max discrete problems.
Theor. Comput. Sci., 2022

A simple rounding scheme for multistage optimization.
Theor. Comput. Sci., 2022

A stochastic conditional gradient algorithm for decentralized online convex optimization.
J. Parallel Distributed Comput., 2022

Online Decentralized Frank-Wolfe: From Theoretical Bound to Applications in Smart-Building.
Proceedings of the Internet of Things, 2022

One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization.
Proceedings of the Asian Conference on Machine Learning, 2022

2021
Online Non-preemptive Scheduling on Unrelated Machines with Rejections.
ACM Trans. Parallel Comput., 2021

New results on multi-level aggregation.
Theor. Comput. Sci., 2021

Tropical paths in vertex-colored graphs.
J. Comb. Optim., 2021

Competitive Algorithms for Online Weighted Bipartite Matching and its Variants.
CoRR, 2021

Online Primal-Dual Algorithms with Predictions for Packing Problems.
CoRR, 2021

Online Non-Monotone DR-Submodular Maximization.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Online Algorithms for Multilevel Aggregation.
Oper. Res., 2020

A Bandit Learning Algorithm and Applications to Auction Design.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Online Primal-Dual Algorithms with Configuration Linear Programs.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Distributed Watermarking for Cross-Domain of Semantic Large Image Database.
Proceedings of the Industrial Networks and Intelligent Systems, 2020

Non-monotone DR-submodular Maximization over General Convex Sets.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Approximating <i>k</i>-forest with resource augmentation: A primal-dual approach.
Theor. Comput. Sci., 2019

Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees.
CoRR, 2019

Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems.
Algorithmica, 2019

A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Game Efficiency Through Linear Programming Duality.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
A Greedy Algorithm for Subspace Approximation Problem.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Maximum Colorful Cycles in Vertex-Colored Graphs.
Proceedings of the Computer Science - Theory and Applications, 2018

Maximum Colorful Cliques in Vertex-Colored Graphs.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
The local-global conjecture for scheduling with non-linear cost.
J. Sched., 2017

Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Throughput maximization in multiprocessor speed-scaling.
Theor. Comput. Sci., 2016

Lagrangian Duality based Algorithms in Online Energy-Efficient Scheduling.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Online Algorithms for Multi-Level Aggregation.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Congestion Games with Capacitated Resources.
Theory Comput. Syst., 2015

Improved local search for universal facility location.
J. Comb. Optim., 2015

Non-preemptive Throughput Maximization for Speed-Scaling with Power-Down.
Proceedings of the Euro-Par 2015: Parallel Processing, 2015

2014
Lagrangian Duality based Algorithms in Online Scheduling.
CoRR, 2014

2013
<i>NP</i>NP-hardness of pure Nash equilibrium in Scheduling and Network Design Games.
Theor. Comput. Sci., 2013

Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Online scheduling of bounded length jobs to maximize throughput.
J. Sched., 2012

Tile-Packing Tomography Is NP-hard.
Algorithmica, 2012

Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

2011
Non-clairvoyant Scheduling Games.
Theory Comput. Syst., 2011

Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs.
Proceedings of the Computer Science - Theory and Applications, 2011

Strategy-Proof Mechanisms for Facility Location Games with Many Facilities.
Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

2010
On (Group) Strategy-Proof Mechanisms without Payment for Facility Location Games.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Tile-Packing Tomography Is \mathbb<i>NP</i>{\mathbb{NP}}-hard.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Non-clairvoyant Scheduling Games.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2007
Nash Equilibria in Voronoi Games on Graphs.
Proceedings of the Algorithms, 2007


  Loading...