Add sections layout

l4proj.bib

@@ -1,10 +1,16 @@
-@misc{Lichman:2013 ,
+@misc{UCL_Data,
 author = "M. Lichman",
 year = "2013",
 title = "{UCI} Machine Learning Repository",
 url = "http://archive.ics.uci.edu/ml",
 institution = "University of California, Irvine, School of Information and Computer Sciences" }
 
+@phdthesis{Antartica_Data,
+title={An Algorithmic Framework for Visualising and Exploring Multidimensional Data},
+author={Ross, Greg},
+year={2005}}
+
+%========================================================================================
 % From example
 @Misc{JChoco,
 title = {{CHOCO Solver}},
@@ -65,8 +71,8 @@ title = {{New Methods to Color the Vertices of a Graph}},
 journal = "Communications of the ACM",
 volume = 22,
 number = 4,
-pages = {251-256}, 
-year = 1979} 
+pages = {251-256},
+year = 1979}
 
 @article{welshPowell,
 author = "D.J.A. Welsh and M.B. Powell",
@@ -74,8 +80,8 @@ title = {{An upper bound for the chromatic number of a graph and its application
 journal = "The Computer Journal",
 volume = 10,
 number = 1,
-pages = {85-86}, 
-year = 1967} 
+pages = {85-86},
+year = 1967}
 
 @article{matulaBeck,
 author = "David W. Matula and Lelan L. Beck",
@@ -83,8 +89,8 @@ title = {{Smallest-Last Ordering and Clustering and Graph Coloring Algorithms}},
 journal ="Journal of the Association for Computing Machinery",
 volume = 30,
 number = 3,
-pages = {417-427}, 
-year = 1983} 
+pages = {417-427},
+year = 1983}
 
 @article{freuder,
 author = "Eugene C. Freuder",
@@ -92,32 +98,32 @@ title = {{A Sufficient Condition for Backtrack-Free Search}},
 journal ="Journal of the Association for Computing Machinery",
 volume = 29,
 number = 1,
-pages = {24-32}, 
-year = 1982} 
+pages = {24-32},
+year = 1982}
 
 @article{wood97,
 author = "David R. Wood",
 title = {{An algorithm for finding a maximum clique in a graph}},
 journal = "Operations Research Letters",
 volume = 21,
-pages = {211-217}, 
-year = 1997} 
+pages = {211-217},
+year = 1997}
 
 @article{carraghanPardalos90,
 author = "Randy Carraghan and Panos M. Pardalos",
 title = {{An exact algorithm for the maximum clique problem}},
 journal = "Operations Research Letters",
 volume = 9,
-pages = {375-382}, 
-year = 1990} 
+pages = {375-382},
+year = 1990}
 
 @article{pardalosRodgers92,
 author = "Panos M. Pardalos and Gregory P. Rodgers",
 title = {{A Branch and Bound Algorithm for the Maximum Clique Problem}},
 journal = "Computers and Operations Research",
 volume = 19,
-pages = {363-375}, 
-year = 1992} 
+pages = {363-375},
+year = 1992}
 
 @inproceedings{geelen,
     author = {P. A. Geelen},
@@ -138,16 +144,16 @@ title = {Principles of Artificial Intelligence},
 publisher = {Springer-Verlag},
 year = 1982}
 
