{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:39:09Z","timestamp":1725471549661},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540483816"},{"type":"electronic","value":"9783540483823"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11917496_19","type":"book-chapter","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T02:16:13Z","timestamp":1161137773000},"page":"205-216","source":"Crossref","is-referenced-by-count":0,"title":["Generation of Graphs with Bounded Branchwidth"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Paul","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T., Kratsch, D.: Treewidth and pathwidth of permutation graphs. SIAM J. Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM J. Computing"},{"key":"19_CR2","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":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 19\u201336. Springer, Heidelberg (1997)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/jagm.1999.1011","volume":"32","author":"H.L. Bodlaender","year":"1999","unstructured":"Bodlaender, H.L., Thilikos, D.M.: Graphs with branchwidth at most three. Journal of Algorithms\u00a032, 167\u2013194 (1999)","journal-title":"Journal of Algorithms"},{"key":"19_CR4","first-page":"233","volume":"15","author":"W. Cook","year":"2003","unstructured":"Cook, W., Seymour, P.D.: Tour merging via branch-decompositions. Journal on Computing\u00a015, 233\u2013248 (2003)","journal-title":"Journal on Computing"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/3-540-45061-0_65","volume-title":"Automata, Languages and Programming","author":"E. Demaine","year":"2003","unstructured":"Demaine, E., Fomin, F., Hajiaghayi, M., Thilikos, D.M.: Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 829\u2013844. Springer, Heidelberg (2003)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11561071_11","volume-title":"Algorithms \u2013 ESA 2005","author":"F. Dorn","year":"2005","unstructured":"Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 95\u2013106. Springer, Heidelberg (2005)"},{"key":"19_CR7","unstructured":"Fomin, F., Thilikos, D.M.: Dominating sets in planar graphs: Branch-width and exponential speedup. In: 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 168\u2013177 (2003)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24749-4_6","volume-title":"STACS 2004","author":"F. Fomin","year":"2004","unstructured":"Fomin, F., Thilikos, D.M.: A simple and fast approach for solving problems on planar graphs. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 56\u201367. Springer, Heidelberg (2004)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-540-27836-8_50","volume-title":"Automata, Languages and Programming","author":"F. Fomin","year":"2004","unstructured":"Fomin, F., Thilikos, D.: Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speedup. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 581\u2013592. Springer, Heidelberg (2004)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/11604686_33","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Fomin","year":"2005","unstructured":"Fomin, F., Mazoit, F., Todinca, I.: Computing branchwidth via efficient triangulations and blocks. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 374\u2013384. Springer, Heidelberg (2005)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.dam.2004.01.015","volume":"145","author":"T. Kloks","year":"2005","unstructured":"Kloks, T., Kratochvil, J., M\u00fcller, H.: New branchwidth territories. Discrete Applied Mathematics\u00a0145, 266\u2013275 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR12","volume-title":"Algorithm design","author":"J. Kleinberg","year":"2005","unstructured":"Kleinberg, J., Tardos, E.: Algorithm design. Addison-Wesley, Reading (2005)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Paul, C., Telle, J.A.: Edge-maximal graphs of branchwidth k. In: International Conference on Graph Theory - ICGT. Electronic Notes in Discrete Mathematics, vol.\u00a023, pp. 363\u2013368 (2005)","DOI":"10.1016\/j.endm.2005.06.075"},{"key":"19_CR14","unstructured":"Paul, C., Proskurowski, A., Telle, J.A.: Algorithm generation of graphs of branchwidht \u2264\u2009k. LIRMM Technical report number RR-05047 (2005)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/11561071_35","volume-title":"Algorithms \u2013 ESA 2005","author":"C. Paul","year":"2005","unstructured":"Paul, C., Telle, J.A.: New tools and simpler algorithms for branchwidth. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 379\u2013390. Springer, Heidelberg (2005)"},{"key":"19_CR16","series-title":"London Mathematical Society Lecture Note Series","volume-title":"Surveys in Combinatorics","author":"B. Reed","year":"1997","unstructured":"Reed, B.: Treewidth and tangles, a new measure of connectivity and some applications. In: Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol.\u00a0241. Cambridge University Press, Cambridge (1997)"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors X: Obstructions to tree-decomposition. Journal on Combinatorial Theory Series B\u00a052, 153\u2013190 (1991)","journal-title":"Journal on Combinatorial Theory Series B"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","volume":"7","author":"D. Rose","year":"1974","unstructured":"Rose, D.: On simple characterization of k-trees. Discrete Mathematics\u00a07, 317\u2013322 (1974)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11917496_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:42:30Z","timestamp":1619494950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11917496_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540483816","9783540483823"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11917496_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}