{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:43:40Z","timestamp":1725637420342},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258695"},{"type":"electronic","value":"9783642258701"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25870-1_16","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T13:32:45Z","timestamp":1322659965000},"page":"167-178","source":"Crossref","is-referenced-by-count":2,"title":["Complexity of Splits Reconstruction for Low-Degree Trees"],"prefix":"10.1007","author":[{"given":"Serge","family":"Gaspers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Liedloff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maya","family":"Stein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karol","family":"Suchan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/11940128_12","volume-title":"Algorithms and Computation","author":"K.F. Aoki-Kinoshita","year":"2006","unstructured":"Aoki-Kinoshita, K.F., Kanehisa, M., Kao, M.-Y., Li, X.-Y., Wang, W.: A 6-Approximation Algorithm for Computing Smallest Common Aon-Supertree with Application to the Reconstruction of Glycan Trees. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 100\u2013110. Springer, Heidelberg (2006)"},{"key":"16_CR2","unstructured":"Balaban, A.T.: Chemical Applications of Graph Theory. Academic Press, Inc. (1976)"},{"key":"16_CR3","unstructured":"Bonchev, D., Rouvray, D.H.: Chemical Graph Theory: Introduction and Fundamentals. Taylor & Francis (1991)"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010767517079","volume":"66","author":"A.A. Dobrynin","year":"2001","unstructured":"Dobrynin, A.A., Entringer, R., Gutman, I.: Wiener index of trees: Theory and applications. Acta Applicandae Mathematicae\u00a066(3), 211\u2013249 (2001)","journal-title":"Acta Applicandae Mathematicae"},{"key":"16_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Heidelberg (1999)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Faulon, J.-L., Bender, A.: Handbook of Chemoinformatics Algorithms, 1st edn. Chapman and Hall\/CRC (2010)","DOI":"10.1201\/9781420082999"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-17493-3_13","volume-title":"Parameterized and Exact Computation","author":"M.R. Fellows","year":"2010","unstructured":"Fellows, M.R., Gaspers, S., Rosamond, F.A.: Parameterizing by the Number of Numbers. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 123\u2013134. Springer, Heidelberg (2010)"},{"key":"16_CR8","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)"},{"key":"16_CR9","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1021\/ci980332b","volume":"39","author":"V.J. Gillet","year":"1999","unstructured":"Gillet, V.J., Willett, P., Bradshawand, J., Green, D.V.S.: Selecting combinatorial libraries to optimize diversity and physical properties. Journal of Chemical Information and Computer Sciences\u00a039(1), 169\u2013177 (1999)","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"16_CR11","unstructured":"Goldman, D., Istrail, S., Lancia, G., Piccolboni, A., Walenz, B.: Algorithmic strategies in combinatorial chemistry. In: SODA, pp. 275\u2013284 (2000)"},{"key":"16_CR12","unstructured":"Hammer, P.L. (ed.): Special issue on the 50th anniversary of the Wiener index. Discrete Applied Mathematics, vol.\u00a080. Elsevier (1997)"},{"issue":"5","key":"16_CR13","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/j.orl.2008.05.004","volume":"36","author":"H. Hulett","year":"2008","unstructured":"Hulett, H., Will, T.G., Woeginger, G.J.: Multigraph realizations of degree sequences: Maximization is easy, minimization is hard. Operations Research Letters\u00a036(5), 594\u2013596 (2008)","journal-title":"Operations Research Letters"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-02441-2_19","volume-title":"Combinatorial Pattern Matching","author":"C. Komusiewicz","year":"2009","unstructured":"Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Deconstructing Intractability: A Case Study for Interval Constrained Coloring. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009 Lille. LNCS, vol.\u00a05577, pp. 207\u2013220. Springer, Heidelberg (2009)"},{"key":"16_CR15","first-page":"205","volume":"51","author":"X. Li","year":"2004","unstructured":"Li, X., Zhang, X.: The edge split reconstruction problem for chemical trees is NP-complete. MATCH Communications in Mathematical and in Computer Chemistry\u00a051, 205\u2013210 (2004)","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"16_CR16","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)"},{"issue":"2","key":"16_CR17","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1021\/ci00024a021","volume":"35","author":"R.P. Sheridan","year":"1995","unstructured":"Sheridan, R.P., Kearsley, S.K.: Using a genetic algorithm to suggest combinatorial libraries. Journal of Chemical Information and Computer Sciences\u00a035(2), 310\u2013320 (1995)","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"16_CR18","unstructured":"Trinajsti\u0107, N.: Chemical Graph Theory, 2nd edn. CRC Press (1992)"},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1021\/ja01193a005","volume":"69","author":"H. Wiener","year":"1947","unstructured":"Wiener, H.: Structural determination of paraffin boiling points. Journal of the American Chemical Society\u00a069(1), 17\u201320 (1947)","journal-title":"Journal of the American Chemical Society"}],"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\/978-3-642-25870-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,18]],"date-time":"2021-12-18T04:40:46Z","timestamp":1639802446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25870-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258695","9783642258701"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25870-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}