feat: batch add 14 reduction rules (hard rules phase 2)

docs/paper/references.bib

@@ -164,6 +164,17 @@ @article{brucker1977
   doi     = {10.1016/S0167-5060(08)70743-X}
 }
 
+@incollection{brucker1978clustering,
+  author    = {Peter Brucker},
+  title     = {On the Complexity of Clustering Problems},
+  booktitle = {Optimization and Operations Research},
+  series    = {Lecture Notes in Economics and Mathematical Systems},
+  volume    = {157},
+  pages     = {45--54},
+  publisher = {Springer},
+  year      = {1978}
+}
+
 @article{lawler1977,
   author  = {Eugene L. Lawler},
   title   = {A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness},
@@ -242,6 +253,28 @@ @book{garey1979
   year      = {1979}
 }
 
+@article{orlin1977,
+  author  = {James B. Orlin},
+  title   = {Contentment in Graph Theory: Covering Graphs with Cliques},
+  journal = {Indagationes Mathematicae (Proceedings)},
+  volume  = {80},
+  number  = {5},
+  pages   = {406--424},
+  year    = {1977},
+  doi     = {10.1016/1385-7258(77)90055-5}
+}
+
+@article{kouStockmeyerWong1978,
+  author  = {Lawrence T. Kou and Larry J. Stockmeyer and C. K. Wong},
+  title   = {Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs},
+  journal = {Communications of the ACM},
+  volume  = {21},
+  number  = {2},
+  pages   = {135--139},
+  year    = {1978},
+  doi     = {10.1145/359340.359346}
+}
+
 @article{galilMegiddo1977,
   author  = {Zvi Galil and Nimrod Megiddo},
   title   = {Cyclic Ordering is NP-Complete},