{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:10:02Z","timestamp":1767676202584,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030232467"},{"type":"electronic","value":"9783030232474"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23247-4_21","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:02:38Z","timestamp":1562540558000},"page":"272-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances"],"prefix":"10.1007","author":[{"given":"Petra","family":"Wolf","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"issue":"11","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.ic.2008.06.007","volume":"207","author":"T Anderson","year":"2009","unstructured":"Anderson, T., Loftus, J., Rampersad, N., Santean, N., Shallit, J.: Detecting palindromes, patterns and borders in regular languages. Inf. Comput. 207(11), 1096\u20131118 (2009). https:\/\/doi.org\/10.1016\/j.ic.2008.06.007","journal-title":"Inf. Comput."},{"issue":"2","key":"21_CR2","first-page":"38","volume":"4","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Heggernes, P., Lokshtanov, D.: Graph modification problems (Dagstuhl seminar 14071). Dagstuhl Rep. 4(2), 38\u201359 (2014)","journal-title":"Dagstuhl Rep."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Harrison, M.A., Banerji, R.B., Ullman, J.D. (eds.) Proceedings of 3rd Annual ACM Symposium on Theory of Computing, STOC 1971, pp. 151\u2013158. ACM, New York (1971)","DOI":"10.1145\/800157.805047"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/1186810.1186812","volume":"3","author":"G Cormode","year":"2007","unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. ACM Trans. Algorithms 3(1), 2:1\u20132:19 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Eiben, E., Ganian, R., Knop, D., Ordyniak, S.: Unary integer linear programming with structural restrictions. In: Lang, J. (ed.) Proceedings of 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, pp. 1284\u20131290 (2018)","DOI":"10.24963\/ijcai.2018\/179"},{"key":"21_CR6","series-title":"Lecture Notes in Pure and Applied Mathematics","first-page":"331","volume-title":"The Convenience of Tilings","author":"P Emde Boas van","year":"1997","unstructured":"Emde Boas van, P.: The Convenience of Tilings. Lecture Notes in Pure and Applied Mathematics, pp. 331\u2013363. Marcel Dekker Inc., New York (1997)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.artint.2017.12.006","volume":"257","author":"R Ganian","year":"2018","unstructured":"Ganian, R., Ordyniak, S.: The complexity landscape of decompositional parameters for ILP. Artif. Intell. 257, 61\u201371 (2018)","journal-title":"Artif. Intell."},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. PAA Pattern Anal. Appl. 13(1), 113\u2013129 (2010). https:\/\/doi.org\/10.1007\/s10044-008-0141-y","journal-title":"PAA Pattern Anal. Appl."},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-77313-1_12","volume-title":"Language and Automata Theory and Applications","author":"D G\u00fcler","year":"2018","unstructured":"G\u00fcler, D., Krebs, A., Lange, K.-J., Wolf, P.: Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy. In: Klein, S.T., Mart\u00edn-Vide, C., Shapira, D. (eds.) LATA 2018. LNCS, vol. 10792, pp. 156\u2013168. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77313-1_12"},{"key":"21_CR10","unstructured":"Hlad\u00edk, M.: Interval linear programming: a survey. In: Mann, Z.A. (ed.) Linear Programming \u2013 New Frontiers in Theory and Applications, Chap. 2, pp. 85\u2013120. Nova Science Publishers, New York (2012)"},{"key":"21_CR11","unstructured":"Lange, K., Reinhardt, K.: Set automata. In: Combinatorics, Complexity and Logic; Proceeding, DMTCS 1996, pp. 321\u2013329 (1996)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Lempitsky, V.S., Kohli, P., Rother, C., Sharp, T.: Image segmentation with a bounding box prior. In: ICCV 2009, pp. 277\u2013284. IEEE Computer Society (2009)","DOI":"10.1109\/ICCV.2009.5459262"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Li, H.: Two-view motion segmentation from linear programming relaxation. In: Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007), pp. 1\u20138. IEEE Computer Society (2007)","DOI":"10.1109\/CVPR.2007.382975"},{"issue":"4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/TST.2014.6867517","volume":"19","author":"Y Liu","year":"2014","unstructured":"Liu, Y., Wang, J., Guo, J.: An overview of kernelization algorithms for graph modification problems. Tsinghua Sci. Technol. 19(4), 346\u2013357 (2014)","journal-title":"Tsinghua Sci. Technol."},{"key":"21_CR15","unstructured":"Rubtsov, A.A.: Regular realizability problems and regular languages. CoRR abs\/1503.05879 (2015). http:\/\/arxiv.org\/abs\/1503.05879"},{"key":"21_CR16","unstructured":"Rubtsov, A.A., Vyalyi, M.N.: Regular realizability problems and models of a generalized nondeterminism. CoRR abs\/1105.5894 (2011). http:\/\/arxiv.org\/abs\/1105.5894"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-20712-9_24","volume-title":"Computer Science \u2013 Theory and Applications","author":"S Tarasov","year":"2011","unstructured":"Tarasov, S., Vyalyi, M.: Orbits of linear maps and regular languages. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol. 6651, pp. 305\u2013316. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20712-9_24"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-03351-3_31","volume-title":"Computer Science - Theory and Applications","author":"MN Vyalyi","year":"2009","unstructured":"Vyalyi, M.N.: On models of a nondeterministic computation. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol. 5675, pp. 334\u2013345. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03351-3_31"},{"issue":"4","key":"21_CR19","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1134\/S003294601104003X","volume":"47","author":"MN Vyalyi","year":"2011","unstructured":"Vyalyi, M.N.: On regular realizability problems. Probl. Inf. Transm. 47(4), 342\u2013352 (2011)","journal-title":"Probl. Inf. Transm."},{"issue":"3","key":"21_CR20","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1134\/S0032946013030058","volume":"49","author":"MN Vyalyi","year":"2013","unstructured":"Vyalyi, M.N.: On expressive power of regular realizability problems. Probl. Inf. Transm. 49(3), 276\u2013291 (2013). https:\/\/doi.org\/10.1134\/S0032946013030058","journal-title":"Probl. Inf. Transm."},{"issue":"4","key":"21_CR21","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1134\/S0032946015040043","volume":"51","author":"MN Vyalyi","year":"2015","unstructured":"Vyalyi, M.N., Rubtsov, A.A.: On regular realizability problems for context-free languages. Probl. Inf. Transm. 51(4), 349\u2013360 (2015). https:\/\/doi.org\/10.1134\/S0032946015040043","journal-title":"Probl. Inf. Transm."},{"key":"21_CR22","volume-title":"Computational Complexity","author":"K Wagner","year":"1986","unstructured":"Wagner, K., Wechsung, G.: Computational Complexity. Springer, Netherlands (1986)"},{"key":"21_CR23","unstructured":"Wolf, P.: Decidability of the regular intersection emptiness problem. Master\u2019s thesis, Wilhelm Schickhard Institut f\u00fcr Informatik, Universit\u00e4t T\u00fcbingen (2018)"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23247-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T06:50:50Z","timestamp":1739343050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23247-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232467","9783030232474"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23247-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ko\u0161ice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/dcfs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"there are also 4 invited talks","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}