1. Altmanová, K., Knop, D., Kouteckỳ, M.: Evaluating and tuning n-fold integer programming. arXiv preprint arXiv:1802.09007 (2018)
2. Aschenbrenner, M., Hemmecke, R.: Finiteness theorems in stochastic integer programming. Found. Comput. Math. 7(2), 183–227 (2007)
3. Chen, L., Marx, D.: Covering a tree with rooted subtrees–parameterized and approximation algorithms. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2801–2820. SIAM, Philadelphia (2018)
4. Chen, L., Marx, D., Ye, D., Zhang, G.: Parameterized and approximation results for scheduling with a low rank processing time matrix. In: Proceedings of the Thirty-Fourth Symposium on Theoretical Aspects of Computer Science, STACS, pp. 22:1–22:14 (2017)
5. Chen, L., Xu, L.. Shi, W.: On the graver basis of block-structured integer programming. arXiv preprint arXiv:1805.03741 (2018)