{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:20:49Z","timestamp":1649078449118},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T00:00:00Z","timestamp":1550707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10479-019-03174-6","type":"journal-article","created":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T09:35:39Z","timestamp":1550741739000},"page":"47-63","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sandwiches missing two ingredients of order four"],"prefix":"10.1007","volume":"280","author":[{"given":"Jos\u00e9 D.","family":"Alvarado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"Dantas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Rautenbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,21]]},"reference":[{"key":"3174_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(03)00266-X","volume":"138","author":"A Brandst\u00e4dt","year":"2004","unstructured":"Brandst\u00e4dt, A. (2004). \n                    \n                      \n                    \n                    $$(P_5,{\\rm diamond})$$\n                    \n                      \n                        \n                          (\n                          \n                            P\n                            5\n                          \n                          ,\n                          diamond\n                          )\n                        \n                      \n                    \n                  -free graphs revisited: Structure and linear time optimization. Discrete Applied Mathematics, 138, 13\u201327.","journal-title":"Discrete Applied Mathematics"},{"key":"3174_CR2","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00224-005-1199-1","volume":"39","author":"A Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Engelfriet, J., Le, H.-O., & Lozin, V. V. (2006). Clique-width for 4-vertex forbidden subgraphs. Theory of Computing Systems, 39, 561\u2013590.","journal-title":"Theory of Computing Systems"},{"key":"3174_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph classes: A survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V. B., & Spinrad, J. P. (1999). Graph classes: A survey. Philadelphia: SIAM."},{"key":"3174_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(02)00291-0","volume":"84","author":"A Brandst\u00e4dt","year":"2002","unstructured":"Brandst\u00e4dt, A., & Mahfud, S. (2002). Maximum weight stable set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. Information Processing Letters, 84, 251\u2013259.","journal-title":"Information Processing Letters"},{"key":"3174_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0020-0190(98)00076-3","volume":"67","author":"M Cerioli","year":"1998","unstructured":"Cerioli, M., Everett, H., de Figueiredo, C. M. H., & Klein, S. (1998). The homogeneous set sandwich problem. Information Processessing Letters, 67, 31\u201335.","journal-title":"Information Processessing Letters"},{"key":"3174_CR6","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1093\/comjnl\/bxv096","volume":"59","author":"KK Dabrowski","year":"2016","unstructured":"Dabrowski, K. K., & Paulusma, D. (2016). Clique-width of graph classes defined by two forbidden induced subgraphs. The Computer Journal, 59, 650\u2013666.","journal-title":"The Computer Journal"},{"key":"3174_CR7","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1016\/j.dam.2010.11.010","volume":"159","author":"S Dantas","year":"2011","unstructured":"Dantas, S., de Figueiredo, C. M. H., da Silva, M. V. G., & Teixeira, R. B. (2011a). On the forbidden induced subgraph sandwich problem. Discrete Applied Mathematics, 159, 1717\u20131725.","journal-title":"Discrete Applied Mathematics"},{"key":"3174_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10479-010-0792-0","volume":"188","author":"S Dantas","year":"2011","unstructured":"Dantas, S., de Figueiredo, C. M. H., Golumbic, M. C., Klein, S., & Maffray, F. (2011b). The chain graph sandwich problem. Annals of Operations Research, 188, 133\u2013139.","journal-title":"Annals of Operations Research"},{"key":"3174_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2013.09.004","volume":"182","author":"S Dantas","year":"2015","unstructured":"Dantas, S., de Figueiredo, C. M. H., Maffray, F., & Teixeira, R. B. (2015). The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem. Discrete Applied Mathematics, 182, 15\u201324.","journal-title":"Discrete Applied Mathematics"},{"key":"3174_CR10","doi-asserted-by":"publisher","first-page":"3664","DOI":"10.1016\/j.disc.2008.01.014","volume":"309","author":"S Dantas","year":"2009","unstructured":"Dantas, S., Klein, S., de Mello, C. P., & Morgana, A. (2009). The graph sandwich problem for \n                    \n                      \n                    \n                    $$P_4$$\n                    \n                      \n                        \n                          P\n                          4\n                        \n                      \n                    \n                  -sparse graphs. Discrete Mathematics, 309, 3664\u20133673.","journal-title":"Discrete Mathematics"},{"key":"3174_CR11","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W.H. Freeman & Co."},{"key":"3174_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0024-3795(97)10075-1","volume":"277","author":"MC Golumbic","year":"1998","unstructured":"Golumbic, M. C. (1998). Matrix sandwich problems. Linear Algebra and Applcations, 277, 239\u2013251.","journal-title":"Linear Algebra and Applcations"},{"key":"3174_CR13","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jagm.1995.1047","volume":"19","author":"MC Golumbic","year":"1995","unstructured":"Golumbic, M. C., Kaplan, H., & Shamir, R. (1995). Graph sandwich problems. Journal of Algorithms, 19, 449\u2013473.","journal-title":"Journal of Algorithms"},{"key":"3174_CR14","doi-asserted-by":"publisher","first-page":"1813","DOI":"10.1016\/j.disc.2011.04.023","volume":"311","author":"N Korpelainen","year":"2011","unstructured":"Korpelainen, N., & Lozin, V. (2011). Two forbidden induced subgraphs and well-quasi-ordering. Discrete Mathematics, 311, 1813\u20131822.","journal-title":"Discrete Mathematics"},{"key":"3174_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0166-218X(94)00022-0","volume":"52","author":"F Maffray","year":"1994","unstructured":"Maffray, F., & Preissmann, M. (1994). Linear recognition of pseudo-split graphs. Discrete Applied Mathematics, 52, 307\u2013312.","journal-title":"Discrete Applied Mathematics"},{"key":"3174_CR16","volume-title":"Threshold graphs and related topics, Annals of Discrete Mathematics 56","author":"NVR Mahadev","year":"1995","unstructured":"Mahadev, N. V. R., & Peled, U. N. (1995). Threshold graphs and related topics, Annals of Discrete Mathematics 56. Amsterdam: Elsevier."},{"key":"3174_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","volume":"28","author":"S Olariu","year":"1988","unstructured":"Olariu, S. (1988). Paw-free graphs. Information Processing Letters, 28, 53\u201354.","journal-title":"Information Processing Letters"},{"key":"3174_CR18","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1016\/j.dam.2009.12.002","volume":"158","author":"RB Teixeira","year":"2010","unstructured":"Teixeira, R. B., Dantas, S., & de Figueiredo, C. M. H. (2010). The polynomial dichotomy for three nonempty part sandwich problems. Discrete Applied Mathematics, 158, 1286\u20131304.","journal-title":"Discrete Applied Mathematics"},{"key":"3174_CR19","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.dam.2010.03.015","volume":"159","author":"RB Teixeira","year":"2011","unstructured":"Teixeira, R. B., Dantas, S., & de Figueiredo, C. M. H. (2011). The external constraint \n                    \n                      \n                    \n                    $$4$$\n                    \n                      \n                        \n                          4\n                        \n                      \n                    \n                   nonempty part sandwich problem. Discrete Applied Mathematics, 159, 661\u2013673.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-019-03174-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03174-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03174-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T19:20:09Z","timestamp":1582226409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-019-03174-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,21]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["3174"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03174-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,21]]},"assertion":[{"value":"21 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}