T. Anderson, J. Loftus, N. Rampersad, N. Santean, and J. Shallit, Detecting palindromes, patterns and borders in regular languages, Inf. Comput, vol.207, issue.11, pp.1096-1118, 2009.

H. Bodlaender, P. Heggernes, and D. Lokshtanov, Graph Modification Problems (Dagstuhl Seminar 14071, 2014.

S. A. Cook, The Complexity of Theorem-Proving Procedures, Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp.151-158, 1971.

G. Cormode and S. Muthukrishnan, The String Edit Distance Matching Problem With Moves, ACM Transactions on Algorithms (TALG), vol.3, issue.1, pp.1-2, 2007.

E. Eiben, R. Ganian, D. Knop, and S. Ordyniak, Unary integer linear programming with structural restrictions, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, pp.1284-1290, 2018.

P. Van-emde-boas, The Convenience of Tilings, Lecture Notes in Pure and Applied Mathematics, pp.331-363, 1997.

R. Ganian and S. Ordyniak, The complexity landscape of decompositional parameters for ILP, Artif. Intell, vol.257, pp.61-71, 2018.

X. Gao, B. Xiao, D. Tao, and X. Li, A survey of graph edit distance, Pattern Analysis and Applications, vol.13, issue.1, pp.113-129, 2010.

D. Güler, A. Krebs, K. J. Lange, and P. Wolf, Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy, International Conference on Language and Automata Theory and Applications, pp.156-168, 2018.

M. Hladík, Interval linear programming: A survey, Linear Programming -New Frontiers in Theory and Applications, pp.85-120, 2012.

K. J. Lange and K. Reinhardt, Set automata, Combinatorics, Complexity and Logic; Proceedings of the DMTCS'96, 1996.

V. S. Lempitsky, P. Kohli, C. Rother, and T. Sharp, Image Segmentation with A Bounding Box Prior, ICCV, pp.277-284, 2009.

H. Li, Two-View Motion Segmentation from Linear Programming Relaxation, Computer Vision and Pattern Recognition, pp.1-8, 2007.

Y. Liu, J. Wang, and J. Guo, An Overview of Kernelization Algorithms for Graph Modification Problems, Tsinghua Science and Technology, vol.19, issue.4, pp.346-357, 2014.

A. A. Rubtsov, Regular realizability problems and regular languages, 2015.

A. A. Rubtsov and M. N. Vyalyi, Regular realizability problems and models of a generalized nondeterminism, 2011.

S. P. Tarasov and M. N. Vyalyi, Orbits of linear maps and regular languages, Computer Science -Theory and Applications -6th International Computer Science Symposium in Russia, pp.305-316, 2011.

M. N. Vyalyi, On models of a nondeterministic computation, Computer Science -Theory and Applications, Fourth International Computer Science Symposium in Russia, pp.334-345, 2009.

M. N. Vyalyi, On regular realizability problems, Probl. Inf. Transm, vol.47, issue.4, pp.342-352, 2011.

M. N. Vyalyi, On expressive power of regular realizability problems, Probl. Inf. Transm, vol.49, issue.3, pp.276-291, 2013.

M. N. Vyalyi and A. A. Rubtsov, On regular realizability problems for context-free languages, Probl. Inf. Transm, vol.51, issue.4, pp.349-360, 2015.

K. Wagner and G. Wechsung, Computational Complexity, 1986.

P. Wolf, Decidability of the Regular Intersection Emptiness Problem, 2018.