{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:48:42Z","timestamp":1710269322055},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,4,23]],"date-time":"2010-04-23T00:00:00Z","timestamp":1271980800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10878-010-9322-x","type":"journal-article","created":{"date-parts":[[2010,4,22]],"date-time":"2010-04-22T14:52:06Z","timestamp":1271947926000},"page":"438-456","source":"Crossref","is-referenced-by-count":3,"title":["Strongly chordal and chordal bipartite graphs are\u00a0sandwich monotone"],"prefix":"10.1007","volume":"22","author":[{"given":"Pinar","family":"Heggernes","sequence":"first","affiliation":[]},{"given":"Federico","family":"Mancini","sequence":"additional","affiliation":[]},{"given":"Charis","family":"Papadopoulos","sequence":"additional","affiliation":[]},{"given":"R.","family":"Sritharan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,23]]},"reference":[{"key":"9322_CR1","doi-asserted-by":"crossref","unstructured":"Alon N, Shapira A (2005) Every monotone graph property is testable. In: STOC 2005, pp\u00a0128\u2013137","DOI":"10.1145\/1060590.1060611"},{"key":"9322_CR2","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1023\/A:1022806215452","volume":"46","author":"M Bakonyi","year":"1997","unstructured":"Bakonyi M, Bono A (1997) Several results on chordal bipartite graphs. Czechoslov Math\u00a0J 46:577\u2013583","journal-title":"Czechoslov Math\u00a0J"},{"key":"9322_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0166-218X(01)00175-5","volume":"116","author":"J Balogh","year":"2002","unstructured":"Balogh J, Bolob\u00e1s B, Weinreich D (2002) Measures on monotone properties of graphs. Discrete Appl Math 116:17\u201336","journal-title":"Discrete Appl Math"},{"key":"9322_CR4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.disc.2005.12.017","volume":"306","author":"HL Bodlaender","year":"2006","unstructured":"Bodlaender HL, Koster AMCA (2006) Safe separators for treewidth. Discrete Math 306:337\u2013350","journal-title":"Discrete Math"},{"key":"9322_CR5","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/S0097539799359683","volume":"31","author":"V Bouchitt\u00e9","year":"2001","unstructured":"Bouchitt\u00e9 V, Todinca I (2001) Treewidth and minimum fill-in: grouping the minimal separators. SIAM J Comput 31:212\u2013232","journal-title":"SIAM J Comput"},{"key":"9322_CR6","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0166-218X(99)00146-8","volume":"99","author":"P Burzyn","year":"2000","unstructured":"Burzyn P, Bonomo F, Duran G (2000) NP-completeness results for edge modification problems. Discrete Appl Math 99:367\u2013400","journal-title":"Discrete Appl Math"},{"key":"9322_CR7","unstructured":"Dahlhaus E (1991) Chordale graphen im besonderen hinblick auf parallele algorithmen. Habilitation Thesis, Universit\u00f6t Bonn"},{"key":"9322_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.tcs.2007.04.007","volume":"381","author":"CMH Figueiredo de","year":"2007","unstructured":"de Figueiredo CMH, Faria L, Klein S, Sritharan R (2007) On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. Theor Comput Sci 381:57\u201367","journal-title":"Theor Comput Sci"},{"key":"9322_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M Farber","year":"1983","unstructured":"Farber M (1983) Characterizations on strongly chordal graphs. Discrete Math 43:173\u2013189","journal-title":"Discrete Math"},{"key":"9322_CR10","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1137\/050643350","volume":"38","author":"FV Fomin","year":"2008","unstructured":"Fomin FV, Kratsch D, Todinca I, Villanger Y (2008) Exact algorithms for treewidth and minimum fill-in. SIAM J Comput 38:1058\u20131079","journal-title":"SIAM J Comput"},{"key":"9322_CR11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"PW Goldberg","year":"1995","unstructured":"Goldberg PW, Golumbic MC, Kaplan H, Shamir R (1995) Four strikes against physical mapping of DNA. J\u00a0Comput Bio 2:139\u2013152","journal-title":"J\u00a0Comput Bio"},{"key":"9322_CR12","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic graph theory and perfect graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic MC (2004) Algorithmic graph theory and perfect graphs, 2nd\u00a0edn. Annals of Discrete Mathematics, vol\u00a057. Elsevier, Amsterdam","edition":"2"},{"key":"9322_CR13","doi-asserted-by":"crossref","first-page":"2659","DOI":"10.1016\/j.dam.2008.08.010","volume":"157","author":"P Heggernes","year":"2009","unstructured":"Heggernes P, Mancini F (2009) Minimal split completions. Discrete Appl Math 157:2659\u20132669","journal-title":"Discrete Appl Math"},{"key":"9322_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2008.07.020","volume":"410","author":"P Heggernes","year":"2009","unstructured":"Heggernes P, Papadopoulos C (2009) Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. Theor Comput Sci 410:1\u201315","journal-title":"Theor Comput Sci"},{"key":"9322_CR15","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/978-3-540-70918-3_21","volume-title":"STACS 2007","author":"P Heggernes","year":"2007","unstructured":"Heggernes P, Suchan K, Todinca I, Villanger Y (2007) Characterizing minimal interval completions: towards better understanding of profile and pathwidth. In: STACS 2007. LNCS, vol\u00a04393. Springer, Berlin, pp\u00a0236\u2013247"},{"key":"9322_CR16","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H Kaplan","year":"1999","unstructured":"Kaplan H, Shamir R, Tarjan RE (1999) Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J Comput 28:1906\u20131922","journal-title":"SIAM J Comput"},{"key":"9322_CR17","series-title":"LNCS","first-page":"458","volume-title":"COCOON 2008","author":"S Kijima","year":"2008","unstructured":"Kijima S, Kiyomi M, Okamoto Y, Uno T (2008) On listing, sampling, and counting the chordal graphs with edge constraints. In: COCOON 2008. LNCS, vol\u00a05092. Springer, Berlin, pp\u00a0458\u2013467"},{"key":"9322_CR18","series-title":"LNCS","first-page":"147","volume-title":"FAW 2008","author":"D Lokshtanov","year":"2008","unstructured":"Lokshtanov D, Mancini F, Papadopoulos C (2008) Characterizing and computing minimal cograph completions. In: FAW 2008. LNCS, vol\u00a05059. Springer, Berlin, pp\u00a0147\u2013158"},{"key":"9322_CR19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A Natanzon","year":"2001","unstructured":"Natanzon A, Shamir R, Sharan R (2001) Complexity classification of some edge modification problems. Discrete Appl Math 113:109\u2013128","journal-title":"Discrete Appl Math"},{"key":"9322_CR20","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige R, Tarjan RE (1987) Three partition refinement algorithms. SIAM J Comput 16:973\u2013989","journal-title":"SIAM J Comput"},{"key":"9322_CR21","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"D Rose","year":"1970","unstructured":"Rose D (1970) Triangulated graphs and the elimination process. J\u00a0Math Anal Appl 32:597\u2013609","journal-title":"J\u00a0Math Anal Appl"},{"key":"9322_CR22","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/B978-1-4832-3187-7.50018-0","volume-title":"Graph theory and computing","author":"DJ Rose","year":"1972","unstructured":"Rose DJ (1972) A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In: Read RC (ed) Graph theory and computing. Academic Press, New York, pp\u00a0183\u2013217"},{"key":"9322_CR23","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D Rose","year":"1976","unstructured":"Rose D, Tarjan RE, Lueker G (1976) Algorithmic aspects of vertex elimination on graphs. SIAM J Comput 5:266\u2013283","journal-title":"SIAM J Comput"},{"key":"9322_CR24","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(93)90209-R","volume":"45","author":"JP Spinrad","year":"1993","unstructured":"Spinrad JP (1993) Doubly lexical ordering of dense 0\u20131 matrices. Inf Process Lett 45:229\u2013235","journal-title":"Inf Process Lett"},{"key":"9322_CR25","doi-asserted-by":"crossref","first-page":"2581","DOI":"10.1016\/j.disc.2007.06.004","volume":"308","author":"R Sritharan","year":"2008","unstructured":"Sritharan R (2008) Chordal bipartite completion of colored graphs. Discrete Math 308:2581\u20132588","journal-title":"Discrete Math"},{"key":"9322_CR26","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis M (1981) Computing the minimum fill-in is NP-complete. SIAM J Algebraic Discrete Methods 2:77\u201379","journal-title":"SIAM J Algebraic Discrete Methods"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9322-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9322-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9322-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:14Z","timestamp":1559262194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9322-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,23]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9322"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9322-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,23]]}}}