{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:28Z","timestamp":1725493648978},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_51","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"509-518","source":"Crossref","is-referenced-by-count":0,"title":["On a Conjecture on Wiener Indices in Combinatorial Chemistry"],"prefix":"10.1007","author":[{"given":"Yih-En Andrew","family":"Ban","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Bespamyatnikh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nabil H.","family":"Mustafa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"issue":"1\u20132","key":"51_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(00)00124-1","volume":"76","author":"S. Bespamyatnikh","year":"2000","unstructured":"Bespamyatnikh, S., and Segal, M. Enumerating longest increasing subsequences and patience sorting. Inform. Process. Lett. 76,1\u20132 (2000), 7\u201311.","journal-title":"Inform. Process. Lett."},{"key":"51_CR2","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0020-0190(93)90174-8","volume":"48","author":"R. Dankelmann","year":"1993","unstructured":"Dankelmann, R. Computing the average distance of an interval graph. Information Processing Letters 48 (1993), 311\u2013314.","journal-title":"Information Processing Letters"},{"key":"51_CR3","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., and Gutman, I. Wiener index of trees: Theory and applications. Acta Applicandae Mathematicae 66 (2001), 211\u2013249.","journal-title":"Acta Applicandae Mathematicae"},{"key":"51_CR4","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.2174\/0929867013371923","volume":"8","author":"E. Estrada","year":"2001","unstructured":"Estrada, E., and Uriarte, E. Recent advances on the role of topological indices in drug discovery research. Current Medicinal Chemistry 8 (2001), 1573\u20131588.","journal-title":"Current Medicinal Chemistry"},{"issue":"1","key":"51_CR5","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G. N. Frederickson","year":"1984","unstructured":"Frederickson, G. N., and Johnson, D. B. Generalized selection and ranking: sorted matrices. SIAM Journal of Computing 13,1 (1984), 14\u201330.","journal-title":"SIAM Journal of Computing"},{"key":"51_CR6","unstructured":"Goldman, D., Istrail, S., Lancia, G., and Piccolboni, A. Algorithmic strategies in combinatorial chemistry. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms (2000), pp. 275\u2013284."},{"key":"51_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-70982-1","volume-title":"Mathematical concepts in organic chemistry","author":"I. Gutman","year":"1986","unstructured":"Gutman, I., and Polansky, O. E. Mathematical concepts in organic chemistry. Springer-Verlag, Berlin, 1986."},{"key":"51_CR8","first-page":"327","volume":"45","author":"I. Gutman","year":"1995","unstructured":"Gutman, I., and Yeh, Y. The sum of all distances in bipartite graphs. Math. Slovaca 45 (1995), 327\u2013334.","journal-title":"Math. Slovaca"},{"key":"51_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2103-4","volume-title":"A classical introduction to modern number theory","author":"K. F. Ireland","year":"1990","unstructured":"Ireland, K. F., and Rosen, M. I. A classical introduction to modern number theory. Springer-Verlag, New York, 1990."},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1021\/ci980004b","volume":"38","author":"M. Lepovi\u0107","year":"1998","unstructured":"Lepovi\u0107, M., and Gutman, I. A collective property of trees and chemical trees. J. Chem. Inf. Comput. Sci. 38 (1998), 823\u2013826.","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1017037831628","volume":"12","author":"Y. C. Martin","year":"1998","unstructured":"Martin, Y. C. 3D QSAR. current state, scope, and limitations. Perspect. Drug Discovery Des. 12 (1998), 3\u201332.","journal-title":"Perspect. Drug Discovery Des."},{"key":"51_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF01167206","volume":"2","author":"B. Mohar","year":"1988","unstructured":"Mohar, B., and Pisanski, T. How to compute the wiener index of a graph. Journal of Mathematical Chemistry 2 (1988), 267\u2013277.","journal-title":"Journal of Mathematical Chemistry"},{"key":"51_CR13","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. J. Amer. Chem. Soc. 69 (1947), 17\u201320.","journal-title":"J. Amer. Chem. Soc."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T15:53:22Z","timestamp":1551023602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_51","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}