{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T17:08:53Z","timestamp":1726506533230},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_34","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T09:37:43Z","timestamp":1196329063000},"page":"340-350","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Optimal Labelling of Point Features in the Slider Model"],"prefix":"10.1007","author":[{"given":"Gunnar W.","family":"Klau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"issue":"2","key":"34_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s101070050058","volume":"85","author":"B. V. Cherkassky","year":"1999","unstructured":"B. V. Cherkassky and A. V. Goldberg, Negative-cycle detection algorithms, Mathematical Programming 85 (1999), no. 2, 277\u2013311.","journal-title":"Mathematical Programming"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/212332.212334","volume":"14","author":"J. Christensen","year":"1995","unstructured":"J. Christensen, J. Marks, and S. Shieber, An empirical study of algorithms for point-feature label placement, ACM Transactions on Graphics 14 (1995), no. 3, 203\u2013232.","journal-title":"ACM Transactions on Graphics"},{"unstructured":"ILOG, CPLEX 6.5 Reference Manual, 1999.","key":"34_CR3"},{"key":"34_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/3-540-46648-7_3","volume-title":"Proc. 8th Internat. Symp. on Graph Drawing (GD\u2019 99)","author":"G. W. Klau","year":"1999","unstructured":"G. W. Klau and P. Mutzel, Combining graph labeling and compaction, Proc. 8th Internat. Symp. on Graph Drawing (GD\u2019 99) (\u0160ti\u0159\u00fdn Castle, Czech Republic) (J. Kratochv\u00fdl, ed.), LNCS, no. 1731, Springer-Verlag, 1999, pp. 27\u201337."},{"key":"34_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-48777-8_23","volume-title":"Integer Programming and Combinatorial Optimization (IPCO\u2019 99)","author":"G. W. Klau","year":"1999","unstructured":"G. W. Klau and P. Mutzel, Optimal compaction of orthogonal grid drawings, Integer Programming and Combinatorial Optimization (IPCO\u2019 99) (Graz, Austria) (G.P. Cornu\u00e9jols, R. E. Burkard, and G. J. Woeginger, eds.), LNCS, no. 1610, Springer-Verlag, 1999, pp. 304\u2013319."},{"unstructured":"K. Mehlhorn and S. N\u00e4her, LEDA. A platform for combinatorial and geometric computing, Cambridge University Press, 1999.","key":"34_CR6"},{"key":"34_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0925-7721(99)00005-X","volume":"13","author":"M. Kreveld van","year":"1999","unstructured":"M. van Kreveld, T. Strijk, and A. Wolff, Point labeling with sliding labels, Computational Geometry: Theory and Applications 13 (1999), 21\u201347.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"34_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/3-540-48481-7_37","volume-title":"Proc. 7th Europ. Symp. on Algorithms (ESA\u2019 99)","author":"B. Verweij","year":"1999","unstructured":"B. Verweij and K. Aardal, An optimisation algorithm for maximum independent set with applications in map labelling, Proc. 7th Europ. Symp. on Algorithms (ESA\u2019 99) (Prague, Czech Republic), LNCS, vol. 1643, Springer-Verlag, 1999, pp. 426\u2013437."},{"unstructured":"A. Wolff and T. Strijk, The map labeling bibliography, \n                    http:\/\/www.math-inf.uni-greifswald.de\/map-labeling\/bibliography\n                    \n                  .","key":"34_CR9"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:16:52Z","timestamp":1558279012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_34"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"21 July 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}