{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T05:25:56Z","timestamp":1703222756388},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf02276883","type":"journal-article","created":{"date-parts":[[2005,12,9]],"date-time":"2005-12-09T07:55:05Z","timestamp":1134114905000},"page":"371-388","source":"Crossref","is-referenced-by-count":5,"title":["A general approach to avoiding two by two submatrices"],"prefix":"10.1007","volume":"52","author":[{"given":"V.","family":"Deineko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Rudolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02276883_CR1","first-page":"1","volume-title":"Proceedings of the First IPCO Conference","author":"A. A. Ageev","year":"1990","unstructured":"Ageev, A. A., Beresnev, V. L.: Polynomially solvable special cases of the simple plant location problem. In: Kannan, R., Pulleyblank, W. R. (eds.) Proceedings of the First IPCO Conference, pp. 1\u20136. Waterloo: Waterloo University Press 1990."},{"key":"BF02276883_CR2","first-page":"3","volume":"19","author":"V. L. Beresnev","year":"1979","unstructured":"Beresnev, V. L., Davydov, A. I.: On matrices with the connectedness property, Upravlyaemye sistemy19, 3\u201313 (1979) [in Russian].","journal-title":"Upravlyaemye sistemy"},{"key":"BF02276883_CR3","first-page":"273","volume":"6","author":"R. E. Burkard","year":"1990","unstructured":"Burkard, R. E.: Special cases of travelling salesman problems and heuristics, Acta Math. Appl. Sinica6, 273\u2013288 (1990).","journal-title":"Acta Math. Appl. Sinica"},{"key":"BF02276883_CR4","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1080\/02331939108843720","volume":"22","author":"R. E. Burkard","year":"1991","unstructured":"Burkard, R. E., van der Veen, J.: Universal conditions for algebraic travelling salesman problems to be efficiently solvable. Optimization22, 787\u2013814 (1991).","journal-title":"Optimization"},{"key":"BF02276883_CR5","volume-title":"On the reconstruction of specially structured matrices. Aktualnyje Problemy EVM, programmirovanije","author":"V. G. Deineko","year":"1979","unstructured":"Deineko, V. G., Filonenko, V. L.: On the reconstruction of specially structured matrices. Aktualnyje Problemy EVM, programmirovanije, Dnepropetrovsk, DGU, 1979 [in Russian]."},{"key":"BF02276883_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-completeness. San Francisco: Freeman 1979."},{"key":"BF02276883_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0166-218X(92)90294-K","volume":"35","author":"W. Gutjahr","year":"1992","unstructured":"Gutjahr, W., Welzl, E., Woeginger, G. J.: Polynomial graph-colorings, Discrete Appl. Math.35, 29\u201345 (1992).","journal-title":"Discrete Appl. Math."},{"key":"BF02276883_CR8","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0606070","volume":"6","author":"A. J. Hoffman","year":"1985","unstructured":"Hoffman, A. J., Kolen, A. W. J., Sakarovitsch, M.: Totally-balanced and greedy matrices. SIAM J. Algebraic Discrete Methods6, 721\u2013730 (1985).","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF02276883_CR9","series-title":"Report 234-92","volume-title":"Permuting matrices to avoid forbidden submatrices","author":"B. Klinz","year":"1992","unstructured":"Klinz, B., Rudolf, R., Woeginger, G. J.: Permuting matrices to avoid forbidden submatrices. Report 234-92, Mathematical Institute, TU Graz, Austria, 1992."},{"key":"BF02276883_CR10","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-57273-2_60","volume":"726","author":"B. Klinz","year":"1993","unstructured":"Klinz, B., Rudolf, R., Woeginger, G. J.: On the recognition of permuted bottleneck Monge matrices, to appear in Discrete Appl. Math. [A preliminary version appeared in Lecture Notes in Computer Science726, 248\u2013259 (1993)].","journal-title":"A preliminary version appeared in Lecture Notes in Computer Science"},{"key":"BF02276883_CR11","volume-title":"Elements of the Theory of Computation","author":"H. R. Lewis","year":"1981","unstructured":"Lewis, H. R., Papadimitriou C. H.: Elements of the Theory of Computation. New York: Prentice-Hall 1981."},{"key":"BF02276883_CR12","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1137\/0216057","volume":"16","author":"A. Lubiw","year":"1987","unstructured":"Lubiw, A.: Doubly lexical orderings of matrices. SIAM J. Comput.16, 854\u2013879 (1987).","journal-title":"SIAM J. Comput."},{"key":"BF02276883_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69897-2","volume-title":"Data structures and algorithms 2: graph algorithms and NP-completeness","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn K.: Data structures and algorithms 2: graph algorithms and NP-completeness. Berlin Heidelberg New York Tokyo: Springer 1984."},{"key":"BF02276883_CR14","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige R., Tarjan, R. E.: Three partition refinement algorithms, SIAM J. Comput.16, 973\u2013989 (1987).","journal-title":"SIAM J. Comput."},{"key":"BF02276883_CR15","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(91)90118-2","volume":"40","author":"J. K. Park","year":"1991","unstructured":"Park, J. K.: A special case of then-vertex traveling salesman problem that can be solved inO(n) time. Inform. Proc. Lett.40, 247\u2013254 (1991).","journal-title":"Inform. Proc. Lett."},{"key":"BF02276883_CR16","doi-asserted-by":"crossref","first-page":"179","DOI":"10.2307\/1970124","volume":"66","author":"F. Supnick","year":"1957","unstructured":"Supnick, F.: Extreme hamiltonian lines. Ann. Math.66, 179\u2013201 (1957).","journal-title":"Ann. Math."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02276883.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02276883\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02276883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:28:34Z","timestamp":1557944914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02276883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF02276883"],"URL":"https:\/\/doi.org\/10.1007\/bf02276883","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}