The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gwenaël Joret: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean Cardinal, Samuel Fiorini, Gwenaël Joret
    Tight Results on Minimum Entropy Set Cover. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:61-69 [Conf]
  2. Jean Cardinal, Samuel Fiorini, Gwenaël Joret
    Minimum Entropy Coloring. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:819-828 [Conf]
  3. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
    The Stackelberg Minimum Spanning Tree Game. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:64-76 [Conf]
  4. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
    The Stackelberg Minimum Spanning Tree Game [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  5. Minimum Entropy Combinatorial Optimization Problems. [Citation Graph (, )][DBLP]


  6. Hitting Diamonds and Growing Cacti. [Citation Graph (, )][DBLP]


  7. An efficient algorithm for partial order production. [Citation Graph (, )][DBLP]


  8. Sorting under partial information (without the ellipsoid algorithm). [Citation Graph (, )][DBLP]


  9. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. [Citation Graph (, )][DBLP]


  10. Tight Results on Minimum Entropy Set Cover. [Citation Graph (, )][DBLP]


  11. Minimum Entropy Orientations [Citation Graph (, )][DBLP]


  12. An Efficient Algorithm for Partial Order Production [Citation Graph (, )][DBLP]


  13. Stackelberg Network Pricing is Hard to Approximate [Citation Graph (, )][DBLP]


  14. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs [Citation Graph (, )][DBLP]


  15. Sorting under Partial Information (without the Ellipsoid Algorithm) [Citation Graph (, )][DBLP]


  16. Hitting Diamonds and Growing Cacti [Citation Graph (, )][DBLP]


  17. Minimum Entropy Combinatorial Optimization Problems [Citation Graph (, )][DBLP]


  18. On a theorem of Sewell and Trotter. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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