From f587b24038f9e30b125a530726c34e0e49d54035 Mon Sep 17 00:00:00 2001
From: Shalin Shah <shah.shalin@gmail.com>
Date: Sat, 20 Jul 2019 09:53:42 -0700
Subject: [PATCH] Update README.md

---
 README.md | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/README.md b/README.md
index 80f5208..713392d 100644
--- a/README.md
+++ b/README.md
@@ -15,6 +15,9 @@ This algorithm performs the following steps:
 
 Instances are available <a href="http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm">here</a> and <a href="http://iridia.ulb.ac.be/~fmascia/maximum_clique/DIMACS-benchmark">here (DIMACS)</a>. Please remove all comments and other extraneous text from the graph text instance file.
 
+<b>Cited By:</b><ul><li>Choi, Jang-Ho, et al. "Distributed coordination of IoT-based services by using a graph coloring algorithm." Computer Software and Applications Conference (COMPSAC), 2013 IEEE 37th Annual. IEEE, 2013.</li><li>Muklason, Ahmad. "Hyper-heuristics and fairness in examination timetabling problems." Philosophy (2017)</li>
+</ul>
+
 Usage:
 	- Change Constants.FILE to the file on your disk that represents the graph
 	- Change Constants.ANNEALING_ITERATIONS to the number of iterations the algorithm should run for