{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T23:23:24Z","timestamp":1778887404061,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662531730","type":"print"},{"value":"9783662531747","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_30","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T10:50:06Z","timestamp":1470307806000},"page":"425-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Triangulating Planar Graphs While Keeping the Pathwidth Small"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.tcs.2014.04.032","volume":"554","author":"J Babu","year":"2014","unstructured":"Babu, J., Basavaraju, M., Chandran, L.S., Rajendraprasad, D.: 2-connecting outer-planar graphs without blowing up the pathwidth. Theor. Comput. Sci. 554, 119\u2013134 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-38016-7_22","volume-title":"Approximation and Online Algorithms","author":"T Biedl","year":"2013","unstructured":"Biedl, T.: A 4-approximation for the height of drawing 2-connected outer-planar graphs. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 272\u2013285. Springer, Heidelberg (2013)"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.dam.2014.10.017","volume":"181","author":"T Biedl","year":"2015","unstructured":"Biedl, T.: On triangulating \n                      \n                        \n                      \n                      $$k$$\n                    -outer-planar graphs. Discrete Appl. Math. 181, 275\u2013279 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"30_CR4","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/PL00009182","volume":"19","author":"T Biedl","year":"1997","unstructured":"Biedl, T., Kant, G., Kaufmann, M.: On triangulating planar graphs under the four-connectivity constraint. Algorithmica 19(4), 427\u2013446 (1997)","journal-title":"Algorithmica"},{"issue":"3","key":"30_CR5","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.comgeo.2012.09.004","volume":"46","author":"T Biedl","year":"2013","unstructured":"Biedl, T., Vel\u00e1zquez, L.E.R.: Drawing planar 3-trees with given face areas. Comput. Geom. Theor. Appl. 46(3), 276\u2013285 (2013)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"HL Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: algorithmic techniques and results. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 19\u201336. Springer, Heidelberg (1997)"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"5","key":"30_CR8","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"30_CR9","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/jgaa.00075","volume":"7","author":"S Felsner","year":"2003","unstructured":"Felsner, S., Liotta, G., Wismath, S.: Straight-line drawings on restricted integer grids in two and three dimensions. J. Graph Algorithms Appl. 7(4), 335\u2013362 (2003)","journal-title":"J. Graph Algorithms Appl."},{"key":"30_CR10","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 1st edn. Academic Press, New York (1980)","edition":"1"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-02882-3_25","volume-title":"Computing and Combinatorics","author":"C Gutwenger","year":"2009","unstructured":"Gutwenger, C., Mutzel, P., Zey, B.: On the hardness and approximability of planar biconnectivity augmentation. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 249\u2013257. Springer, Heidelberg (2009)"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-55706-7_22","volume-title":"Algorithm Theory - SWAT \u201992","author":"G Kant","year":"1992","unstructured":"Kant, G., Bodlaender, H.L.: Triangulating planar graphs while minimizing the maximum degree. In: Nurmi, O., Ukkonen, E. (eds.) SWAT 1992. LNCS, vol. 621, pp. 258\u2013271. Springer, Heidelberg (1992)"},{"key":"30_CR13","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 1990), pp. 138\u2013148 (1990)"},{"issue":"3","key":"30_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1142\/S0218195904001433","volume":"14","author":"M Suderman","year":"2004","unstructured":"Suderman, M.: Pathwidth and layered drawings of trees. Int. J. Comput. Geom. Appl. 14(3), 203\u2013225 (2004)","journal-title":"Int. J. Comput. Geom. Appl."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:11:55Z","timestamp":1558314715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Garching","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}