{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:45:31Z","timestamp":1725839131858},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_15","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"165-175","source":"Crossref","is-referenced-by-count":4,"title":["Obtaining a Triangular Matrix by Independent Row-Column Permutations"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[]},{"given":"Irena","family":"Rusu","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107325708","volume-title":"Combinatorial Matrix Theory","author":"RA Brualdi","year":"1991","unstructured":"Brualdi, R.A., Ryser, H.J.: Combinatorial Matrix Theory. Cambridge University Press, New York (1991)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceeding 3rd Annual ACM Symposium on Theory of Computing, pp. 151\u2013158. ACM, New York (1971)","DOI":"10.1145\/800157.805047"},{"issue":"1\u20133","key":"15_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0166-218X(98)00066-3","volume":"88","author":"B DasGupta","year":"1998","unstructured":"DasGupta, B., Jiang, T., Kannan, S., Li, M., Sweedyk, E.: On the complexity and approximation of syntenic distance. Discrete Appl. Math. 88(1\u20133), 59\u201382 (1998)","journal-title":"Discrete Appl. Math."},{"key":"15_CR4","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore and London (1996)","edition":"3"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1080\/00949657508810125","volume":"4","author":"JE Hopcroft","year":"1975","unstructured":"Hopcroft, J.E., Karp, R.M.: An \n \n \n \n $${O}(n^{2.5})$$\n algorithm for matching in bipartite graphs. SIAM J. Comput. 4, 225\u2013231 (1975)","journal-title":"SIAM J. Comput."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Wilf, H.S.: On crossing numbers, and some unsolved problems. In: Bollob\u00e1s, B., Thomason, A. (eds.) Combinatorics, Geometry and Probability: A Tribute to Paul Erd\u00f6s, pp. 557\u2013562. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511662034.049"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T17:59:45Z","timestamp":1559325585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}
