{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:38:33Z","timestamp":1742942313024,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319051697"},{"type":"electronic","value":"9783319051703"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05170-3_36","type":"book-chapter","created":{"date-parts":[[2014,3,26]],"date-time":"2014-03-26T13:53:08Z","timestamp":1395841988000},"page":"519-532","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Exact Solution of VSP for General and Structured Graphs: Models and Algorithms"],"prefix":"10.1007","author":[{"given":"Norberto","family":"Castillo-Garc\u00eda","sequence":"first","affiliation":[]},{"given":"H\u00e9ctor Joaqu\u00edn Fraire","family":"Huacuja","sequence":"additional","affiliation":[]},{"given":"Rodolfo A. Pazos","family":"Rangel","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 A. Mart\u00ednez","family":"Flores","sequence":"additional","affiliation":[]},{"given":"Juan Javier Gonz\u00e1lez","family":"Barbosa","sequence":"additional","affiliation":[]},{"given":"Juan Mart\u00edn Carpio","family":"Valadez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,27]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF00264496","volume":"16","author":"T Lengauer","year":"1981","unstructured":"Lengauer, T.: Black-white pebbles and graph separation. Acta Informatica 16, 465\u2013475 (1981)","journal-title":"Acta Informatica"},{"issue":"12","key":"36_CR2","doi-asserted-by":"publisher","first-page":"3247","DOI":"10.1016\/j.cor.2012.04.017","volume":"39","author":"A Duarte","year":"2012","unstructured":"Duarte, A., Escudero, L., Mart\u00ed, R., Mladenovic, N., Pantrigo, J., S\u00e1nchez-Oro, J.: Variable neighborhood search for the vertex separation problem. Comput. Oper. Res. 39(12), 3247\u20133255 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"36_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Leiserson, C.: Area-efficient graph layouts (for VLSI). In: Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 270\u2013281 (1980)","DOI":"10.1109\/SFCS.1980.13"},{"key":"36_CR5","unstructured":"Bodlaender, H., Gustedt, J., Telle, J.: Linear time register allocation for a fixed number of registers. In: Proceedings of the Symposium on Discrete Algorithms. (1998)"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0166-218X(92)90208-R","volume":"36","author":"A Kornai","year":"1997","unstructured":"Kornai, A.: Narrowness, path-width, and their application in natural language processing. Discrete Appl. Math. 36, 87\u201392 (1997). Elsevier Science Publishers B. V. (1992)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"36_CR7","first-page":"297","volume":"40","author":"I Lopes","year":"2010","unstructured":"Lopes, I., de Carvalho, J.: Minimization of open orders using interval graphs. IAENG Int. J. Appl. Math. 40(4), 297\u2013306 (2010)","journal-title":"IAENG Int. J. Appl. Math."},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J Ellis","year":"1994","unstructured":"Ellis, J., Sudborough, I., Turner, J.: The vertex separation and search number of a graph. Inf. Comput. 113, 50\u201379 (1994)","journal-title":"Inf. Comput."},{"key":"36_CR9","series-title":"LNCS","first-page":"403","volume-title":"Proceedings of 8th Annual European Symposium on Algorithms","author":"K Skodinis","year":"2000","unstructured":"Skodinis, K.: Computing optimal linear layouts of trees in linear time. In: Paterson, M. (ed.) Proceedings of 8th Annual European Symposium on Algorithms. LNCS, vol. 1879, pp. 403\u2013414. Springer, London (2000)"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF01275667","volume":"11","author":"B Bollob\u00e1s","year":"1991","unstructured":"Bollob\u00e1s, B., Leader, I.: Edge-Isoperimetric inequalities in the grid. Combinatorica 11, 299\u2013314 (1991)","journal-title":"Combinatorica"},{"key":"36_CR11","unstructured":"Chen, D., Batson, R., Dang, Y.: Applied Integer Programming: Modeling and Solution. Wiley publisher. ISBN: 978-1-118-21002-4. (2010)"},{"issue":"1","key":"36_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10479-011-0907-2","volume":"199","author":"J Pantrigo","year":"2012","unstructured":"Pantrigo, J., Mart\u00ed, R., Duarte, A., Pardo, E.: Scatter search for the Cutwidth minimization problem. Ann. Oper. Res. 199(1), 285\u2013304 (2012)","journal-title":"Ann. Oper. Res."},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Barabas\u00ed, A.: Emergence of Scaling in Complex Networks. Handbook of graphs and networks: from the Genome of the Internet, pp. 69\u201384. (2005)","DOI":"10.1002\/3527602755.ch3"},{"key":"36_CR14","unstructured":"L\u00f3pez, T.: Complejidad Computacional Estructural en Redes Complejas. PhD Thesis. Universidad Aut\u00f3noma de Nuevo Le\u00f3n, M\u00e9xico (2012)"},{"key":"36_CR15","unstructured":"Eppstein, D., Wang, J.: A steady state model for graphs power laws. arXiv preprint cs\/0204001. (2002)"}],"container-title":["Studies in Computational Intelligence","Recent Advances on Hybrid Approaches for Designing Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05170-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T22:26:47Z","timestamp":1675808807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05170-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319051697","9783319051703"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05170-3_36","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"27 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}