|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 7 keywords
|
|
|
|
|
Results
Found 45 publication records. Showing 45 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Samuel Fiorini, Gwenaël Joret |
Approximating the balanced minimum evolution problem.  |
Oper. Res. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood |
Small minors in dense graphs. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gwenaël Joret, David R. Wood |
Nordhaus-Gaddum for treewidth. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Véronique Bruyère, Gwenaël Joret, Hadrien Mélot |
Trees with Given Stability Number and Minimum Number of Stable Sets. |
Graphs and Combinatorics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel Fiorini, Gwenaël Joret, David R. Wood |
Excluded Forest Minors and the Erdős-Pósa Property |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood |
A linear-time algorithm for finding a complete graph minor in a dense graph |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Vida Dujmovic, Fabrizio Frati, Gwenaël Joret, David R. Wood |
Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Minimum Entropy Combinatorial Optimization Problems. |
Theory Comput. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gwenaël Joret |
Stackelberg network pricing is hard to approximate. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann |
The Stackelberg Minimum Spanning Tree Game. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vida Dujmovic, Gasper Fijavz, Gwenaël Joret, Thom Sulanke, David R. Wood |
On the maximum number of cliques in a graph embedded in a surface. |
Eur. J. Comb. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | János Barát, Gwenaël Joret, David R. Wood |
Disproof of the List Hadwiger Conjecture. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gwenaël Joret, David R. Wood |
Nordhaus-Gaddum for Treewidth |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Samuel Fiorini, Gwenaël Joret |
Approximating the Balanced Minimum Evolution Problem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé |
Hitting and Harvesting Pumpkins |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | János Barát, Gwenaël Joret, David R. Wood |
Disproof of the List Hadwiger Conjecture |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vida Dujmovic, Gwenaël Joret, David R. Wood |
Nonrepetitive Colouring via Entropy Compression |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gwenaël Joret, Kevin G. Milans |
First-Fit is Linear on Posets Excluding Two Long Incomparable Chains. |
Order |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé |
Hitting and Harvesting Pumpkins. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gwenaël Joret, David R. Wood |
Irreducible triangulations are small. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Minimum Entropy Combinatorial Optimization Problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro |
An Efficient Algorithm for Partial Order Production. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli |
Hitting Diamonds and Growing Cacti. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro |
Sorting under partial information (without the ellipsoid algorithm). |
STOC |
2010 |
DBLP DOI BibTeX RDF |
graph entropy, partial order |
| 1 | Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret |
Weighted graphs defining facets: A connection between stable set and linear ordering polytopes. |
Discrete Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel Fiorini, Gwenaël Joret |
On a theorem of Sewell and Trotter. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann |
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli |
Hitting Diamonds and Growing Cacti |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro |
Sorting under Partial Information (without the Ellipsoid Algorithm) |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann |
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. |
WINE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro |
An efficient algorithm for partial order production. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
graph entropy, partial order |
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Minimum Entropy Combinatorial Optimization Problems. |
CiE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Minimum entropy orientations. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Minimum entropy coloring. |
J. Comb. Optim. |
2008 |
DBLP DOI BibTeX RDF |
Complexity, Entropy, Graph coloring |
| 1 | Attila Bernáth, Gwenaël Joret |
Well-balanced orientations of mixed graphs. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Tight Results on Minimum Entropy Set Cover. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Entropy, Greedy algorithm, Hardness of approximation, Set cover |
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Minimum Entropy Orientations |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphael M. Jungers, J. Ian Munro |
An Efficient Algorithm for Partial Order Production |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Gwenaël Joret |
Stackelberg Network Pricing is Hard to Approximate |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Nicolas Bougard, Gwenaël Joret |
Turán's theorem and k-connected graphs. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann |
The Stackelberg Minimum Spanning Tree Game |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann |
The Stackelberg Minimum Spanning Tree Game. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Tight Results on Minimum Entropy Set Cover. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret |
On a weighted generalization of alpha-critical graphs. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Minimum Entropy Coloring. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #45 of 45 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")