{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:43:16Z","timestamp":1787503396489,"version":"build-2736575974"},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"value":"354017219X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039624","type":"book-chapter","created":{"date-parts":[[2006,1,31]],"date-time":"2006-01-31T11:55:52Z","timestamp":1138708552000},"page":"420-431","source":"Crossref","is-referenced-by-count":6,"title":["On the contact-minimization-problem"],"prefix":"10.1007","author":[{"given":"Paul","family":"Molitor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"F. Barahona: \u201cSur la complexit\u00e9 du probl\u00e8me du verre de spins\u201d Rapport de Recherche 171, Octobre 1979, Universit\u00e9 Scientifique Et Medicale et Institut National Polytechnique de Grenoble, Mathematiques Appliqu\u00e9es et Informatique."},{"key":"34_CR2","unstructured":"M. Brady, D. Brown: \u201cVLSI Routing: Four Layers Suffice\u201d Advances in Computing Research, vol. 2 pages 245\u2013257, JAI Press Inc London."},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"M. Ciesielski, E.Kinnen: \u201cAn Optimum Layer Assignment for Routing in IC's and PCB's\u201d Proceedings of the 18th Design Automation Conference, June 1981, pp. 733\u2013737.","DOI":"10.1109\/DAC.1981.1585439"},{"key":"34_CR4","unstructured":"H. Gabow: \u201cImplementation of Algorithms for Maximum Matching on Non-Bipartite Graphs\u201d Ph.D. Dissertation, Stanford University 1973."},{"key":"34_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey, D. Johnson: \u201cComputers and Intractability: A Guide to the Theory of NP-completeness\u201d W.H.Freeman & co., San Francisco, 1979"},{"key":"34_CR6","unstructured":"Y. Kajitani: \u201cOn Via Hole Minimization of Routing on a 2-layer Board\u201d Proceedings of the ICCC 1980, pp.295\u2013298"},{"key":"34_CR7","volume-title":"An NP-complete problem related to three layer channel routing","author":"W. Lipski","year":"1982","unstructured":"W. Lipski: \u201cAn NP-complete problem related to three layer channel routing\u201d Manuscript, Institute of Computer Science, PAS, Warsaw, Poland 1982."},{"key":"34_CR8","doi-asserted-by":"crossref","first-page":"22","DOI":"10.4064\/fm-28-1-22-32","volume":"28","author":"S. MacLane","year":"1937","unstructured":"S. MacLane: \u201cA combinatorial condition for planar graphs\u201d Fundamenta Math. 28, 22\u201332 (1937)","journal-title":"Fundamenta Math."},{"key":"34_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0165-6074(85)90027-4","volume":"16","author":"P. Molitor","year":"1985","unstructured":"P. Molitor: \u201cLayer Assignment by Simulated Annealing\u201d North-Holland, Microprocessing and Microprogramming 16 (1985), pp.345\u2013350","journal-title":"North-Holland, Microprocessing and Microprogramming"},{"key":"34_CR10","unstructured":"R.Y.Pinter: \u201cOptimal Layer Assignment for Interconnect\u201d Proceedings of the ICCC 1982, pp.398\u2013401"}],"container-title":["Lecture Notes in Computer Science","STACS 87"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039624.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T06:41:20Z","timestamp":1627022480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354017219X"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0039624","relation":{},"subject":[]}}