Nash Equilibria in Voronoi Games on Graphs. - Christoph Dürr; Kim Thang Nguyen (ESA, 2007)

Non-clairvoyant Scheduling Games. - Christoph Dürr; Kim Thang Nguyen (SAGT, 2009)

-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games. - Kim Thang Nguyen (SOFSEM, 2009)

Online Scheduling of Bounded Length Jobs to Maximize Throughput. - Christoph Dürr; Lukasz Jez; Kim Thang Nguyen (WAOA, 2009)

Tile-Packing Tomography Is mathbbNP{ mathbb{NP}}-hard. - Marek Chrobak; Christoph Dürr; Flavio Guiñez; Antoni Lozano; Kim Thang Nguyen (COCOON, 2010)

On (Group) Strategy-Proof Mechanisms without Payment for Facility Location Games. - Kim Thang Nguyen (WINE, 2010)

Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. - Bruno Escoffier; Laurent Gourvès; Kim Thang Nguyen; Fanny Pascual; Olivier Spanjaard (ADT, 2011)

Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs. - Kim Thang Nguyen (CSR, 2011)

Non-clairvoyant Scheduling Games. - Johanne Cohen; Christoph Dürr; Kim Thang Nguyen (Theory Comput. Syst., 2011)

Congestion Games with Capacitated Resources. - Laurent Gourvès; Jérôme Monnot; Stefano Moretti 001; Kim Thang Nguyen (SAGT, 2012)

Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games. - Johanne Cohen; Christoph Dürr; Kim Thang Nguyen (WINE, 2012)

Tile-Packing Tomography Is NP-hard. - Marek Chrobak; Christoph Dürr; Flavio Guiñez; Antoni Lozano; Kim Thang Nguyen (Algorithmica, 2012)

Improved Local Search for Universal Facility Location. - Eric Angel; Kim Thang Nguyen; Damien Regnault (COCOON, 2013)

Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling. - Kim Thang Nguyen (ESA, 2013)

NPNP-hardness of pure Nash equilibrium in Scheduling and Network Design Games. - Kim Thang Nguyen (Theor. Comput. Sci., 2013)

Throughput Maximization in Multiprocessor Speed-Scaling. - Eric Angel; Evripidis Bampis; Vincent Chau; Kim Thang Nguyen (ISAAC, 2014)

Lagrangian Duality based Algorithms in Online Scheduling. - Kim Thang Nguyen (CoRR, 2014)

Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems. - Spyros Angelopoulos 001; Giorgio Lucarelli; Kim Thang Nguyen (ESA, 2015)

Non-preemptive Throughput Maximization for Speed-Scaling with Power-Down. - Eric Angel; Evripidis Bampis; Vincent Chau; Kim Thang Nguyen (Euro-Par, 2015)

Online Algorithms for Multi-Level Aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jiri Sgall; Kim Thang Nguyen; Pavel Veselý 001 (ESA, 2016)

Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality. - Giorgio Lucarelli; Kim Thang Nguyen; Abhinav Srivastav; Denis Trystram (ESA, 2016)

Lagrangian Duality based Algorithms in Online Energy-Efficient Scheduling. - Kim Thang Nguyen (SWAT, 2016)

Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach. - Eric Angel; Kim Thang Nguyen; Shikha Singh 002 (COCOA (2), 2017)

Tropical Paths in Vertex-Colored Graphs. - Johanne Cohen; Giuseppe F. Italiano; Yannis Manoussakis; Kim Thang Nguyen; Hong Phong Pham (COCOA (2), 2017)

The local-global conjecture for scheduling with non-linear cost. - Nikhil Bansal 001; Christoph Dürr; Kim Thang Nguyen; Óscar C. Vásquez 001 (J. Sched., 2017)

Maximum Colorful Cliques in Vertex-Colored Graphs. - Giuseppe F. Italiano; Yannis Manoussakis; Kim Thang Nguyen; Hong Phong Pham (COCOON, 2018)

Maximum Colorful Cycles in Vertex-Colored Graphs. - Giuseppe F. Italiano; Yannis Manoussakis; Kim Thang Nguyen; Hong Phong Pham (CSR, 2018)

Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. - Giorgio Lucarelli; Benjamin Moseley; Kim Thang Nguyen; Abhinav Srivastav; Denis Trystram (ESA, 2018)

