{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:57:02Z","timestamp":1725566222001},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230717"},{"type":"electronic","value":"9783540286394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28639-4_18","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:25:35Z","timestamp":1285014335000},"page":"200-212","source":"Crossref","is-referenced-by-count":4,"title":["The Minimum Weight Triangulation Problem with Few Inner Points"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hoffmann","sequence":"first","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Aichholzer, O.: The path of a triangulation. In: Proc. 15th SoCG, pp. 14\u201323 (1999)","DOI":"10.1145\/304893.304896"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-45078-8_33","volume-title":"Algorithms and Data Structures","author":"O. Aichholzer","year":"2003","unstructured":"Aichholzer, O., Rote, G., Speckmann, B., Streinu, I.: The zigzag path of a pseudo-triangulation. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 377\u2013388. Springer, Heidelberg (2003)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0925-7721(93)90016-Y","volume":"3","author":"E. Anagnostou","year":"1993","unstructured":"Anagnostou, E., Corneil, D.: Polynomial-time instances of the minimum weight triangulation problem. Comput. Geom.\u00a03, 247\u2013259 (1993)","journal-title":"Comput. Geom."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1142\/S0218195902000979","volume":"12","author":"P. Bose","year":"2002","unstructured":"Bose, P., Devroye, L., Evans, W.: Diamonds are not a minimum weight triangulation\u2019s best friend. Internat. J. Comput. Geom. Appl.\u00a012, 445\u2013453 (2002)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S0304-3975(00)00318-2","volume":"262","author":"S.-W. Cheng","year":"2001","unstructured":"Cheng, S.-W., Xu, Y.-F.: On \u03b2-skeleton as a subgraph of the minimum weight triangulation. Theor. Comput. Sci.\u00a0262, 459\u2013471 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-27798-9_30","volume-title":"Computing and Combinatorics","author":"V.G. Deineko","year":"2004","unstructured":"Deineko, V.G., Hoffmann, M., Okamoto, Y., Woeginger, G.J.: The traveling salesman problem with few inner points. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 268\u2013277. Springer, Heidelberg (2004)"},{"key":"18_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)"},{"key":"18_CR8","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. W.H. Freeman & Company, New York (1979)"},{"key":"18_CR9","unstructured":"Gilbert, P.D.: New results in planar triangulations. Master Thesis, University of Illinois, Urbana (1979)"},{"key":"18_CR10","unstructured":"Hu, S.: A constant-factor approximation for maximum weight triangulation. In: Proc. 15th CCCG, pp. 150\u2013154 (2003)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-63890-3_41","volume-title":"Algorithms and Computation","author":"Y. Kyoda","year":"1997","unstructured":"Kyoda, Y., Imai, K., Takeuchi, F., Tajima, A.: A branch-and-cut approach for minimum weight triangulation. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol.\u00a01350, pp. 384\u2013393. Springer, Heidelberg (1997)"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70044-X","volume":"9","author":"G. Klincsek","year":"1980","unstructured":"Klincsek, G.: Minimal triangulations of polygonal domains. Annals Discrete Math.\u00a09, 121\u2013123 (1980)","journal-title":"Annals Discrete Math."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1006\/jagm.1997.0918","volume":"27","author":"C. Levcopoulos","year":"1998","unstructured":"Levcopoulos, C., Krznaric, D.: Quasi-greedy triangulations approximating the minimum weight triangulation. J. Algor.\u00a027, 303\u2013338 (1998)","journal-title":"J. Algor."},{"key":"18_CR14","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Habilitation Thesis, Universit\u00e4t T\u00fcbingen (2002)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Shamos, M.I., Hoey, D.: Geometric intersection problems. In: Proc. 17th FOCS, pp. 208\u2013215 (1976)","DOI":"10.1109\/SFCS.1976.16"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0020-0190(99)00037-X","volume":"70","author":"C.A. Wang","year":"1999","unstructured":"Wang, C.A., Chin, F.Y., Yang, B.T.: Maximum weight triangulation and graph drawing. Inform. Proccess. Lett.\u00a070, 17\u201322 (1999)","journal-title":"Inform. Proccess. Lett."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0925-7721(01)00008-6","volume":"19","author":"C.A. Wang","year":"2001","unstructured":"Wang, C.A., Yang, B.: A lower bound for \u03b2-skeleton belonging to minimum weight triangulations. Comput. Geom.\u00a019, 35\u201346 (2001)","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28639-4_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:56Z","timestamp":1620012596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28639-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230717","9783540286394"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28639-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}