{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:16:15Z","timestamp":1773274575704,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642207112","type":"print"},{"value":"9783642207129","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20712-9_29","type":"book-chapter","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T00:05:22Z","timestamp":1307750722000},"page":"373-384","source":"Crossref","is-referenced-by-count":3,"title":["A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Blin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"29_CR1","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1287\/opre.28.5.1074","volume":"28","author":"J.J. Bartholdi","year":"1980","unstructured":"Bartholdi, J.J., Orlin, J.B., Ratliff, H.D.: Cyclic scheduling via integer programs with circular ones. Oper Res.\u00a028(5), 1074\u20131085 (1980)","journal-title":"Oper Res."},{"key":"29_CR2","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-30219-3_2","volume-title":"Algorithms in Bioinformatics","author":"A. Bergeron","year":"2004","unstructured":"Bergeron, A., Blanchette, M., Chateau, A., Chauve, C.: Reconstructing ancestral gene orders using conserved intervals. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 14\u201325. Springer, Heidelberg (2004)"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-13962-8_8","volume-title":"Programs, Proofs, Processes","author":"G. Blin","year":"2010","unstructured":"Blin, G., Rizzi, R., Vialette, S.: A Faster Algorithm for Finding Minimum Tucker Submatrices. In: Ferreira, F., L\u00f6we, B., Mayordomo, E., Mendes Gomes, L. (eds.) CiE 2010. LNCS, vol.\u00a06158, pp. 69\u201377. Springer, Heidelberg (2010)"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. System Sci.\u00a013, 335\u2013379 (1976)","journal-title":"J. Comput. System Sci."},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-04744-2_5","volume-title":"Comparative Genomics","author":"C. Chauve","year":"2009","unstructured":"Chauve, C., Haus, U.-U., Stephen, T., You, V.P.: Minimal conflicting sets for the consecutive ones property in ancestral genome reconstruction. In: Ciccarelli, F.D., Mikl\u00f3s, I. (eds.) RECOMB-CG 2009. LNCS, vol.\u00a05817, pp. 48\u201358. Springer, Heidelberg (2009)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01581196","volume":"55","author":"M. Conforti","year":"1992","unstructured":"Conforti, M., Rao, M.R.: Structural properties and decomposition of linear balanced matrices. Mathematical Programming\u00a055, 129\u2013168 (1992)","journal-title":"Mathematical Programming"},{"key":"29_CR7","series-title":"Graduate texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. Graduate texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2000)","edition":"2"},{"key":"29_CR8","first-page":"27","volume":"98","author":"M. Dom","year":"2009","unstructured":"Dom, M.: Algorithmic aspects of the consecutive-ones property. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS\u00a098, 27\u201359 (2009)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"},{"key":"29_CR9","unstructured":"Dom, M.: Recognition, Generation, and Application of Binary Matrices with the Consecutive-Ones Property. Dissertation. Cuvillier, Institut f\u00fcr Informatik, Friedrich-Schiller-Universit\u00e4t Jena (2009)"},{"key":"29_CR10","unstructured":"Dom, M., Guo, J., Niedermeier, R.: Approximation and fixed-parameter algorithms for consecutive ones submatrix problems. Journal of Computer and System Sciences (2009) (in Press, Corrected Proof)"},{"issue":"3","key":"29_CR11","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math.\u00a015(3), 835\u2013855 (1965)","journal-title":"Pacific J. Math."},{"issue":"12","key":"29_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M. Habib","year":"2000","unstructured":"Habib, M., McConnell, R.M., Paul, C., Viennot, L.: Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoret. Comput. Sci.\u00a0234(12), 59\u201384 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(91)90011-K","volume":"30","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics\u00a030(1), 29\u201342 (1991)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"29_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.disopt.2006.02.002","volume":"3","author":"D.S. Hochbaum","year":"2006","unstructured":"Hochbaum, D.S., Levin, A.: Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. Discrete Optimization\u00a03(4), 327\u2013340 (2006)","journal-title":"Discrete Optimization"},{"issue":"1","key":"29_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.2001.1205","volume":"43","author":"W.-L. Hsu","year":"2002","unstructured":"Hsu, W.-L.: A simple test for the consecutive ones property. J. Algorithms\u00a043(1), 1\u201316 (2002)","journal-title":"J. Algorithms"},{"issue":"1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(02)00435-8","volume":"296","author":"W.-L. Hsu","year":"2003","unstructured":"Hsu, W.-L., McConnell, R.M.: Pc trees and circular-ones arrangements. Theoret. Comput. Sci.\u00a0296(1), 99\u2013116 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"29_CR17","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0218005","volume":"18","author":"N. Korte","year":"1989","unstructured":"Korte, N., M\u00f6hring, R.H.: An incremental linear-time algorithm for recognizing interval graphs. SIAM J. Comput.\u00a018(1), 68\u201381 (1989)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"29_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/0206004","volume":"6","author":"L.T. Kou","year":"1977","unstructured":"Kou, L.T.: Polynomial complete consecutive information retrieval problems. SIAM J. Comput.\u00a06(1), 67\u201375 (1977)","journal-title":"SIAM J. Comput."},{"key":"29_CR19","unstructured":"McConnell, R.M.: A certifying algorithm for the consecutive-ones property. In: 15th Annual ACM SIAM Symposium on Discrete Algorithms SODA 2004, pp. 768\u2013777. ACM Press, New York (2004)"},{"key":"29_CR20","unstructured":"Mecke, S., Sch\u00f6bel, A., Wagner, D.: Station location complexity and approximation. In: 5th Workshop on Algorithmic Methods and Models for Optimization of Railways ATMOS 2005, Dagstuhl, Germany (2005)"},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/978-3-540-30140-0_67","volume-title":"Algorithms \u2013 ESA 2004","author":"S. Mecke","year":"2004","unstructured":"Mecke, S., Wagner, D.: Solving geometric covering problems by data reduction. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 760\u2013771. Springer, Heidelberg (2004)"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0166-218X(98)00078-X","volume":"88","author":"J. Meidanis","year":"1998","unstructured":"Meidanis, J., Porto, O., Telles, G.P.: On the consecutive ones property. Discrete Appl. Math.\u00a088, 325\u2013354 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"18","key":"29_CR23","doi-asserted-by":"publisher","first-page":"3721","DOI":"10.1016\/j.dam.2009.08.001","volume":"157","author":"N.S. Narayanaswamy","year":"2009","unstructured":"Narayanaswamy, N.S., Subashini, R.: A new characterization of matrices with the consecutive ones property. Discrete Applied Mathematics\u00a0157(18), 3721\u20133727 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"29_CR24","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.disopt.2004.07.002","volume":"1","author":"N. Ruf","year":"2004","unstructured":"Ruf, N., Sch\u00f6bel, A.: Set covering with almost consecutive ones property. Discrete Optimization\u00a01(2), 215\u2013228 (2004)","journal-title":"Discrete Optimization"},{"issue":"3","key":"29_CR25","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1109\/TCBB.2008.135","volume":"6","author":"J. Stoye","year":"2009","unstructured":"Stoye, J., Wittler, R.: A unified approach for reconstructing ancient gene clusters. IEEE\/ACM Trans. Comput. Biol. Bioinf.\u00a06(3), 387\u2013400 (2009)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"29_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"J.W. Suurballe","year":"1974","unstructured":"Suurballe, J.W.: Disjoint paths in networks. Networks\u00a04, 125\u2013145 (1974)","journal-title":"Networks"},{"key":"29_CR27","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(72)90019-6","volume":"12","author":"A.C. Tucker","year":"1972","unstructured":"Tucker, A.C.: A structure theorem for the consecutive 1s property. Journal of Combinatorial Theory. Series B\u00a012, 153\u2013162 (1972)","journal-title":"Journal of Combinatorial Theory. Series B"},{"key":"29_CR28","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1287\/opre.10.4.518","volume":"10","author":"A.F. Veinott","year":"1962","unstructured":"Veinott, A.F., Wagner, H.M.: Optimal capacity scheduling. Oper. Res.\u00a010, 518\u2013547 (1962)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20712-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T12:46:16Z","timestamp":1553777176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20712-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207112","9783642207129"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20712-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}