Competitive Algorithms for Demand Response Management in Smart Grid. - Vincent Chau; Shengzhong Feng; Kim Thang Nguyen (LATIN, 2018)

Online Non-preemptive Scheduling on Unrelated Machines with Rejections. - Giorgio Lucarelli; Benjamin Moseley; Kim Thang Nguyen; Abhinav Srivastav; Denis Trystram (SPAA, 2018)

A Greedy Algorithm for Subspace Approximation Problem. - Kim Thang Nguyen (SWAT, 2018)

Primal-Dual Approaches in Online Algorithms, Algorithmic Game Theory and Online Learning. (Approche Primal-dual dans l'Algorithmique en ligne, la théorie des jeux algorithmique et l'Apprentissage en ligne). - Kim Thang Nguyen (2019)

Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines. - Giorgio Lucarelli; Benjamin Moseley; Kim Thang Nguyen; Abhinav Srivastav; Denis Trystram (FSTTCS, 2019)

Game Efficiency Through Linear Programming Duality. - Kim Thang Nguyen (ITCS, 2019)

A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing. - Kim Thang Nguyen (ISAAC, 2019)

Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees. - Christoph Dürr; Kim Thang Nguyen; Abhinav Srivastav; Léo Tible (CoRR, 2019)

Approximating k-forest with resource augmentation: A primal-dual approach. - Eric Angel; Kim Thang Nguyen; Shikha Singh 002 (Theor. Comput. Sci., 2019)

Non-monotone DR-submodular Maximization over General Convex Sets. - Christoph Dürr; Kim Thang Nguyen; Abhinav Srivastav; Léo Tible (IJCAI, 2020)

Distributed Watermarking for Cross-Domain of Semantic Large Image Database. - Le Danh Tai; Kim Thang Nguyen; Ta Minh Thanh (INISCOM, 2020)

Online Primal-Dual Algorithms with Configuration Linear Programs. - Kim Thang Nguyen (ISAAC, 2020)

An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints. - Kim Thang Nguyen (MFCS, 2020)

A Bandit Learning Algorithm and Applications to Auction Design. - Kim Thang Nguyen (NeurIPS, 2020)

Online Algorithms for Multilevel Aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jirí Sgall; Kim Thang Nguyen; Pavel Veselý 001 (Oper. Res., 2020)

Online Non-Monotone DR-Submodular Maximization. - Kim Thang Nguyen; Abhinav Srivastav (AAAI, 2021)

Online Primal-Dual Algorithms with Predictions for Packing Problems. - Kim Thang Nguyen; Christoph Dürr (CoRR, 2021)

Competitive Algorithms for Online Weighted Bipartite Matching and its Variants. - Kim Thang Nguyen (CoRR, 2021)

New results on multi-level aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jirí Sgall; Kim Thang Nguyen; Pavel Veselý 001 (Theor. Comput. Sci., 2021)

One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization. - Tuan-Anh Nguyen; Kim Thang Nguyen; Denis Trystram (ACML, 2022)

Online Decentralized Frank-Wolfe: From Theoretical Bound to Applications in Smart-Building. - Angan Mitra; Kim Thang Nguyen; Tuan-Anh Nguyen; Denis Trystram; Paul Youssef (GIOTS, 2022)

A stochastic conditional gradient algorithm for decentralized online convex optimization. - Kim Thang Nguyen; Abhinav Srivastav; Denis Trystram; Paul Youssef (J. Parallel Distributed Comput., 2022)

A simple rounding scheme for multistage optimization. - Evripidis Bampis; Dimitris Christou; Bruno Escoffier; Alexander V. Kononov; Kim Thang Nguyen (Theor. Comput. Sci., 2022)

Online learning for min-max discrete problems. - Evripidis Bampis; Dimitris Christou; Bruno Escoffier; Kim Thang Nguyen (Theor. Comput. Sci., 2022)

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems. - Eniko Kevi; Kim Thang Nguyen (ALT, 2023)

Online Covering with Multiple Experts. - Eniko Kevi; Kim Thang Nguyen (CoRR, 2023)

Handling Delayed Feedback in Distributed Online Optimization: A Projection-Free Approach. - Tuan-Anh Nguyen; Kim Thang Nguyen; Denis Trystram (ECML/PKDD (1), 2024)