{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T10:14:33Z","timestamp":1751019273831},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671596"},{"type":"electronic","value":"9783540465218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_10","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T18:47:16Z","timestamp":1194115636000},"page":"113-124","source":"Crossref","is-referenced-by-count":6,"title":["Labeling Downtown"],"prefix":"10.1007","author":[{"given":"Gabriele","family":"Neyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even S., Itai A., Shamir A.: On the Complexity of Timetable andMulticommodity Flow Problems. SIAM Journal on Computing, 5(4):691\u2013703, (1976)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR2","series-title":"Technical Report","volume-title":"Institute of Computer Science","author":"R.J. Gardner","year":"1995","unstructured":"Gardner R.J., Gritzmann P.: Descrete Tomography: Determination of Finite Sets by XRays. Technical Report TR-95-13, Institute of Computer Science, University of Trier, Austria, (1995)"},{"key":"10_CR3","volume-title":"Computers and Intractibility, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractibility, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, (1979)"},{"key":"10_CR4","unstructured":"Neyer G., Hennes H.: Map Labeling with Application to Graph Labeling. GI Forschungsseminar: Zeichnen von Graphen, Teubner Verlag, to appear, (2000)"},{"key":"10_CR5","series-title":"Technical Report","volume-title":"Labeling Downtown","author":"G. Neyer","year":"1999","unstructured":"Neyer G., Wagner F.: Labeling Downtown. Technical ReportTR 324, \n                    ftp:\/\/ftp.inf.ethz.ch\/pub\/publications\/tech-reports\/3xx\/324.ps.gz\n                    \n                  , Institute of Computer Science, ETH Zurich, Switzerland, (1999)"},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 4th Italian Conference on Algorithms and Complexity (CIAC\u20192000)","author":"W. Unger","year":"2000","unstructured":"Unger W., Seibert S.: The Hardness of Placing Street Names in a Manhattan Type Map. Proceedings of the 4th Italian Conference on Algorithms and Complexity (CIAC\u20192000), Lecture Notes in Computer Science, Springer-Verlag, this volume, (2000)"},{"key":"10_CR7","series-title":"Technical Report SFB-Report","volume-title":"The Reconstruction of Polyominoes from their Orthogonal Projections","author":"G.J. Woeginger","year":"1996","unstructured":"Woeginger G.J.: The Reconstruction of Polyominoes from their Orthogonal Projections. Technical Report SFB-Report 65, TU Graz, Institut f\u00fcr Mathematik, A-8010 Graz, Austria, (1996)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T17:56:30Z","timestamp":1551030990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}