{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:19:09Z","timestamp":1725535149630},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_30","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T06:49:21Z","timestamp":1247208561000},"page":"297-306","source":"Crossref","is-referenced-by-count":2,"title":["Computing Bond Types in Molecule Graphs"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"B\u00f6cker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quang B. A.","family":"Bui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Seeber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anke","family":"Truss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.dam.2004.01.013","volume":"145","author":"J. Alber","year":"2005","unstructured":"Alber, J., Dorn, F., Niedermeier, R.: Experimental evaluation of a tree decomposition based algorithm for Vertex Cover on planar graphs. Discrete Appl. Math.\u00a0145(2), 219\u2013231 (2005)","journal-title":"Discrete Appl. Math."},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embedding in a k-tree. SIAM J. Algebra. Discr.\u00a08, 277\u2013284 (1987)","journal-title":"SIAM J. Algebra. Discr."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1021\/ci00009a001","volume":"32","author":"J.C. Baber","year":"1992","unstructured":"Baber, J.C., Hodgkin, E.E.: Automatic assignment of chemical connectivity to organic molecules in the cambridge structural database. J. Chem. Inf. Model.\u00a032, 401\u2013406 (1992)","journal-title":"J. Chem. Inf. Model."},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci.\u00a0209, 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1021\/ci049645z","volume":"5","author":"M. Froeyen","year":"2005","unstructured":"Froeyen, M., Herdewijn, P.: Correct bond order assignment in a molecular framework using integer linear programming with application to molecules where only non-hydrogen atom coordinates are available. J. Chem. Inf. Model.\u00a05, 1267\u20131274 (2005)","journal-title":"J. Chem. Inf. Model."},{"key":"30_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability (A Guide to Theory of NP-Completeness). Freeman, New York (1979)"},{"key":"30_CR8","first-page":"774","volume":"37","author":"M. Hendlich","year":"1997","unstructured":"Hendlich, M., Rippmann, F., Barnickel, G.: BALI: automatic assignment of bond and atom types for protein ligands in the brookhaven protein databank. J. Chem. Inf. Model.\u00a037, 774\u2013778 (1997)","journal-title":"J. Chem. Inf. Model."},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Kloks, T.: Treewidth, Computation and Approximation. Springer, Heidelberg (1994)","DOI":"10.1007\/BFb0045375"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.: Graph minors: algorithmic aspects of tree-width. J. Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.jmgm.2005.12.005","volume":"25","author":"J. Wang","year":"2006","unstructured":"Wang, J., Wang, W., Kollmann, P.A., Case, D.A.: Automatic atom type and bond type perception in molecular mechanical calculations. J. Mol. Graph. Model.\u00a025, 247\u2013260 (2006)","journal-title":"J. Mol. Graph. Model."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:45:02Z","timestamp":1558421102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}