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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach.
CoRR, 2024
2023
J. Sched., December, 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
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
ACM Trans. Parallel Comput., 2021
CoRR, 2021
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
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
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
Proceedings of the Industrial Networks and Intelligent Systems, 2020
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020
2019
Theor. Comput. Sci., 2019
CoRR, 2019
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems.
Algorithmica, 2019
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019
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
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
Proceedings of the Computer Science - Theory and Applications, 2018
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018
2017
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
Proceedings of the Euro-Par 2015: Parallel Processing, 2015
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
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012
2011
Proceedings of the Computer Science - Theory and Applications, 2011
Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011
2010
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010
2009
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009
2007