{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:15:22Z","timestamp":1725887722723},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319591070"},{"type":"electronic","value":"9783319591087"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59108-7_26","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T08:43:06Z","timestamp":1494924186000},"page":"334-346","source":"Crossref","is-referenced-by-count":0,"title":["Reconstruction of Nearly Convex Colored Images"],"prefix":"10.1007","author":[{"given":"Fethi","family":"Jarray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ghassen","family":"Tlig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"3123","DOI":"10.1016\/j.tcs.2010.04.041","volume":"411","author":"A Bains","year":"2010","unstructured":"Bains, A., Biedl, T.: Reconstructing hv-convex multi-coloured polyominoes. Theor. Comput. Sci. 411, 3123\u20133128 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"3447","DOI":"10.1016\/j.dam.2009.02.019","volume":"157","author":"P Bal\u00e1zs","year":"2009","unstructured":"Bal\u00e1zs, P.: A benchmark set for the reconstruction of hv-convex discrete sets. Discrete Appl. Math. 157, 3447\u20133456 (2009)","journal-title":"Discrete Appl. Math."},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.tcs.2008.06.010","volume":"406","author":"P Bal\u00e1zs","year":"2008","unstructured":"Bal\u00e1zs, P.: A framework for generating some discrete sets with disjoint components by using uniform distributions. Theor. Comput. Sci. 406, 15\u201323 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0304-3975(94)00293-2","volume":"155","author":"E Barcucci","year":"1996","unstructured":"Barcucci, E., Del Lungo, A., Nival, M., Pinzani, R.: The reconstruction of polyominoes from their orthogonal projections. Theor. Comput. Sci. 155, 321\u2013347 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-21073-0_27","volume-title":"Combinatorial Image Analysis","author":"E Barcucci","year":"2011","unstructured":"Barcucci, E., Brocchi, S., Frosini, A.: Solving the two color problem: an heuristic algorithm. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 298\u2013310. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-21073-0_27"},{"issue":"4","key":"26_CR6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10852-012-9193-5","volume":"12","author":"A Billionnet","year":"2013","unstructured":"Billionnet, A., Jarray, F., Tlig, G., Zagrouba, E.: Reconstructing convex matrices by integer programming approaches. J. Math. Model. Algorithms OR 12(4), 329\u2013343 (2013)","journal-title":"J. Math. Model. Algorithms OR"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-319-26145-4_20","volume-title":"Combinatorial Image Analysis","author":"A Billionnet","year":"2015","unstructured":"Billionnet, A., Jarray, F., Tlig, G., Zagrouba, E.: Reconstruction of bicolored images. In: Barneva, R.P., Bhattacharya, B.B., Brimkov, V.E. (eds.) IWCIA 2015. LNCS, vol. 9448, pp. 276\u2013283. Springer, Cham (2015). doi:\n10.1007\/978-3-319-26145-4_20"},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0020-0190(99)00025-3","volume":"69","author":"M Chrobak","year":"1999","unstructured":"Chrobak, M., D\u00fcrr, C.: Reconstructing hv-convex polyominoes from orthogonal projection. Inf. Process. Lett. 69, 283\u2013289 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"26_CR9","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.: Reconstructing polyatomic structures from discrete x-ray. Theor. Comput. Sci. 259(3), 81\u201398 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.dam.2005.02.023","volume":"151","author":"G Dahl","year":"2005","unstructured":"Dahl, G., Flatberg, T.: Optimization and reconstruction of hv-convex (0, 1)-matrices. Discrete Appl. Math. 151, 93\u2013105 (2005)","journal-title":"Discrete Appl. Math."},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/978-3-642-04128-0_69","volume-title":"Algorithms - ESA 2009","author":"C D\u00fcrr","year":"2009","unstructured":"D\u00fcrr, C., Gui\u00f1ez, F., Matamala, M.: Reconstructing 3-colored grids from horizontal and vertical projections Is NP-hard. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 776\u2013787. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-04128-0_69"},{"key":"26_CR12","first-page":"1073","volume":"187","author":"D Gale","year":"1957","unstructured":"Gale, D.: A theorem on flows in networks. Discrete Math. 187, 1073\u20131082 (1957)","journal-title":"Discrete Math."},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0304-3975(97)00298-3","volume":"233","author":"RJ Gardner","year":"2000","unstructured":"Gardner, R.J., Gritzmann, P., Prangenberg, D.: On the computational complexity of determining polyatomic structures by x-rays. Theor. Comput. Sci. 233, 91\u2013106 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1568-4","volume-title":"Discrete Tomography: Foundations, Algorithms and Applications","author":"GT Herman","year":"1999","unstructured":"Herman, G.T., Kuba, A.: Discrete Tomography: Foundations, Algorithms and Applications. Birkh\u00e4user, Boston (1999)"},{"key":"26_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4543-4","volume-title":"Advances in Discrete Tomography and Its Applications","author":"GT Herman","year":"2007","unstructured":"Herman, G.T., Kuba, A.: Advances in Discrete Tomography and Its Applications. Birkh\u00e4user, Boston (2007)"},{"key":"26_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1995.0805","volume":"22","author":"AV Goldberg","year":"1997","unstructured":"Goldberg, A.V.: An efficient implementation of a scaling minimum-cost flow algorithm. J. Algorithms 22, 1\u201329 (1997)","journal-title":"J. Algorithms"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/11560586_14","volume-title":"Theoretical Computer Science","author":"M-C Costa","year":"2005","unstructured":"Costa, M.-C., Jarray, F., Picouleau, C.: Reconstructing an alternate periodical binary matrix from its orthogonal projections. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol. 3701, pp. 173\u2013181. Springer, Heidelberg (2005). doi:\n10.1007\/11560586_14"},{"issue":"5","key":"26_CR18","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1142\/S0217595909002419","volume":"26","author":"F Jarray","year":"2009","unstructured":"Jarray, F.: A 4-day or a 3-day workweeks scheduling problem with a given workforce size. Asia Pac. J. Oper. Res. 26(5), 685\u2013696 (2009)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"26_CR19","unstructured":"Jarray, F., Wynter, L.: An optimal smart market for the pricing of telecommunication services. Technical report 4310, INRIA, Rocquencourt, France (2001)"},{"key":"26_CR20","unstructured":"Jarray, F.: Solving problems of discrete tomography: applications in workforce scheduling. Ph.D. thesis, University of CNAM, Paris (2004)"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-540-79126-3_37","volume-title":"Discrete Geometry for Computer Imagery","author":"F Jarray","year":"2008","unstructured":"Jarray, F., Costa, M.-C., Picouleau, C.: Approximating hv-convex binary matrices and images from discrete projections. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds.) DGCI 2008. LNCS, vol. 4992, pp. 413\u2013422. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-79126-3_37"},{"key":"26_CR22","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/j.endm.2010.05.057","volume":"36","author":"F Jarray","year":"2010","unstructured":"Jarray, F., Tlig, G.: A simulated annealing for reconstructing hv-convex binary matrices. Electron. Notes Discrete Math. 36, 447\u2013454 (2010)","journal-title":"Electron. Notes Discrete Math."},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-21073-0_28","volume-title":"Combinatorial Image Analysis","author":"F Jarray","year":"2011","unstructured":"Jarray, F., Tlig, G.: Approximating bicolored images from discrete projections. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 311\u2013320. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-21073-0_28"},{"key":"26_CR24","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"26_CR25","doi-asserted-by":"crossref","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","volume":"9","author":"HR Ryser","year":"1957","unstructured":"Ryser, H.R.: Combinatorial properties of matrices of zeros and ones. Can. J. Math. 9, 371\u2013377 (1957)","journal-title":"Can. J. Math."},{"key":"26_CR26","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0020-0190(00)00162-9","volume":"77","author":"GJ Woeginger","year":"2001","unstructured":"Woeginger, G.J.: The reconstruction of polyominoes from their orthogonal projections. Inf. Process. Lett. 77, 225\u2013229 (2001)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59108-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T08:51:54Z","timestamp":1494924714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59108-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591070","9783319591087"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59108-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}