{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:43:36Z","timestamp":1725857016150},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319396354"},{"type":"electronic","value":"9783319396361"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-39636-1_1","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T06:36:37Z","timestamp":1464071797000},"page":"1-16","source":"Crossref","is-referenced-by-count":1,"title":["Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Klocker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herbert","family":"Fleischner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s00373-006-0666-z","volume":"22","author":"S Abbasi","year":"2006","unstructured":"Abbasi, S., Jamshed, A.: A degree constraint for uniquely Hamiltonian graphs. Graphs and Combinatorics 22(4), 433\u2013442 (2006)","journal-title":"Graphs and Combinatorics"},{"key":"1_CR2","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2011","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2011)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bevc, S., Savnik, I.: Using tries for subset and superset queries. In: Proceedings of the ITI 2009, pp. 147\u2013152 (2009)","DOI":"10.1109\/ITI.2009.5196071"},{"issue":"2","key":"1_CR4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1006\/jctb.1998.1845","volume":"74","author":"JA Bondy","year":"1998","unstructured":"Bondy, J.A., Jackson, B.: Vertices of small degree in uniquely Hamiltonian Graphs. J. Comb. Theory Ser. B 74(2), 265\u2013275 (1998)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1\u20132","key":"1_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(99)00206-X","volume":"212","author":"G Caporossi","year":"2000","unstructured":"Caporossi, G., Hansen, P.: Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system. Discrete Math. 212(1\u20132), 29\u201344 (2000)","journal-title":"Discrete Math."},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/3-540-45465-9_39","volume-title":"Automata, Languages and Programming","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Indyk, P., Panigrahy, R.: New algorithms for subset query, partial match, orthogonal range searching, and related problems. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 451\u2013462. Springer, Heidelberg (2002)"},{"key":"1_CR7","unstructured":"Cook, W.: Concorde TSP Solver (2011). http:\/\/www.math.uwaterloo.ca\/tsp\/concorde\/ . Accessed on 31 Jan 2016"},{"issue":"3","key":"1_CR8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0095-8956(80)90087-8","volume":"29","author":"RC Entringer","year":"1980","unstructured":"Entringer, R.C., Swart, H.: Spanning cycles of nearly cubic graphs. J. Comb. Theory Ser. B 29(3), 303\u2013309 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"5","key":"1_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1002\/jgt.3190180503","volume":"18","author":"H Fleischner","year":"1994","unstructured":"Fleischner, H.: Uniqueness of maximal dominating cycles in 3-regular graphs and of Hamiltonian cycles in 4-regular graphs. J. Graph Theory 18(5), 449\u2013459 (1994)","journal-title":"J. Graph Theory"},{"issue":"2","key":"1_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/jgt.21729","volume":"75","author":"H Fleischner","year":"2014","unstructured":"Fleischner, H.: Uniquely Hamiltonian graphs of minimum degree 4. J. Graph Theory 75(2), 167\u2013177 (2014)","journal-title":"J. Graph Theory"},{"issue":"3","key":"1_CR11","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M Garey","year":"1983","unstructured":"Garey, M., Johnson, D.: Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4(3), 312\u2013316 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"1_CR12","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s00373-002-0492-x","volume":"19","author":"RJ Gould","year":"2003","unstructured":"Gould, R.J.: Advances on the Hamiltonian problem-a survey. Graphs and Combinatorics 19(1), 7\u201352 (2003)","journal-title":"Graphs and Combinatorics"},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-1-4615-5775-3_30","volume-title":"Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization","author":"P Hansen","year":"1999","unstructured":"Hansen, P., Mladenovi\u0107, N.: An introduction to variable neighborhood search. In: Voss, S., et al. (eds.) Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization, pp. 433\u2013458. Kluwer, Dordrecht (1999)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N.: A tutorial on variable neighborhood search. Technical report G-2003-46, GERAD, July 2003","DOI":"10.1007\/0-306-48056-5_6"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-540-74469-6_11","volume-title":"Database and Expert Systems Applications","author":"S Helmer","year":"2007","unstructured":"Helmer, S., Aly, R., Neumann, T., Moerkotte, G.: Indexing set-valued attributes with a multi-level extendible hashing scheme. In: Wagner, R., Revell, N., Pernul, G. (eds.) DEXA 2007. LNCS, vol. 4653, pp. 98\u2013108. Springer, Heidelberg (2007)"},{"issue":"1","key":"1_CR16","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: Effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR17","unstructured":"Helsgaun, K.: LKH (2012). http:\/\/www.akira.ruc.dk\/~keld\/research\/LKH\/ . Accessed 03 Feb 2016"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Jayram, T.S., Khot, S., Kumar, R., Rabani, Y.: Cell-probe lower bounds for the partial match problem. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 667\u2013672. ACM, New York, (2003)","DOI":"10.1145\/780542.780639"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Klocker, B., Raidl, G.: Finding uniquely hamiltonian graphs with minimal degree three. Technical report, Algorithms and Complexity Group, TU Wien (2016)","DOI":"10.1007\/978-3-319-39636-1_1"},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, pp. 399\u2013419. Springer US, London (2010)"},{"key":"1_CR21","unstructured":"Sheehan, J.: The multiplicity of Hamiltonian circuits in a graph. In: Recent Advances in Graph Theory, pp. 477\u2013480 (1975)"},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0167-5060(08)70511-9","volume":"3","author":"AG Thomason","year":"1978","unstructured":"Thomason, A.G.: Hamiltonian cycles and uniquely edge colourable graphs. Ann. Discrete Math. 3, 259\u2013268 (1978). Advances in Graph Theory","journal-title":"Ann. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39636-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T14:51:32Z","timestamp":1567954292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39636-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319396354","9783319396361"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39636-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}