1. Caprara, A., Lodi, A., & Rizzi, R. (2004). On $$d$$-threshold graphs and $$d$$-dimensional bin packing. Networks, 44(4), 266–280.
2. Chvátal, V., & Hammer, P. (1977). Aggregation of inequalities in integer programming. Annals of Discrete Mathematics, 1, 145–162.
3. Gurski, F., & Rehs, C. (2017). Counting and Enumerating Independent Sets with Applications to Knapsack Problems.
arXiv: 1710.08953
4. Hagberg, A., Swart, P., & Schult, D. (2006). Designing threshold networks with given structural and dynamical properties. Physical Review E, 056116, 00.
5. Heggernes, P., & Kratsch, D. (2007). Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nordic Journal of Computing, 14(1–2), 87–108.