The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nguyen Kim Thang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christoph Dürr, Nguyen Kim Thang
    Nash Equilibria in Voronoi Games on Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:17-28 [Conf]
  2. Christoph Dürr, Nguyen Kim Thang
    Nash equilibria in Voronoi games on graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  3. Tile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard. [Citation Graph (, )][DBLP]


  4. -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games. [Citation Graph (, )][DBLP]


  5. Online Scheduling of Bounded Length Jobs to Maximize Throughput. [Citation Graph (, )][DBLP]


  6. Non-clairvoyant Scheduling Games. [Citation Graph (, )][DBLP]


  7. Online Scheduling of Bounded Length Jobs to Maximize Throughput [Citation Graph (, )][DBLP]


  8. Tile Packing Tomography is NP-hard [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002