diff --git a/website/BatchGantt1.png b/website/BatchGantt1.png
index b35c6dd9..3f3958eb 100644
Binary files a/website/BatchGantt1.png and b/website/BatchGantt1.png differ
diff --git a/website/index.html b/website/index.html
index 1a2f30ed..f824255b 100644
--- a/website/index.html
+++ b/website/index.html
@@ -118,12 +118,6 @@
     They are also ranked among <em>computational intelligence</em> methods, a domain close to artificial intelligence.
     </p>
 
-    <p>
-    <img src="Gallagher_Gaussian_BBOB_f21.png" title="Gallagher's Gaussian 101-me Peaks function, Black Box Optimization Benchmark f21 − COCO team" /> <!-- http://coco.lri.fr/BBOB-downloads/download10.2/bbobdocfunctions.pdf -->
-    <img src="200px-Graph_betweenness.svg.png" title="Hue scale representing node betweenness on a graph − Claudio Rocchini − CC-BY" /><!-- http://commons.wikimedia.org/wiki/File:Graph_betweenness.svg -->
-    <img src="BatchGantt1.png" title="Gantt Chart for a Batch Process − Casilett − DP" /><!-- http://en.wikipedia.org/wiki/File:BatchGantt1.png -->
-    </p>
-
     <p>With the help of EO, you can easily design evolutionary algorithms that will find solutions to virtually all kind of hard optimization problems, from continuous to combinatorial ones.</p>
     
     
@@ -139,7 +133,21 @@
 
     <h2>Main Features</h2>
 
-    <img src="http://upload.wikimedia.org/wikipedia/en/timeline/3f507249a36a4a38020e7fc0a5f448df.png" title="Metaheuristics that can be implemented with EO and ParadisEO, ordered by date of invention − Johann Dréo/Wikipédia − CC-BY-SA" style="float:right;" /> <!-- http://en.wikipedia.org/wiki/Metaheuristic -->
+    <!-- <img src="http://upload.wikimedia.org/wikipedia/en/timeline/3f507249a36a4a38020e7fc0a5f448df.png" title="Metaheuristics that can be implemented with EO and ParadisEO, ordered by date of invention − Johann Dréo/Wikipédia − CC-BY-SA" style="float:right;" /> --> <!-- http://en.wikipedia.org/wiki/Metaheuristic -->
+
+    <table style="float:right;" class="examples">
+        <caption>Examples of problems that you can solve with the help of EO:</caption>
+        <tr><td>
+            <img src="Gallagher_Gaussian_BBOB_f21.png" title="Continuous problems (here Gallagher's Gaussian 101-me Peaks function, Black Box Optimization Benchmark, f21 − COCO team)" /> <!-- http://coco.lri.fr/BBOB-downloads/download10.2/bbobdocfunctions.pdf -->
+        </tr></td>
+        <tr><td>
+            <img src="200px-Graph_betweenness.svg.png" title="Graph problems (here a Hue scale representing node betweenness on a graph − Claudio Rocchini − CC-BY)" /><!-- http://commons.wikimedia.org/wiki/File:Graph_betweenness.svg -->
+        </tr></td>
+        <tr><td>
+            <img src="BatchGantt1.png" title="Planning problems (here a Gantt Chart for a Batch Process − Casilett − DP)" /><!-- http://en.wikipedia.org/wiki/File:BatchGantt1.png -->
+        </tr></td>
+    </table>
+
 
     <ul>
         <li>Flexible design that permits to easily create virtually any algorithm</li>
diff --git a/website/lightblue.css b/website/lightblue.css
index 94736d47..ebb0a7aa 100644
--- a/website/lightblue.css
+++ b/website/lightblue.css
@@ -71,6 +71,10 @@ blockquote {
     padding-left:1em;
 }
 
+table.examples {
+    margin-right:0.5em;
+}
+
 h1, h2, h3, h4, h5, h6, p, pre, blockquote, label, ul, ol, dl,
 fieldset, address { margin:0.75em 0;}