Nash equilibria in Voronoi games on graphs.
Christoph Dürr, Kim Thang Nguyen: Nash equilibria in Voronoi games on graphs. CoRR abs/cs/0702054 (2007)
View ArticleNash Equilibria in Voronoi Games on Graphs.
Christoph Dürr, Kim Thang Nguyen: Nash Equilibria in Voronoi Games on Graphs. ESA 2007: 17-28
View ArticleTile Packing Tomography is NP-hard.
Marek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Kim Thang Nguyen: Tile Packing Tomography is NP-hard. CoRR abs/0911.2567 (2009)
View ArticleOnline Scheduling of Bounded Length Jobs to Maximize Throughput.
Christoph Dürr, Lukasz Jez, Kim Thang Nguyen: Online Scheduling of Bounded Length Jobs to Maximize Throughput. CoRR abs/0902.2209 (2009)
View ArticleOnline Scheduling of Bounded Length Jobs to Maximize Throughput.
Christoph Dürr, Lukasz Jez, Kim Thang Nguyen: Online Scheduling of Bounded Length Jobs to Maximize Throughput. WAOA 2009: 116-127
View Article-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games.
Kim Thang Nguyen: -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games. SOFSEM 2009: 413-424
View ArticleNon-clairvoyant Scheduling Games.
Christoph Dürr, Kim Thang Nguyen: Non-clairvoyant Scheduling Games. SAGT 2009: 135-146
View ArticleOn (Group) Strategy-Proof Mechanisms without Payment for Facility Location...
Kim Thang Nguyen: On (Group) Strategy-Proof Mechanisms without Payment for Facility Location Games. WINE 2010: 531-538
View ArticleTile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard.
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
View ArticleNon-clairvoyant Scheduling Games.
Johanne Cohen, Christoph Dürr, Kim Thang Nguyen: Non-clairvoyant Scheduling Games. CoRR abs/1101.1256 (2011)
View ArticleImproved Online Scheduling in Maximizing Throughput of Equal Length Jobs.
Kim Thang Nguyen: Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs. CSR 2011: 429-442
View ArticleStrategy-Proof Mechanisms for Facility Location Games with Many Facilities.
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
View ArticleNon-clairvoyant Scheduling Games.
Johanne Cohen, Christoph Dürr, Kim Thang Nguyen: Non-clairvoyant Scheduling Games. Theory Comput. Syst. 49(1): 3-23 (2011)
View ArticleSmooth Inequalities and Equilibrium Inefficiency in Scheduling Games.
Johanne Cohen, Christoph Dürr, Kim Thang Nguyen: Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games. CoRR abs/1202.4302 (2012)
View ArticleSmooth Inequalities and Equilibrium Inefficiency in Scheduling Games.
Johanne Cohen, Christoph Dürr, Kim Thang Nguyen: Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games. WINE 2012: 350-363
View ArticleCongestion Games with Capacitated Resources.
Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen: Congestion Games with Capacitated Resources. SAGT 2012: 204-215
View ArticleOnline scheduling of bounded length jobs to maximize throughput.
Christoph Dürr, Lukasz Jez, Kim Thang Nguyen: Online scheduling of bounded length jobs to maximize throughput. J. Sched. 15(5): 653-664 (2012)
View ArticleTile-Packing Tomography Is NP-hard.
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)
View ArticleLagrangian Duality in Online Scheduling with Resource Augmentation and Speed...
Kim Thang Nguyen: Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling. ESA 2013: 755-766
View ArticleImproved Local Search for Universal Facility Location.
Eric Angel, Kim Thang Nguyen, Damien Regnault: Improved Local Search for Universal Facility Location. COCOON 2013: 316-324
View Article
More Pages to Explore .....