{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:06Z","timestamp":1725559146240},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_62","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"717-728","source":"Crossref","is-referenced-by-count":0,"title":["Boundary-Optimal Triangulation Flooding"],"prefix":"10.1007","author":[{"given":"Richard J.","family":"Nowakowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","doi-asserted-by":"crossref","unstructured":"Alliez, P., Desbrun, M.: Valence-driven connectivity encoding for 3d meshes. In: Proceedings of Eurographics, pp. 480\u2013489 (2001)","DOI":"10.1111\/1467-8659.00541"},{"issue":"2","key":"62_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/234972.234976","volume":"15","author":"R. Bar-Yehuda","year":"1996","unstructured":"Bar-Yehuda, R., Gotsman, C.: Time\/space tradeoffs for polygon mesh rendering. ACM Transactions on Graphics\u00a015(2), 141\u2013152 (1996)","journal-title":"ACM Transactions on Graphics"},{"key":"62_CR3","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures, pp. 200\u2013209 (2002)","DOI":"10.1145\/564905.564906"},{"issue":"3","key":"62_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Computing Surveys\u00a034(3), 313\u2013356 (2002)","journal-title":"ACM Computing Surveys"},{"key":"62_CR5","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1006\/jagm.1993.1013","volume":"14","author":"K. Diks","year":"1993","unstructured":"Diks, K., Djidjev, H.N., Sykora, O., Vrto, I.: Edge separators of planar and outerplanar graphs with applications. Journal of Algorithms\u00a014, 258\u2013279 (1993)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"62_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/333979.333980","volume":"47","author":"M. Franklin","year":"2000","unstructured":"Franklin, M., Galil, Z., Yung, M.: Eavesdropping games: A graph theoretic approach to privacy in distributed systems. Journal of the ACM\u00a047(2), 225\u2013243 (2000)","journal-title":"Journal of the ACM"},{"issue":"1","key":"62_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1111\/1467-8659.t01-1-00649","volume":"22","author":"C. Gotsman","year":"2003","unstructured":"Gotsman, C.: On the optimality of valence-based connectivity coding. Computer Graphics Forum\u00a022(1), 99\u2013102 (2003)","journal-title":"Computer Graphics Forum"},{"key":"62_CR8","unstructured":"Hurtado, F.: Open problem posed at the 15th Canadian Conference on Computational Geometry (2003)"},{"issue":"2","key":"62_CR9","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1137\/S0097539796298340","volume":"29","author":"D. Karger","year":"1999","unstructured":"Karger, D.: A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAM Journal on Computing\u00a029(2), 492\u2013514 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"62_CR10","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF00264496","volume":"16","author":"T. Lengauer","year":"1981","unstructured":"Lengauer, T.: Black-white pebble games and graph separation. Acta Informatica\u00a016(4), 465\u2013475 (1981)","journal-title":"Acta Informatica"},{"issue":"2","key":"62_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics\u00a036(2), 177\u2013189 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"62_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/BFb0036931","volume-title":"Proceedings of the 10th International Colloquium on Automata, Languages, and Programming","author":"F. Makedon","year":"1983","unstructured":"Makedon, F., Sudborough, H.: Minimizing width in linear layout. In: Proceedings of the 10th International Colloquium on Automata, Languages, and Programming. LNCS, vol.\u00a0154, pp. 478\u2013490. Springer, Heidelberg (1983)"},{"issue":"1","key":"62_CR13","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The complexity of searching a graph. Journal of the ACM\u00a035(1), 18\u201344 (1988)","journal-title":"Journal of the ACM"},{"key":"62_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","volume":"32","author":"G.L. Miller","year":"1986","unstructured":"Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. Journal of Computer and System Sciences\u00a032, 265\u2013279 (1986)","journal-title":"Journal of Computer and System Sciences"},{"key":"62_CR15","series-title":"P.\u00a0Mutzel","first-page":"497","volume-title":"Algorithms - ESA 1995","author":"P. Mutzel","year":"1995","unstructured":"Mutzel, P.: A polyhedral approach to planar augmentation and related problems. In: Spirakis, P.G. (ed.) ESA 1995. P.\u00a0Mutzel, vol.\u00a0979, pp. 497\u2013507. Springer, Heidelberg (1995)"},{"issue":"4","key":"62_CR16","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/S1389-1286(00)00136-5","volume":"34","author":"E.H. Spafford","year":"2000","unstructured":"Spafford, E.H., Zamboni, D.: Intrusion detection using autonomous agents. Computer Networks\u00a034(4), 547\u2013570 (2000)","journal-title":"Computer Networks"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:30Z","timestamp":1605759690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}