default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKim Thang Nguyen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i24]Tuan-Anh Nguyen, Kim Thang Nguyen, Denis Trystram:
Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach. CoRR abs/2402.02114 (2024)- [i23]Eniko Kevi, Kim Thang Nguyen:
Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems. CoRR abs/2402.08701 (2024) - 2023
- [j18]Vincent Chau
, Shengzhong Feng, Kim Thang Nguyen:
Competitive algorithms for demand response management in a smart grid. J. Sched. 26(6): 535-542 (2023) - [c38]Eniko Kevi, Kim Thang Nguyen:
Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems. ALT 2023: 891-908 - [i22]Eniko Kevi, Kim Thang Nguyen:
Online Covering with Multiple Experts. CoRR abs/2312.14564 (2023) - 2022
- [j17]Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram, Paul Youssef:
A stochastic conditional gradient algorithm for decentralized online convex optimization. J. Parallel Distributed Comput. 169: 334-351 (2022) - [j16]Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Alexander V. Kononov, Kim Thang Nguyen:
A simple rounding scheme for multistage optimization. Theor. Comput. Sci. 907: 1-10 (2022) - [j15]Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Kim Thang Nguyen:
Online learning for min-max discrete problems. Theor. Comput. Sci. 930: 209-217 (2022) - [c37]Tuan-Anh Nguyen, Kim Thang Nguyen, Denis Trystram:
One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization. ACML 2022: 802-815 - [c36]Angan Mitra, Kim Thang Nguyen, Tuan-Anh Nguyen, Denis Trystram, Paul Youssef:
Online Decentralized Frank-Wolfe: From Theoretical Bound to Applications in Smart-Building. GIOTS 2022: 43-54 - [i21]Angan Mitra, Kim Thang Nguyen, Tuan-Anh Nguyen, Denis Trystram, Paul Youssef:
Online Decentralized Frank-Wolfe: From theoretical bound to applications in smart-building. CoRR abs/2208.00522 (2022) - [i20]Tuan-Anh Nguyen, Kim Thang Nguyen, Denis Trystram:
One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization. CoRR abs/2210.16790 (2022) - 2021
- [j14]Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Tropical paths in vertex-colored graphs. J. Comb. Optim. 42(3): 476-498 (2021) - [j13]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
New results on multi-level aggregation. Theor. Comput. Sci. 861: 133-143 (2021) - [j12]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. ACM Trans. Parallel Comput. 8(2): 9:1-9:22 (2021) - [c35]Kim Thang Nguyen, Abhinav Srivastav:
Online Non-Monotone DR-Submodular Maximization. AAAI 2021: 9868-9876 - [i19]Kim Thang Nguyen, Christoph Dürr:
Online Primal-Dual Algorithms with Predictions for Packing Problems. CoRR abs/2110.00391 (2021) - [i18]Kim Thang Nguyen:
Competitive Algorithms for Online Weighted Bipartite Matching and its Variants. CoRR abs/2111.01718 (2021) - 2020
- [j11]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multilevel Aggregation. Oper. Res. 68(1): 214-232 (2020) - [c34]Christoph Dürr, Kim Thang Nguyen, Abhinav Srivastav, Léo Tible:
Non-monotone DR-submodular Maximization over General Convex Sets. IJCAI 2020: 2148-2154 - [c33]Le Danh Tai, Kim Thang Nguyen, Ta Minh Thanh:
Distributed Watermarking for Cross-Domain of Semantic Large Image Database. INISCOM 2020: 163-180 - [c32]Kim Thang Nguyen:
Online Primal-Dual Algorithms with Configuration Linear Programs. ISAAC 2020: 45:1-45:16 - [c31]Kim Thang Nguyen:
An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints. MFCS 2020: 84:1-84:12 - [c30]Kim Thang Nguyen:
A Bandit Learning Algorithm and Applications to Auction Design. NeurIPS 2020
2010 – 2019
- 2019
- [j10]Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen:
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems. Algorithmica 81(9): 3391-3421 (2019) - [j9]Eric Angel, Kim Thang Nguyen, Shikha Singh:
Approximating k-forest with resource augmentation: A primal-dual approach. Theor. Comput. Sci. 788: 12-20 (2019) - [c29]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines. FSTTCS 2019: 24:1-24:12 - [c28]Kim Thang Nguyen:
Game Efficiency Through Linear Programming Duality. ITCS 2019: 66:1-66:20 - [c27]Kim Thang Nguyen:
A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing. ISAAC 2019: 39:1-39:12 - [i17]Christoph Dürr, Kim Thang Nguyen, Abhinav Srivastav, Léo Tible:
Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees. CoRR abs/1905.09595 (2019) - [i16]Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Kim Thang Nguyen:
Online-Learning for min-max discrete problems. CoRR abs/1907.05944 (2019) - [i15]Kim Thang Nguyen, Abhinav Srivastav:
Online Non-Monotone DR-submodular Maximization. CoRR abs/1909.11426 (2019) - 2018
- [c26]Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Maximum Colorful Cliques in Vertex-Colored Graphs. COCOON 2018: 480-491 - [c25]Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Maximum Colorful Cycles in Vertex-Colored Graphs. CSR 2018: 106-117 - [c24]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. ESA 2018: 59:1-59:12 - [c23]Vincent Chau, Shengzhong Feng, Kim Thang Nguyen:
Competitive Algorithms for Demand Response Management in Smart Grid. LATIN 2018: 303-316 - [c22]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. SPAA 2018: 291-300 - [c21]Kim Thang Nguyen:
A Greedy Algorithm for Subspace Approximation Problem. SWAT 2018: 30:1-30:7 - [i14]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. CoRR abs/1802.10309 (2018) - [i13]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. CoRR abs/1804.08317 (2018) - 2017
- [j8]Nikhil Bansal, Christoph Dürr, Kim Thang Nguyen, Óscar C. Vásquez:
The local-global conjecture for scheduling with non-linear cost. J. Sched. 20(3): 239-254 (2017) - [c20]Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Tropical Paths in Vertex-Colored Graphs. COCOA (2) 2017: 291-305 - [c19]Eric Angel, Kim Thang Nguyen, Shikha Singh:
Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach. COCOA (2) 2017: 333-347 - [i12]Kim Thang Nguyen:
Online Primal-Dual Algorithms with Configuration Linear Programs. CoRR abs/1708.04903 (2017) - [i11]Kim Thang Nguyen:
Game Efficiency through Linear Programming Duality. CoRR abs/1708.06499 (2017) - 2016
- [j7]Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen:
Throughput maximization in multiprocessor speed-scaling. Theor. Comput. Sci. 630: 1-12 (2016) - [c18]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. ESA 2016: 12:1-12:17 - [c17]Giorgio Lucarelli, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality. ESA 2016: 63:1-63:17 - [c16]Kim Thang Nguyen:
Lagrangian Duality based Algorithms in Online Energy-Efficient Scheduling. SWAT 2016: 20:1-20:14 - [i10]Eric Angel, Kim Thang Nguyen, Shikha Singh:
Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach. CoRR abs/1611.07489 (2016) - 2015
- [j6]Eric Angel, Kim Thang Nguyen, Damien Regnault:
Improved local search for universal facility location. J. Comb. Optim. 29(1): 237-246 (2015) - [j5]Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen:
Congestion Games with Capacitated Resources. Theory Comput. Syst. 57(3): 598-616 (2015) - [c15]Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen:
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems. ESA 2015: 35-46 - [c14]Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen:
Non-preemptive Throughput Maximization for Speed-Scaling with Power-Down. Euro-Par 2015: 171-182 - [i9]Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen:
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems. CoRR abs/1502.03946 (2015) - [i8]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. CoRR abs/1507.02378 (2015) - 2014
- [c13]Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen:
Throughput Maximization in Multiprocessor Speed-Scaling. ISAAC 2014: 247-258 - [i7]Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen:
Throughput Maximization in Multiprocessor Speed-Scaling. CoRR abs/1402.3782 (2014) - [i6]Kim Thang Nguyen:
Lagrangian Duality based Algorithms in Online Scheduling. CoRR abs/1408.0965 (2014) - 2013
- [j4]Kim Thang Nguyen:
NPNP-hardness of pure Nash equilibrium in Scheduling and Network Design Games. Theor. Comput. Sci. 482: 86-95 (2013) - [c12]Eric Angel, Kim Thang Nguyen, Damien Regnault:
Improved Local Search for Universal Facility Location. COCOON 2013: 316-324 - [c11]Kim Thang Nguyen:
Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling. ESA 2013: 755-766 - 2012
- [j3]Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Kim Thang Nguyen:
Tile-Packing Tomography Is NP-hard. Algorithmica 64(2): 267-278 (2012) - [j2]Christoph Dürr, Lukasz Jez, Kim Thang Nguyen:
Online scheduling of bounded length jobs to maximize throughput. J. Sched. 15(5): 653-664 (2012) - [c10]Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen:
Congestion Games with Capacitated Resources. SAGT 2012: 204-215 - [c9]Johanne Cohen, Christoph Dürr, Kim Thang Nguyen:
Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games. WINE 2012: 350-363 - [i5]Johanne Cohen, Christoph Dürr, Kim Thang Nguyen:
Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games. CoRR abs/1202.4302 (2012) - 2011
- [j1]Johanne Cohen, Christoph Dürr, Kim Thang Nguyen:
Non-clairvoyant Scheduling Games. Theory Comput. Syst. 49(1): 3-23 (2011) - [c8]Bruno Escoffier, Laurent Gourvès, Kim Thang Nguyen, Fanny Pascual, Olivier Spanjaard:
Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. ADT 2011: 67-81 - [c7]Kim Thang Nguyen:
Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs. CSR 2011: 429-442 - [i4]Johanne Cohen, Christoph Dürr, Kim Thang Nguyen:
Non-clairvoyant Scheduling Games. CoRR abs/1101.1256 (2011) - 2010
- [c6]Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Kim Thang Nguyen:
Tile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard. COCOON 2010: 254-263 - [c5]Kim Thang Nguyen:
On (Group) Strategy-Proof Mechanisms without Payment for Facility Location Games. WINE 2010: 531-538
2000 – 2009
- 2009
- [c4]Christoph Dürr, Kim Thang Nguyen:
Non-clairvoyant Scheduling Games. SAGT 2009: 135-146 - [c3]Kim Thang Nguyen:
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games. SOFSEM 2009: 413-424 - [c2]Christoph Dürr, Lukasz Jez, Kim Thang Nguyen:
Online Scheduling of Bounded Length Jobs to Maximize Throughput. WAOA 2009: 116-127 - [i3]Christoph Dürr, Lukasz Jez, Kim Thang Nguyen:
Online Scheduling of Bounded Length Jobs to Maximize Throughput. CoRR abs/0902.2209 (2009) - [i2]Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Kim Thang Nguyen:
Tile Packing Tomography is NP-hard. CoRR abs/0911.2567 (2009) - 2007
- [c1]Christoph Dürr, Kim Thang Nguyen:
Nash Equilibria in Voronoi Games on Graphs. ESA 2007: 17-28 - [i1]Christoph Dürr, Kim Thang Nguyen:
Nash equilibria in Voronoi games on graphs. CoRR abs/cs/0702054 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
