diff -r cd72eae05bdf -r 3c00344f49c9 doc/references.bib
--- a/doc/references.bib	Mon Jul 16 16:21:40 2018 +0200
+++ b/doc/references.bib	Wed Oct 17 19:14:07 2018 +0200
@@ -4,8 +4,7 @@
   key =          {LEMON},
   title =        {{LEMON} -- {L}ibrary for {E}fficient {M}odeling and
                   {O}ptimization in {N}etworks},
-  howpublished = {\url{http://lemon.cs.elte.hu/}},
-  year =         2009
+  howpublished = {\url{http://lemon.cs.elte.hu/}}
 }
 
 @misc{egres,
@@ -23,6 +22,28 @@
 }
 
 
+%%%%% Papers related to LEMON %%%%%
+
+@article{DezsoJuttnerKovacs11Lemon,
+  author =       {B. Dezs{\H o} and A. J\"uttner and P. Kov\'acs},
+  title =        {{LEMON} -- an open source {C++} graph template library},
+  journal =      {Electronic Notes in Theoretical Computer Science},
+  volume =       {264},
+  pages =        {23--45},
+  year =         {2011},
+  note =         {Proc. 2nd Workshop on Generative Technologies}
+}
+
+@article{KiralyKovacs12MCF,
+  author =       {Z. Kir\'aly and P. Kov\'acs},
+  title =        {Efficient implementations of minimum-cost flow algorithms},
+  journal =      {Acta Universitatis Sapientiae, Informatica},
+  year =         {2012},
+  volume =       {4},
+  pages =        {67--118}
+}
+
+
 %%%%% Other libraries %%%%%%
 
 @misc{boost,
@@ -213,6 +234,16 @@
   pages =        {309-311}
 }
 
+@article{hartmann93finding,
+  author =       {Mark Hartmann and James B. Orlin},
+  title =        {Finding minimum cost to time ratio cycles with small
+                  integral transit times},
+  journal =      {Networks},
+  year =         1993,
+  volume =       23,
+  pages =        {567-574}
+}
+
 @article{dasdan98minmeancycle,
   author =       {Ali Dasdan and Rajesh K. Gupta},
   title =        {Faster Maximum and Minimum Mean Cycle Alogrithms for
@@ -225,6 +256,17 @@
   pages =        {889-899}
 }
 
+@article{dasdan04experimental,
+  author =       {Ali Dasdan},
+  title =        {Experimental analysis of the fastest optimum cycle
+                  ratio and mean algorithms},
+  journal =      {ACM Trans. Des. Autom. Electron. Syst.},
+  year =         2004,
+  volume =       9,
+  issue =        4,
+  pages =        {385-418}
+} 
+
 
 %%%%% Minimum cost flow algorithms %%%%%
 
@@ -297,5 +339,18 @@
   school =       {University College},
   address =      {Dublin, Ireland},
   year =         1991,
-  month =        sep,
+  month =        sep
 }
+
+%%%%% Other algorithms %%%%%
+
+@article{grosso08maxclique,
+  author =       {Andrea Grosso and Marco Locatelli and Wayne Pullan},
+  title =        {Simple ingredients leading to very efficient
+                  heuristics for the maximum clique problem},
+  journal =      {Journal of Heuristics},
+  year =         2008,
+  volume =       14,
+  number =       6,
+  pages =        {587--612}
+}