|
Search the dblp DataBase
Gwenaël Joret:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- Jean Cardinal, Samuel Fiorini, Gwenaël Joret
Minimum Entropy Coloring. [Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:819-828 [Conf]
- 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]
- 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]
Minimum Entropy Combinatorial Optimization Problems. [Citation Graph (, )][DBLP]
Hitting Diamonds and Growing Cacti. [Citation Graph (, )][DBLP]
An efficient algorithm for partial order production. [Citation Graph (, )][DBLP]
Sorting under partial information (without the ellipsoid algorithm). [Citation Graph (, )][DBLP]
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. [Citation Graph (, )][DBLP]
Tight Results on Minimum Entropy Set Cover. [Citation Graph (, )][DBLP]
Minimum Entropy Orientations [Citation Graph (, )][DBLP]
An Efficient Algorithm for Partial Order Production [Citation Graph (, )][DBLP]
Stackelberg Network Pricing is Hard to Approximate [Citation Graph (, )][DBLP]
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs [Citation Graph (, )][DBLP]
Sorting under Partial Information (without the Ellipsoid Algorithm) [Citation Graph (, )][DBLP]
Hitting Diamonds and Growing Cacti [Citation Graph (, )][DBLP]
Minimum Entropy Combinatorial Optimization Problems [Citation Graph (, )][DBLP]
On a theorem of Sewell and Trotter. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|