{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T09:57:11Z","timestamp":1700906231134},"reference-count":36,"publisher":"Informa UK Limited","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1080\/00207160410001684352","type":"journal-article","created":{"date-parts":[[2004,6,29]],"date-time":"2004-06-29T15:47:08Z","timestamp":1088524028000},"page":"555-568","source":"Crossref","is-referenced-by-count":4,"title":["A simulated annealing algorithm for the maximum planar subgraph problem"],"prefix":"10.1080","volume":"81","author":[{"given":"Timo","family":"Poranen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"b1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02086607"},{"key":"b2","volume-title":"Graph Drawing","author":"Di Battista G.","year":"1999"},{"key":"b3","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.1995.tb00007.x"},{"key":"b4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00032","volume":"5","author":"Liebers A.","year":"2001","journal-title":"J. Graph Algorithms Appl."},{"key":"b5","unstructured":"Vrt\u00f3 I. (2003) Crossing numbers of graphs: A bibliography Available electronically atftp:\/\/ifi.savba.sk\/pub\/imrich\/crobib.ps.gz"},{"key":"b6","volume-title":"Graph Theory","author":"Harary F.","year":"1971"},{"key":"b7","doi-asserted-by":"publisher","DOI":"10.1007\/PL00007219"},{"key":"b8","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90100-X"},{"key":"b9","first-page":"727","volume-title":"Proc. 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing","author":"Liu P.","year":"1977"},{"key":"b10","first-page":". 253\u2013264","volume-title":"Proc. 10th Annual ACM Symposium on Theory of Computing","author":"Yannakakis M.","year":"1978"},{"key":"b11","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80045-1"},{"key":"b12","doi-asserted-by":"publisher","DOI":"10.1145\/321850.321852"},{"key":"b13","first-page":"140","volume-title":"Proc. of the 10th ACM-SIAM Symposium on Discrete Algorithms","author":"Boyer J.","year":"1999"},{"key":"b14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00120-0"},{"key":"b15","first-page":"49","volume":"18","author":"Cimikowski R.","year":"1997","journal-title":"J. Inf. Opt. Science"},{"key":"b16","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00326-E"},{"key":"b17","first-page":"21","volume-title":"Proc. of the 23rd Southeastern Internation Conference on Combinatorics, Graph Theory, and Computing","author":"Cimikowski R.","year":"1992"},{"key":"b18","first-page":"322","volume-title":"Proc. of the 6th ACM-SIAM Symposium on Discrete Algorithms","author":"Cimikowski R.","year":"1995"},{"key":"b19","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0920"},{"key":"b20","doi-asserted-by":"publisher","DOI":"10.1080\/00207169408804320"},{"key":"b21","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(95)00011-D"},{"key":"b22","first-page":"378","volume":"3","author":"Aragon C. R.","year":"1991","journal-title":"Oper. Res."},{"key":"b23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.6.865"},{"key":"b24","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"Reeves C.","year":"1995"},{"key":"b25","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230240203"},{"key":"b26","doi-asserted-by":"publisher","DOI":"10.1126\/science.245.4923.1221"},{"key":"b27","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<173::AID-NET5>3.0.CO;2-E"},{"key":"b28","first-page":"pp. 168\u2013183","volume-title":"Handbook of Applied Optimization","author":"Pitsoulis L.","year":"2002"},{"key":"b29","doi-asserted-by":"publisher","DOI":"10.1109\/43.31548"},{"key":"b30","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"b31","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applications","author":"van Laarhoven P.","year":"1987"},{"key":"b32","volume-title":"Local Search in Combinatorial Optimization","author":"Aarts E.","year":"1997"},{"key":"b33","unstructured":"LEDA version 4.3 (commercial) (2002) Available athttp:\/\/www.algorithmic-solutions.com"},{"key":"b34","first-page":"215","volume-title":"Proc. of the 5th and 6th DIMACS Implementation Challenges","author":"Johnson D.","year":"2002"},{"key":"b35","unstructured":"Mutzel P. (1994) The Maximum Planar Subgraph Problem PhD thesis Universit\u00e4t zu K\u00f6ln"},{"key":"b36","doi-asserted-by":"publisher","DOI":"10.1145\/300515.300517"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160410001684352","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,6]],"date-time":"2018-06-06T19:46:57Z","timestamp":1528314417000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160410001684352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["10.1080\/00207160410001684352"],"URL":"https:\/\/doi.org\/10.1080\/00207160410001684352","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}