{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T10:25:13Z","timestamp":1761992713153,"version":"build-2065373602"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,7,25]],"date-time":"2016-07-25T00:00:00Z","timestamp":1469404800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10589-016-9862-9","type":"journal-article","created":{"date-parts":[[2016,7,25]],"date-time":"2016-07-25T15:08:24Z","timestamp":1469459304000},"page":"163-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Simple decentralized graph coloring"],"prefix":"10.1007","volume":"66","author":[{"given":"Severino F.","family":"Gal\u00e1n","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,25]]},"reference":[{"issue":"4","key":"9862_CR1","first-page":"739","volume":"2","author":"H Al-Omari","year":"2006","unstructured":"Al-Omari, H., Sabri, K.E.: New graph coloring algorithms. Am. J. Math. Stat. 2(4), 739\u2013741 (2006)","journal-title":"Am. J. Math. Stat."},{"key":"9862_CR2","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0377-2217(02)00832-9","volume":"151","author":"C Avanthay","year":"2003","unstructured":"Avanthay, C., Hertz, A., Zufferey, N.: A variable neighborhood search for graph coloring. Eur. J. Oper. Res. 151, 379\u2013388 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9862_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/B:ANOR.0000032574.01332.98","volume":"130","author":"N Barnier","year":"2004","unstructured":"Barnier, N., Brisset, P.: Graph coloring for air traffic flow management. Ann. Oper. Res. 130(1), 163\u2013178 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"9862_CR4","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.cor.2006.05.014","volume":"35","author":"I Bl\u00f6chliger","year":"2008","unstructured":"Bl\u00f6chliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Comp. Oper. Res. 35(3), 960\u2013975 (2008)","journal-title":"Comp. Oper. Res."},{"key":"9862_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s11721-015-0110-1","volume":"9","author":"C Blum","year":"2015","unstructured":"Blum, C., Calvo, B., Blesa, M.J.: FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs. Swarm Intell. 9, 205\u2013227 (2015)","journal-title":"Swarm Intell."},{"key":"9862_CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Commun. ACM 22, 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"key":"9862_CR7","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/mnsc.19.4.456","volume":"19","author":"JR Brown","year":"1972","unstructured":"Brown, J.R.: Chromatic scheduling and the chromatic number problem. Manag. Sci. 19, 456\u2013463 (1972)","journal-title":"Manag. Sci."},{"issue":"1","key":"9862_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/08886504.1994.10782112","volume":"27","author":"EK Burke","year":"1994","unstructured":"Burke, E.K., Elliman, D.G., Weare, R.F.: A university timetabling system based on graph colouring and constraint manipulation. J. Res. Comput. Educ. 27(1), 1\u201318 (1994)","journal-title":"J. Res. Comput. Educ."},{"key":"9862_CR9","first-page":"129","volume-title":"Handbook in Operations Research and Management Science","author":"A Caprara","year":"2007","unstructured":"Caprara, A., Kroon, L., Monaci, M., Peeters, M., Tooth, P.: Passenger railway optimization. In: Barnhart, C., Laporte, G. (eds.) Handbook in Operations Research and Management Science, pp. 129\u2013187. Elsevier, Amsterdam (2007)"},{"key":"9862_CR10","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: Register allocation & spilling via graph coloring. In: Proceedings of the 1982 SIGPLAN Symposium on Compiler Construction, pp. 98\u2013105. ACM (1982)","DOI":"10.1145\/800230.806984"},{"issue":"2","key":"9862_CR11","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","volume":"32","author":"M Chams","year":"1987","unstructured":"Chams, M., Hertz, A., de Werra, D.: Some experiments with simulated annealing for coloring graphs. Eur. J. Oper. Res. 32(2), 260\u2013266 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9862_CR12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0720013","volume":"20","author":"TF Coleman","year":"1983","unstructured":"Coleman, T.F., Mor\u00e9, J.J.: Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal. 20(1), 187\u2013209 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"9862_CR13","doi-asserted-by":"crossref","unstructured":"Culberson, J.C., Luo, F.: Exploring the k-colorable landscape with iterated greedy. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 245\u2013284. American Mathematical Society (1995)","DOI":"10.1090\/dimacs\/026\/13"},{"key":"9862_CR14","first-page":"72","volume-title":"Handbook of Genetic Algorithms","author":"L Davis","year":"1991","unstructured":"Davis, L.: Order-based genetic algorithms and the graph coloring problem. In: Davis, L. (ed.) Handbook of Genetic Algorithms, pp. 72\u201390. Van Nostrand Reinhold, New York (1991)"},{"key":"9862_CR15","unstructured":"Fitzpatrick, S., Meertens, L.: Soft, real-time, distributed graph coloring using decentralized, synchronous, stochastic, iterative-repair, anytime algorithms. Technical Report KES.U.01.05, Kestrel Institute, Palo Alto, CA (2001)"},{"issue":"3","key":"9862_CR16","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.: Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63(3), 437\u2013461 (1996)","journal-title":"Ann. Oper. Res."},{"key":"9862_CR17","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/978-3-642-30504-7_20","volume-title":"Handbook of Optimization: From Classical to Modern Approach","author":"P Galinier","year":"2013","unstructured":"Galinier, P., Hamiez, J.P., Hao, J.K., Porumbel, D.: Recent advances in graph vertex coloring. In: Zelinka, I., Sn\u00e1\u0161el, V., Abraham, A. (eds.) Handbook of Optimization: From Classical to Modern Approach, pp. 505\u2013528. Springer, Berlin (2013)"},{"key":"9862_CR18","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. J. Comb. Optim. 3, 379\u2013397 (1999)","journal-title":"J. Comb. Optim."},{"key":"9862_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1974","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1974)"},{"issue":"4","key":"9862_CR20","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1137\/S0036144504444711","volume":"47","author":"AH Gebremedhin","year":"2005","unstructured":"Gebremedhin, A.H., Manne, F., Pothen, A.: What color is your Jacobian? Graph coloring for computing derivatives. SIAM Rev. 47(4), 629\u2013705 (2005)","journal-title":"SIAM Rev."},{"key":"9862_CR21","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1057\/palgrave.jors.2601316","volume":"53","author":"CA Glass","year":"2002","unstructured":"Glass, C.A.: Bag rationalisation for a food manufacturer. J. Oper. Res. Soc. 53, 544\u2013551 (2002)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"9862_CR22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1287\/ijoc.1100.0436","volume":"24","author":"S Gualandi","year":"2012","unstructured":"Gualandi, S., Malucelli, F.: Exact solution of graph coloring problems via constraint programming and column generation. INFORMS J. Comput. 24(1), 81\u2013100 (2012)","journal-title":"INFORMS J. Comput."},{"key":"9862_CR23","unstructured":"Guo, C., Zhong, L.C., Rabaey, J.M.: Low power distributed mac for ad hoc sensor radio networks. In: Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2001), pp. 2944\u20132948. IEEE Press (2001)"},{"issue":"12","key":"9862_CR24","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment theory and applications. Proc. IEEE 68(12), 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"key":"9862_CR25","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s11721-012-0067-2","volume":"6","author":"H Hern\u00e1ndez","year":"2012","unstructured":"Hern\u00e1ndez, H., Blum, C.: Distributed graph coloring: an approach based on the calling behavior of Japanese tree frogs. Swarm Intell. 6, 117\u2013150 (2012)","journal-title":"Swarm Intell."},{"key":"9862_CR26","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s11235-013-9776-0","volume":"55","author":"H Hern\u00e1ndez","year":"2014","unstructured":"Hern\u00e1ndez, H., Blum, C.: FrogSim: distributed graph coloring in wireless ad hoc networks. Telecommun. Syst. 55, 211\u2013223 (2014)","journal-title":"Telecommun. Syst."},{"issue":"13","key":"9862_CR27","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1016\/j.dam.2008.03.022","volume":"156","author":"A Hertz","year":"2008","unstructured":"Hertz, A., Plumettaz, M., Zufferey, N.: Variable space search for graph coloring. Discret. Appl. Math. 156(13), 2551\u20132560 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"9862_CR28","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A Hertz","year":"1987","unstructured":"Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345\u2013351 (1987)","journal-title":"Computing"},{"issue":"3","key":"9862_CR29","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9862_CR30","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"DS Johnson","year":"1991","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation. Part II: graph coloring and number partitioning. Oper. Res. 39(3), 378\u2013406 (1991)","journal-title":"Oper. Res."},{"key":"9862_CR31","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/026","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","author":"DS Johnson","year":"1996","unstructured":"Johnson, D.S., Trick, M.A.: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. American Mathematical Society, Providence (1996)"},{"key":"9862_CR32","doi-asserted-by":"crossref","unstructured":"Keshavarzian, A., Lee, H., Venkatraman, L.: Wakeup scheduling in wireless sensor networks. In: Proceedings of the 7th ACM International Symposium on Mobile Ad-Hoc Networking and Computing (MobiHoc 06), pp. 322\u2013333. ACM Press (2006)","DOI":"10.1145\/1132905.1132941"},{"key":"9862_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/conm\/352\/06369","volume-title":"Graph Colorings","author":"A Kosowski","year":"2004","unstructured":"Kosowski, A., Manuszewski, K.: Classical coloring of graphs. In: Kubale, M. (ed.) Graph Colorings, pp. 1\u201320. American Mathematical Society, Providence (2004)"},{"issue":"1","key":"9862_CR34","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1504\/IJMOR.2009.022883","volume":"1","author":"B Laurent","year":"2009","unstructured":"Laurent, B., Hao, J.K.: List-graph colouring for multiple depot vehicle scheduling. Int. J. Math. Oper. Res. 1(1), 228\u2013245 (2009)","journal-title":"Int. J. Math. Oper. Res."},{"issue":"6","key":"9862_CR35","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"FT Leighton","year":"1979","unstructured":"Leighton, F.T.: A graph coloring algorithm for large scheduling problems. J. Res. Natl. Bur. Stand. 84(6), 489\u2013503 (1979)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"9862_CR36","doi-asserted-by":"crossref","unstructured":"Leith, D.J., Clifford, P.: Convergence of distributed learning algorithms for optimal wireless channel allocation. In: Proceedings of the 45th IEEE Conference on Decision and Control, pp. 2980\u20132985. IEEE (2006)","DOI":"10.1109\/CDC.2006.376821"},{"key":"9862_CR37","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1090\/dimacs\/026\/15","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","author":"G Lewandowski","year":"1996","unstructured":"Lewandowski, G., Condon, A.: Experiments with parallel graph coloring heuristics and applications of graph coloring. In: Johnson, D.J., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, pp. 309\u2013334. American Mathematical Society, Providence (1996)"},{"key":"9862_CR38","doi-asserted-by":"crossref","unstructured":"Lim, A., Wang, F.: Robust graph coloring for uncertain supply chain management. In: Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS\u201905), pp. 263\u2013277. IEEE (2005)","DOI":"10.1109\/HICSS.2005.526"},{"issue":"5","key":"9862_CR39","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41(5), 960\u2013981 (1994)","journal-title":"J. ACM"},{"issue":"2","key":"9862_CR40","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/ijoc.1070.0245","volume":"20","author":"E Malaguti","year":"2008","unstructured":"Malaguti, E., Monaci, M., Toth, P.: A metaheuristic approach for the vertex coloring problem. INFORMS J. Comput. 20(2), 302\u2013316 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"9862_CR41","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.disopt.2010.07.005","volume":"8","author":"E Malaguti","year":"2011","unstructured":"Malaguti, E., Monaci, M., Toth, P.: An exact approach for the vertex coloring problem. Discret. Optim. 8(2), 174\u2013190 (2011)","journal-title":"Discret. Optim."},{"key":"9862_CR42","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/B978-1-4832-3187-7.50015-5","volume-title":"Graph Theory and Computing","author":"DW Matula","year":"1972","unstructured":"Matula, D.W., Marble, G., Isaacson, J.: Graph coloring algorithms. In: Read, R. (ed.) Graph Theory and Computing, pp. 109\u2013122. Academic Press, New York (1972)"},{"key":"9862_CR43","unstructured":"Meertens, L., Fitzpatrick, S.: Asynchronous execution and communication latency in distributed constraint optimization. In: Proceedings of the 3rd International Workshop on Distributed Constraint Reasoning, International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS\u20192002), pp. 80\u201385 (2002)"},{"issue":"4","key":"9862_CR44","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A Mehrotra","year":"1996","unstructured":"Mehrotra, A., Trick, M.A.: A column generation approach for graph coloring. INFORMS J. Comput. 8(4), 344\u2013354 (1996)","journal-title":"INFORMS J. Comput."},{"key":"9862_CR45","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.dam.2006.07.010","volume":"156","author":"I M\u00e9ndez-D\u00edaz","year":"2008","unstructured":"M\u00e9ndez-D\u00edaz, I., Zabala, P.: A cutting plane algorithm for graph coloring. Discret. Appl. Math. 156, 159\u2013179 (2008)","journal-title":"Discret. Appl. Math."},{"key":"9862_CR46","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S Minton","year":"1992","unstructured":"Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artif. Intell. 58, 161\u2013205 (1992)","journal-title":"Artif. Intell."},{"issue":"2","key":"9862_CR47","doi-asserted-by":"crossref","first-page":"258","DOI":"10.15807\/jorsj.39.258","volume":"39","author":"T Park","year":"1996","unstructured":"Park, T., Lee, C.Y.: Application of the graph coloring algorithm to the frequency assignment problem. J. Oper. Res. Soc. Jpn. 39(2), 258\u2013265 (1996)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"9862_CR48","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1145\/358161.358171","volume":"26","author":"J Peem\u00f6ller","year":"1983","unstructured":"Peem\u00f6ller, J.: A correction to Br\u00e9laz\u2019s modification of Brown\u2019s coloring algorithm. Commun. ACM 26, 593\u2013597 (1983)","journal-title":"Commun. ACM"},{"key":"9862_CR49","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.dam.2007.03.025","volume":"156","author":"J Thompson","year":"2008","unstructured":"Thompson, J., Dowsland, K.: An improved ant colony optimisation heuristic for graph colouring. Discret. Appl. Math. 156, 313\u2013324 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9862_CR50","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0196-6774(88)90005-3","volume":"9","author":"JS Turner","year":"1988","unstructured":"Turner, J.S.: Almost all k-colorable graphs are easy to color. J. Algorithms 9(1), 63\u201382 (1988)","journal-title":"J. Algorithms"},{"key":"9862_CR51","first-page":"317","volume":"12","author":"D Welsh","year":"1967","unstructured":"Welsh, D., Powell, M.: An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 12, 317\u2013322 (1967)","journal-title":"Comput. J."},{"issue":"2","key":"9862_CR52","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D Werra de","year":"1985","unstructured":"de Werra, D.: An introduction to timetabling. Eur. J. Oper. Res. 19(2), 151\u2013162 (1985)","journal-title":"Eur. J. Oper. Res."},{"key":"9862_CR53","unstructured":"Wilensky, U.: Center for Connected Learning and Computer Science, Northwestern University, Evanston, IL. NetLogo. http:\/\/ccl.northwestern.edu\/netlogo\/ (1999)"},{"issue":"12","key":"9862_CR54","doi-asserted-by":"crossref","first-page":"1794","DOI":"10.1109\/26.120165","volume":"39","author":"TK Woo","year":"1991","unstructured":"Woo, T.K., Su, S.Y.W., Newman-Wolfe, R.: Resource allocation in a dynamically partitionable bus network using a graph coloring algorithm. IEEE Trans. Commun. 39(12), 1794\u20131801 (1991)","journal-title":"IEEE Trans. Commun."},{"key":"9862_CR55","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.artint.2004.10.004","volume":"161","author":"W Zhang","year":"2005","unstructured":"Zhang, W., Wang, G., Xing, Z., Wittenburg, L.: Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks. Artif. Intell. 161, 55\u201387 (2005)","journal-title":"Artif. Intell."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9862-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9862-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9862-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9862-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T13:34:14Z","timestamp":1568208854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9862-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,25]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9862"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9862-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2016,7,25]]}}}