{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T06:38:16Z","timestamp":1768891096717,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,3,14]],"date-time":"2005-03-14T00:00:00Z","timestamp":1110758400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s10107-005-0574-7","type":"journal-article","created":{"date-parts":[[2005,3,14]],"date-time":"2005-03-14T18:09:56Z","timestamp":1110823796000},"page":"583-608","source":"Crossref","is-referenced-by-count":51,"title":["The vertex separator problem: a polyhedral investigation"],"prefix":"10.1007","volume":"103","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cid C. de","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,3,14]]},"reference":[{"key":"574_CR1","unstructured":"Balas, E., de Souza, C.C.: The Vertex Separation Problem: A Polyhedral Investigation. MSRR-670, GSIA, Carnegie Mellon University, September 2003; and IC-04-09, Institute of Computing, State University of Campinas, Brazil, 2004. Available on the web under, http:\/\/www.dcc.unicamp.br\/ic-tr-ftp\/2004\/04-09.ps.gz."},{"key":"574_CR2","unstructured":"Cormen, T.H., Leiserson, C.H., Rivest, R.L.: Introduction to Algorithms. MIT Press, 1990"},{"key":"574_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s004530010031","volume":"28","author":"Djidjev","year":"2000","unstructured":"Djidjev, H.N.: Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications. Algorithmica 28, 51\u201375 (2000)","journal-title":"Algorithmica"},{"key":"574_CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1137\/S0097539794271692","volume":"29","author":"Garg","year":"1999","unstructured":"Garg, N., Saran, H., Vazirani, V.V.: Finding Separator Cuts in Planar Graphs Within Twice the Optimal. SIAM J. Computing 29, 159\u2013179 (1999)","journal-title":"SIAM J. Computing"},{"key":"574_CR5","unstructured":"Hadley, G.: Linear Algebra. Addison-Wesley, 1965"},{"key":"574_CR6","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/1033099","volume":"33","author":"Heath","year":"1991","unstructured":"Heath, M.T., Ng, E., Peyton, B.W.: Parallel Algorithms for Sparse Linear Systems. SIAM Review 33, 420\u2013460 (1991)","journal-title":"SIAM Review"},{"key":"574_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A Separator Theorem for Planar Graphs. SIAM J. Appl. Math. 36, 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"574_CR8","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a Planar Separator Theorem. SIAM J. Comput. 9, 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"key":"574_CR9","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/S1064827594262613","volume":"19","author":"Miller","year":"1998","unstructured":"Miller, G.L., Teng, S.H., Thorston, W., Vavasis, S.A.: Geometric Separators for Finite Element Meshes. SIAM J. Scientific Comput. 19, 364\u2013386 (1998)","journal-title":"SIAM J. Scientific Comput."},{"key":"574_CR10","doi-asserted-by":"crossref","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, 1988","DOI":"10.1002\/9781118627372"},{"key":"574_CR11","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s10107-005-0573-8","volume":"103","author":"Souza","year":"2005","unstructured":"de Souza, C.C., Balas, E.: The Vertex Separator Problem: Algorithms and Computations. Math. Programming 103, 609\u2013637 (2005)","journal-title":"Math. Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0574-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-005-0574-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0574-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:58Z","timestamp":1559123398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-005-0574-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3,14]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["574"],"URL":"https:\/\/doi.org\/10.1007\/s10107-005-0574-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3,14]]}}}