{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T01:16:54Z","timestamp":1648516614451},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,5]],"date-time":"2009-11-05T00:00:00Z","timestamp":1257379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s10479-009-0649-6","type":"journal-article","created":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T13:56:31Z","timestamp":1257342991000},"page":"287-307","source":"Crossref","is-referenced-by-count":2,"title":["On the use of graphs in discrete tomography"],"prefix":"10.1007","volume":"175","author":[{"given":"Dominique","family":"de Werra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Christine","family":"Costa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Picouleau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Ries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,5]]},"reference":[{"key":"649_CR1","volume-title":"Network flows","author":"R. K. Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows. Englewood Cliffs: Prentice-Hall."},{"key":"649_CR2","doi-asserted-by":"crossref","unstructured":"Alfandari, L., Lemalade, J.\u00a0L., Nagih, A., Plateau, G. (2009, in press). A MIP flow model for crop-rotation planning in a sustainable development context. Annals of Operations Research.","DOI":"10.1007\/s10479-009-0553-0"},{"key":"649_CR3","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-0-8176-4543-4_13","volume-title":"Advances in discrete tomography and its applications","author":"A. Alpers","year":"2007","unstructured":"Alpers, A., Rodek, L., Poulsen, H. F., Knudsen, E., & Herman, G. T. (2007). Discrete tomography for generating maps of polycrystals. In G. T. Herman & A. Kuba (Eds.), Advances in discrete tomography and its applications (pp.\u00a0271\u2013301). Boston: Birkh\u00e4user."},{"key":"649_CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M. F., & Tarjan, R. (1979). A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters, 8, 121\u2013123.","journal-title":"Information Processing Letters"},{"key":"649_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-0-8176-4543-4_9","volume-title":"Advances in discrete tomography and its applications","author":"K. J. Batenburg","year":"2007","unstructured":"Batenburg, K. J. (2007). Network flow algorithms for discrete tomography. In G. T. Herman & A. Kuba (Eds.), Advances in discrete tomography and its applications (pp.\u00a0175\u2013207). Boston: Birkh\u00e4user."},{"key":"649_CR6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/978-0-8176-4543-4_14","volume-title":"Advances in discrete tomography and its applications","author":"J. Baumann","year":"2007","unstructured":"Baumann, J., Kiss, Z., Krimmel, S., Kuba, A., Nagy, A., Rodek, L., Schillinger, B., & Stephan, J. (2007). Discrete tomography methods for nondestructive testing. In G. T. Herman & A. Kuba (Eds.), Advances in discrete tomography and its applications (pp.\u00a0303\u2013332). Boston: Birkh\u00e4user."},{"issue":"4","key":"649_CR7","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1002\/net.20218","volume":"51","author":"C. Bentz","year":"2008","unstructured":"Bentz, C., Costa, M.-C., de Werra, D., Picouleau, C., & Ries, B. (2008). On a graph coloring problem arising from discrete tomography. Networks, 51(4), 256\u2013267.","journal-title":"Networks"},{"issue":"2","key":"649_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.7155\/jgaa.00178","volume":"13","author":"C. Bentz","year":"2009","unstructured":"Bentz, C., Costa, M.-C., de Werra, D., Picouleau, C., & Ries, B. (2009). Degree-constrained edge partitioning in graphs arising from discrete tomography. Journal of Graph Algorithms and Applications, 13(2), 99\u2013118.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"649_CR9","volume-title":"Graphes","author":"C. Berge","year":"1983","unstructured":"Berge, C. (1983). Graphes. Paris: Gauthier-Villars."},{"key":"649_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.tcs.2008.07.024","volume":"406","author":"S. Brocchi","year":"2008","unstructured":"Brocchi, S., Frosini, A., & Picouleau, C. (2008). Reconstruction of binary matrices under fixed size neighborhood constraints. Theoretical Computer Science, 406, 43\u201354.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"649_CR11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0304-3975(99)00325-4","volume":"259","author":"M. Chrobak","year":"2001","unstructured":"Chrobak, M., & D\u00fcrr, C. (2001). Reconstructing polyatomic structures from X-rays: NP-completeness proof for three atoms. Theoretical Computer Science, 259(1), 81\u201398.","journal-title":"Theoretical Computer Science"},{"key":"649_CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.dam.2005.07.003","volume":"154","author":"M.-C. Costa","year":"2006","unstructured":"Costa, M.-C., de Werra, D., & Picouleau, C. (2006). Using graphs for some discrete tomography problems. Discrete Applied Mathematics, 154, 35\u201346.","journal-title":"Discrete Applied Mathematics"},{"key":"649_CR13","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.dam.2005.03.006","volume":"148","author":"M.-C. Costa","year":"2005","unstructured":"Costa, M.-C., de Werra, D., Picouleau, C., & Schindl, D. (2005). A solvable case of image reconstruction in discrete tomography. Discrete Applied Mathematics, 148, 240\u2013245.","journal-title":"Discrete Applied Mathematics"},{"key":"649_CR14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s10288-008-0077-5","volume":"6","author":"D. Werra de","year":"2008","unstructured":"de Werra, D., Costa, M.-C., Picouleau, C., & Ries, B. (2008). On the use of graphs in discrete tomography. 4OR, 6, 101\u2013123.","journal-title":"4OR"},{"key":"649_CR15","first-page":"104","volume":"52","author":"G. D\u00e9roche","year":"1986","unstructured":"D\u00e9roche, G. (1986). Guy Dupuy: sculpteur discret. Horizons d\u2019Argonne, 52, 104\u2013105.","journal-title":"Horizons d\u2019Argonne"},{"key":"649_CR16","first-page":"17","volume":"80","author":"G. D\u00e9roche","year":"2003","unstructured":"D\u00e9roche, G. (2003). Tomographie agricole des vall\u00e9es de\u00a0l\u2019Aisne et de\u00a0l\u2019Aire. Horizons d\u2019Argonne, 80, 17\u201320.","journal-title":"Horizons d\u2019Argonne"},{"issue":"3","key":"649_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(05)00258-1","volume":"151","author":"V. Ges\u00f9 Di","year":"2005","unstructured":"Di Ges\u00f9, V., & Kuba, A. (Eds.) (2005). Special issue: IWCIA 2003, ninth international workshop on combinatorial image analysis. Discrete Applied Mathematics 151(3), 1\u2013246.","journal-title":"Discrete Applied Mathematics"},{"key":"649_CR18","unstructured":"D\u00fcrr, C., Gui\u00f1ez, F., & Matamala, M. (2009). Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard. Technical report. arXiv:0904.3169 ."},{"key":"649_CR19","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., & Shamir, A. (1976). On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing, 5, 691\u2013703.","journal-title":"SIAM Journal on Computing"},{"key":"649_CR20","unstructured":"Gabow, H., Nishizeki, T., Kariv, O., Leven, D., & Tereda, O. (1985). Algorithms for edge-coloring. Technical report 41\/85, Tel Aviv University."},{"key":"649_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107341029","volume-title":"Geometric tomography","author":"R. J. Gardner","year":"2006","unstructured":"Gardner, R. J. (2006). Geometric tomography (2nd ed.). New York: Cambridge University Press.","edition":"2"},{"key":"649_CR22","volume-title":"Computer and intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. S. (1979). Computer and intractability. San Francisco: Freeman."},{"key":"649_CR23","first-page":"225","volume":"37","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., & de Werra, D. (1997). Nesticity, DIMACS series. Discrete Mathematics and Theoretical Computer Science, 37, 225\u2013232.","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"649_CR24","volume-title":"Discrete tomography: foundations, algorithms and applications","year":"1999","unstructured":"Herman, G. T., & Kuba, A. (Eds.) (1999a). Discrete tomography: foundations, algorithms and applications. Boston: Birkh\u00e4user."},{"key":"649_CR25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-1-4612-1568-4","volume-title":"Discrete tomography: foundations, algorithms and applications","author":"G. T. Herman","year":"1999","unstructured":"Herman, G. T., & Kuba, A. (1999b). Discrete tomography: a historical overview. In G. T. Herman, & A. Kuba (Eds.), Discrete tomography: foundations, algorithms and applications (pp.\u00a03\u201334). Boston: Birkh\u00e4user."},{"key":"649_CR26","volume-title":"Advances in discrete tomography and its applications","year":"2007","unstructured":"Herman, G. T., & Kuba, A. (Eds.) (2007). Advances in discrete tomography and its applications. Boston: Birkh\u00e4user."},{"key":"649_CR27","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I. (1981). NP-completeness of edge-coloring. SIAM Journal on Computing, 10, 718\u2013720.","journal-title":"SIAM Journal on Computing"},{"key":"649_CR28","doi-asserted-by":"crossref","unstructured":"Kaneko, A., & Nagahama, R. (2006). Reconstruction algorithm and switching graph for two-projection tomography with prohibited subregion. In Proc. 13th international conference on discrete geometry for computer imagery (pp.\u00a0110\u2013121). Szeged, Hungary.","DOI":"10.1007\/11907350_10"},{"key":"649_CR29","volume-title":"Matching theory","author":"L. Lovasz","year":"1986","unstructured":"Lovasz, L., & Plummer, M. (1986). Matching theory. Amsterdam: North-Holland."},{"key":"649_CR30","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1051\/forest:2004007","volume":"61","author":"R. Martinis","year":"2004","unstructured":"Martinis, R., Socco, L. V., Sambuelli, L., Nicolotti, G., Schmitt, O., & Bucur, V. (2004). Tomographie ultrasonore pour les arbres sur pied. Annals of Forest Science, 61, 157\u2013162.","journal-title":"Annals of Forest Science"},{"key":"649_CR31","doi-asserted-by":"crossref","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","volume":"9","author":"H. J. Ryser","year":"1957","unstructured":"Ryser, H. J. (1957). Combinatorial properties of matrices of zeros and ones. Canadian Journal of Mathematics, 9, 371\u2013377.","journal-title":"Canadian Journal of Mathematics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0649-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0649-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0649-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:57Z","timestamp":1559138877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0649-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,5]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["649"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0649-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,5]]}}}