{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:39:21Z","timestamp":1725467961022},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650782"},{"type":"electronic","value":"9783540496724"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056940","type":"book-chapter","created":{"date-parts":[[2006,7,31]],"date-time":"2006-07-31T04:49:17Z","timestamp":1154321357000},"page":"988-997","source":"Crossref","is-referenced-by-count":2,"title":["Recombination operators for evolutionary graph drawing"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Kobler","sequence":"first","affiliation":[]},{"given":"Andrea G. B.","family":"Tettamanzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,3]]},"reference":[{"key":"97_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice","author":"T. B\u00e4ck","year":"1996","unstructured":"T. B\u00e4ck. Evolutionary algorithms in theory and practice. Oxford University Press, Oxford, 1996."},{"key":"97_CR2","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Technical report, Available on the Internet, URL: ftp:\/\/wilma.cs.brown.edu\/pub\/papers\/compgeo\/gdbiblio.ps.Z, 1989."},{"key":"97_CR3","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"P. Eades. A heuristics for graph drawing. Congressus Numerantium, 42:149\u2013160, 1984.","journal-title":"Congressus Numerantium"},{"key":"97_CR4","unstructured":"P. Eades and R. Tamassia. Algorithms for drawing graphs: An annotated bibliography. Technical Report CS-89-09, Department of Computer Science, Brown University, 1989."},{"key":"97_CR5","doi-asserted-by":"crossref","unstructured":"C. Fleurent and J.A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63, 1996.","DOI":"10.1007\/BF02125407"},{"issue":"3","key":"97_CR6","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M. R. Garey","year":"1983","unstructured":"M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 4(3):312\u2013316, 1983.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"97_CR7","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publ., 1997.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"97_CR8","volume-title":"Genetic Algorithms in Search, Optimization & Machine Learning","author":"D. E. Goldberg","year":"1989","unstructured":"D. E. Goldberg. Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley, Reading, MA, 1989."},{"key":"97_CR9","unstructured":"A. Hertz, E. Taillard, and D. de Werra. Tabu search. In J. K. Lenstra, editor, Local Search in Combinatorial Optimization. Wiley, 1995."},{"issue":"1","key":"97_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0196-6774(82)90011-6","volume":"3","author":"D. S. Johnson","year":"1982","unstructured":"D. S. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, 3(1):89\u201399, 1982.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"97_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0196-6774(84)90045-2","volume":"5","author":"D. S. Johnson","year":"1984","unstructured":"D. S. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, 5(2):147\u2013160, 1984.","journal-title":"Journal of Algorithms"},{"key":"97_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02830-8","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z. Michalewicz","year":"1992","unstructured":"Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin, 1992."},{"key":"97_CR13","volume-title":"Numerical optimization of computer models","author":"H.-P. Schwefel","year":"1981","unstructured":"H.-P. Schwefel. Numerical optimization of computer models. Wiley, Chichester; New York, 1981."},{"key":"97_CR14","unstructured":"E. Taillard. Recherches it\u00e9ratives dirig\u00e9es parall\u00e8les. PhD thesis, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne, 1993."},{"issue":"1","key":"97_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, 18(1):61\u201379, 1988.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"97_CR16","first-page":"116","volume-title":"The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best","author":"D. Whitley","year":"1989","unstructured":"D. Whitley. The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 116\u2013121, San Mateo, CA, 1989. Morgan Kaufmann."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T22:34:15Z","timestamp":1627684455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650782","9783540496724"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0056940","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}