{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:07Z","timestamp":1725497167422},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_5","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T09:55:58Z","timestamp":1196934958000},"page":"45-54","source":"Crossref","is-referenced-by-count":2,"title":["Tree-Width and Optimization in Bounded Degree Graphs"],"prefix":"10.1007","author":[{"given":"Vadim","family":"Lozin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Alekseev, V.E., Boliac, R., Korobitsyn, D.V., Lozin, V.V.: NP-hard graph problems and boundary classes of graphs. Theoretical Computer Science (in press) \n                  \n                    http:\/\/www.sciencedirect.com\/science\/journal\/03043975"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl.\u00a0Math.\u00a023, 11\u201324 (1989)","journal-title":"Discrete Appl.\u00a0Math."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1002\/jgt.3190140409","volume":"14","author":"G. Bacs\u00f3","year":"1990","unstructured":"Bacs\u00f3, G., Tuza, Z.: A characterization of graphs without long induced paths. J.\u00a0Graph Theory\u00a014, 455\u2013464 (1990)","journal-title":"J.\u00a0Graph Theory"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0166-218X(97)00031-0","volume":"79","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., Thilikos, D.M.: Treewidth for graphs with small chordality. Discrete Appl.\u00a0Math.\u00a079, 45\u201361 (1997)","journal-title":"Discrete Appl.\u00a0Math."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0304-3975(02)00586-8","volume":"301","author":"R. Boliac","year":"2003","unstructured":"Boliac, R., Lozin, V.: Independent domination in finitely defined classes of graphs. Theoret. Comput. Sci.\u00a0301, 271\u2013284 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0166-218X(02)00571-1","volume":"129","author":"A. Brandst\u00e4dt","year":"2003","unstructured":"Brandst\u00e4dt, A., Dragan, F.: On linear and circular structure of (claw, net)-free graphs. Discrete Appl. Math.\u00a0129, 285\u2013303 (2003)","journal-title":"Discrete Appl. Math."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique-width of a graph. Discrete Appl. Math.\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Appl. Math."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"36","author":"P. Damaschke","year":"1990","unstructured":"Damaschke, P., M\u00fcller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inform. Process. Lett.\u00a036, 231\u2013236 (1990)","journal-title":"Inform. Process. Lett."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/(SICI)1097-0118(199903)30:3<235::AID-JGT8>3.0.CO;2-C","volume":"30","author":"J. Dong","year":"1999","unstructured":"Dong, J.: On the diameter of i-center in a graph without long induced paths. J.\u00a0Graph Theory\u00a030, 235\u2013241 (1999)","journal-title":"J.\u00a0Graph Theory"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(99)00194-8","volume":"101","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Lewenstein, M.: New results on induced matchings. Discrete Appl. Math.\u00a0101, 157\u2013165 (2000)","journal-title":"Discrete Appl. Math."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Gurski, F., Wanke, E.: Line graphs of bounded clique-width. Discrete Math. (2007), doi:10.1016\/j.disc.2007.01.020","DOI":"10.1016\/j.disc.2007.01.020"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00453-003-1035-4","volume":"37","author":"D. Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Finding maximum induced matchings in subclasses of claw-free and P\n                5-free graphs, and in graphs with matching and induced matching of equal maximum size. Algorithmica\u00a037, 327\u2013346 (2003)","journal-title":"Algorithmica"},{"key":"5_CR13","unstructured":"Korobitsyn, D.V.: On the complexity of determining the domination number in monogenic classes of graphs. Diskret. Mat.\u00a02(3), 90\u201396 (1990) (in Russian, translation in Discrete Math. and Appl. 2(2), 191\u2013199 (1992))"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(01)00185-5","volume":"81","author":"V.V. Lozin","year":"2002","unstructured":"Lozin, V.V.: On maximum induced matchings in bipartite graphs. Inform. Process. Lett.\u00a081, 7\u201311 (2002)","journal-title":"Inform. Process. Lett."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ipl.2003.07.004","volume":"88","author":"V. Lozin","year":"2003","unstructured":"Lozin, V., Rautenbach, D.: Some results on graphs without long induced paths. Inform. Process. Lett.\u00a088, 167\u2013171 (2003)","journal-title":"Inform. Process. Lett."},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/S0895480102419755","volume":"18","author":"V. Lozin","year":"2004","unstructured":"Lozin, V., Rautenbach, D.: On the band-, tree- and clique-width of graphs with bounded vertex degree. SIAM J. Discrete Math.\u00a018, 195\u2013206 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.disc.2004.02.008","volume":"283","author":"V. Lozin","year":"2004","unstructured":"Lozin, V., Rautenbach, D.: Chordal bipartite graphs of bounded tree- and clique-width. Discrete Math.\u00a0283, 151\u2013158 (2004)","journal-title":"Discrete Math."},{"key":"5_CR18","first-page":"57","volume":"34","author":"V. Lozin","year":"2006","unstructured":"Lozin, V., Rautenbach, D.: The tree- and clique-width of bipartite graphs in special classes. Australasian J.\u00a0Combinatorics\u00a034, 57\u201367 (2006)","journal-title":"Australasian J.\u00a0Combinatorics"},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G.J. Minty","year":"1980","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J.\u00a0Combin.\u00a0Theory Ser.\u00a0B\u00a028, 284\u2013304 (1980)","journal-title":"J.\u00a0Combin.\u00a0Theory Ser.\u00a0B"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Grad and classes with bounded expansion I. Decompositions. Eur.\u00a0J.\u00a0of Combinatorics (2007), doi:10.1016\/j.ejc.2006.07.013","DOI":"10.1016\/j.ejc.2006.07.013"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M. Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math.\u00a038, 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:42:36Z","timestamp":1619505756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_5","relation":{},"subject":[]}}