{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T20:23:53Z","timestamp":1777667033323,"version":"3.51.4"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10898-010-9568-y","type":"journal-article","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T11:37:17Z","timestamp":1277897837000},"page":"425-434","source":"Crossref","is-referenced-by-count":29,"title":["An exact algorithm for solving the vertex separator problem"],"prefix":"10.1007","volume":"49","author":[{"given":"Mohamed","family":"Didi Biha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Jean","family":"Meurs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,1]]},"reference":[{"issue":"103","key":"9568_CR1","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10107-005-0574-7","volume":"3","author":"E. Balas","year":"2005","unstructured":"Balas E., de Souza C.: The vertex separator problem: a polyhedral investigation. Math. Program. 3(103), 583\u2013608 (2005)","journal-title":"Math. Program."},{"key":"9568_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","volume":"42","author":"T.N. Bui","year":"1992","unstructured":"Bui T.N., Jones C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42, 153\u2013159 (1992)","journal-title":"Inf. Process. Lett."},{"key":"9568_CR3","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"B.V. Cherkassky","year":"1997","unstructured":"Cherkassky B.V., Goldberg A.V.: On implementing Push-Relabel method for the maximum flow problem. Algorithmica 19, 390\u2013410 (1997)","journal-title":"Algorithmica"},{"issue":"103","key":"9568_CR4","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s10107-005-0573-8","volume":"3","author":"C. Souza de","year":"2005","unstructured":"de Souza C., Balas E.: The vertex separator problem: algorithms and computations. Math. Programm. 3(103), 609\u2013631 (2005)","journal-title":"Math. Programm."},{"key":"9568_CR5","doi-asserted-by":"crossref","unstructured":"Fu, B., Oprisan, S.A., Xu, L.: Multi-Directional Width-Bounded Geometric Separator and Protein Folding. ISAAC, pp. 995\u20131006 (2005)","DOI":"10.1007\/11602613_99"},{"key":"9568_CR6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.7155\/jgaa.00130","volume":"4","author":"J. Fukuyama","year":"2006","unstructured":"Fukuyama J.: NP-completeness of the planar separator problems. J. Graph Algorithms Appl. 4, 317\u2013328 (2006)","journal-title":"J. Graph Algorithms Appl."},{"key":"9568_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractabiliy. W.H. Freeman and Company (1979)"},{"key":"9568_CR8","first-page":"177","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton R.J., Tarjan R.E.: A separator theorem for planar graphs. SIAM J. Numer. Anal. 36, 177\u2013189 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"9568_CR9","unstructured":"http:\/\/www.ic.unicamp.br\/~cid\/Problem-instances\/VSP.html"},{"key":"9568_CR10","unstructured":"http:\/\/www.avglab.com\/andrew\/soft.html"},{"key":"9568_CR11","unstructured":"http:\/\/www.ilog.com"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9568-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-010-9568-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9568-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:58:56Z","timestamp":1559278736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-010-9568-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,1]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9568"],"URL":"https:\/\/doi.org\/10.1007\/s10898-010-9568-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,1]]}}}