-@inproceedings{ckt, 
-  author = {Peter Cheeseman and Bob Kanefsky and William M. Taylor},  
+@inproceedings{ckt,
+  author = {Peter Cheeseman and Bob Kanefsky and William M. Taylor},
   year = 1991,
   title = {{Where the really hard problems are}},
   pages = "331-337",
   booktitle = {Proceedings {IJCAI'91}}
 }
 
-@inproceedings{kappa, 
-  author = {Ian P. Gent and Ewan MacIntyre and Patrick Prosser and Toby Walsh},  
+@inproceedings{kappa,
+  author = {Ian P. Gent and Ewan MacIntyre and Patrick Prosser and Toby Walsh},
   year = 1996,
   title = {{The constrainednss of search}},
   pages = "246-252",
@@ -160,7 +166,7 @@ author = "Brian Hayes",
 title = "Can't get no satisfaction",
 journal = "American Scientist",
 volume = 85,
-pages = "108-112", 
+pages = "108-112",
 year = 1997}
 
 @article{vardi,
@@ -219,8 +225,8 @@ year = "2009",
    year      = {2008}
 }
 
-@inproceedings{cp10wshop, 
-  author = {Patrick Prosser},  
+@inproceedings{cp10wshop,
+  author = {Patrick Prosser},
   year = 2010,
   title = {{Triangle Packing with Constraint Programming}},
   pages = "1-15",
@@ -243,8 +249,8 @@ year = "2009",
    year      = {2011}
 }
 
-@inproceedings{cp96, 
-  author = {Ian P. Gent and Ewan MacIntyre and Patrick Prosser and Barbara M. Smith and Toby Walsh},  
+@inproceedings{cp96,
+  author = {Ian P. Gent and Ewan MacIntyre and Patrick Prosser and Barbara M. Smith and Toby Walsh},
   year = 1996,
   title = {{An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint satisfaction Problem}},
   pages = "179-193",
@@ -268,7 +274,7 @@ title = {Algorithm 457: Finding All Cliques of an Undirected Graph [H]},
 journal = "Communications of the ACM",
 volume = 16,
 number = 9,
-pages = "575-579", 
+pages = "575-579",
 year = 1973}
 
 @article{prjo2002,
@@ -276,14 +282,14 @@ author = {Patric R. J. \"{O}sterg\aa{}rd},
 title = {A fast algorithm for the maximum clique problem},
 journal = "Discrete Applied Mathematics",
 volume = 120,
-pages = "197-207", 
+pages = "197-207",
 year = 2002}
 
 @inproceedings{tomita2010,
 author = {E. Tomita and Y. Sutani and T. Higashi and S. Takahashi and M. Wakatsuki},
 title = {A Simple and Faster Branch-and-Bound Algorithm for Finding Maximum Clique},
 booktitle = {WALCOM 2010, LNCS 5942},
-pages = "191-203", 
+pages = "191-203",
 year = 2010}
 
 @article{tomita2007,
@@ -332,11 +338,11 @@ year = 2006}
 }
 
 @article{Konc_Janezic_2007,
-title={An improved branch and bound algorithm for the maximum clique problem}, 
-volume={58}, 
-journal={MATCH Communications in Mathematical and Computer Chemistry}, 
-author={Janez Konc and Du\u{s}anka Jane\u{z}i\u{c}}, 
-year={2007}, 
+title={An improved branch and bound algorithm for the maximum clique problem},
+volume={58},
+journal={MATCH Communications in Mathematical and Computer Chemistry},
+author={Janez Konc and Du\u{s}anka Jane\u{z}i\u{c}},
+year={2007},
 pages={569--590}}
 
 @INPROCEEDINGS{aaai2010,
@@ -357,22 +363,22 @@ YEAR = {2010}  }
 author = {E. Tomita and Y. Sutani and T. Higashi and S. Takahashi and M. Wakatsuki},
 title = {An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique},
 booktitle = {DMTC 2003, LNCS 2731},
-pages = "278-289", 
+pages = "278-289",
 year = 2003}
 
 @inproceedings{eppstein2011,
 author = {David Eppstein and Darren Strash},
 title = {Listing All Maximal Cliques in Large Sparse Real-World Graphs},
 booktitle = {Experimental Algorithms, LNCS 6630},
-pages = "364-375", 
+pages = "364-375",
 year = 2011}
 
 @article{maffray1999,
-title={{Sequential colorings and perfect graphs}}, 
-volume={94}, 
-journal={Discrete Applied Mathematics}, 
+title={{Sequential colorings and perfect graphs}},
+volume={94},
+journal={Discrete Applied Mathematics},
 author={Fr\'{e}d\'{e}ric Maffray and Myriam Preissmann},
-year={1998}, 
+year={1998},
 pages={287--296}}
 
 @book{cadenhead,
@@ -384,7 +390,7 @@ year = 2011}
 @article{qsort,
 author = {Jon L. Bentley and M. Douglas McIlroy},
 title = {{Engineering a Sort Function}},
-journal = {Software-Practice and Experience}, 
+journal = {Software-Practice and Experience},
 volume = 23,
 number = 11,
 pages = {1249-1265},