{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:46:59Z","timestamp":1770994019116,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540427070","type":"print"},{"value":"9783540454779","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45477-2_26","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:09:01Z","timestamp":1187248141000},"page":"284-295","source":"Crossref","is-referenced-by-count":29,"title":["The Complexity of the Matching-Cut Problem"],"prefix":"10.1007","author":[{"given":"Maurizio","family":"Patrignani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Pizzonia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,2]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jgt.3190080106","volume":"8","author":"V. Chv\u00e1tal","year":"1984","unstructured":"V. Chv\u00e1tal. Recogniziong decomposable graphs. J. Graph Theory, 8:51\u201353, 1984.","journal-title":"J. Graph Theory"},{"key":"26_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.7155\/jgaa.00027","volume":"4","author":"G. Battista Di","year":"2000","unstructured":"G. Di Battista, M. Patrignani, and F. Vargiu. A Split&Push approach to 3D orthogonal drawing. Journ. Graph Alg. Appl., 4:105\u2013133, 2000.","journal-title":"Journ. Graph Alg. Appl."},{"key":"26_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42:1115\u20131145, 1995.","journal-title":"J. ACM"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"M. Patrignani and F. Vargiu. 3DCube: A tool for three dimensional graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97) volume 1353 of Lecture Notes Comput. Sci., pages 284\u2013290. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_70"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"T. J. Schaefer. The complexity of satisfiability problems. In Proc. 10th Annu. ACM Sympos. Theory Comput., pages 216\u2013226, 1978.","DOI":"10.1145\/800133.804350"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series-parallel digraphs. SIAM J. Comput., 11(2):298\u2013313, 1982.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45477-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:26:57Z","timestamp":1556756817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45477-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427070","9783540454779"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45477-2_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}