{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:46:55Z","timestamp":1725536815207},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_20","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"223-234","source":"Crossref","is-referenced-by-count":2,"title":["Constructing Brambles"],"prefix":"10.1007","author":[{"given":"Mathieu","family":"Chapelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Mazoit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioan","family":"Todinca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Amini, O., Mazoit, F., Thomass\u00e9, S., Nisse, N.: Partition Submodular Functions. To appear in Disc. Math. (2008), http:\/\/www.lirmm.fr\/~thomasse\/liste\/partsub.pdf"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of Finding Embeddings in a k-Tree. SIAM J. on Algebraic and Discrete Methods\u00a08, 277\u2013284 (1987)","journal-title":"SIAM J. on Algebraic and Discrete Methods"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/11427186_20","volume-title":"Experimental and Efficient Algorithms","author":"E.H. Bachoore","year":"2005","unstructured":"Bachoore, E.H., Bodlaender, H.L.: New Upper Bound Heuristics for Treewidth. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 216\u2013227. Springer, Heidelberg (2005)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Bellenbaum, P., Diestel, R.: Two Short Proofs Concerning Tree-Decompositions. Combinatorics, Probability & Computing\u00a011(6) (2002)","DOI":"10.1017\/S0963548302005369"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput.\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A Partial k-Arboretum of Graphs with Bounded Treewidth. Theor. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00453-007-9056-z","volume":"51","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Grigoriev, A., Koster, A.M.C.A.: Treewidth Lower Bounds with Brambles. Algorithmica\u00a051(1), 81\u201398 (2008)","journal-title":"Algorithmica"},{"issue":"11","key":"20_CR8","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1016\/j.dam.2007.02.004","volume":"155","author":"H.L. Bodlaender","year":"2007","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: On the Maximum Cardinality Search Lower Bound for Treewidth. Disc. App. Math.\u00a0155(11), 1348\u20131372 (2007)","journal-title":"Disc. App. Math."},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00117","volume":"10","author":"H.L. Bodlaender","year":"2006","unstructured":"Bodlaender, H.L., Wolle, T., Koster, A.M.C.A.: Contraction and Treewidth Lower Bounds. J. Graph Algorithms Appl.\u00a010(1), 5\u201349 (2006)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1137\/S0097539799359683","volume":"31","author":"V. Bouchitt\u00e9","year":"2001","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Treewidth and Minimum Fill-in: Grouping the Minimal Separators. SIAM J. Comput.\u00a031(1), 212\u2013232 (2001)","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(01)00007-X","volume":"276","author":"V. Bouchitt\u00e9","year":"2002","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Listing All Potential Maximal Cliques of a Graph. Theor. Comput. Sci.\u00a0276(1-2), 17\u201332 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Chapelle, M., Mazoit, F., Todinca, I.: Constructing Brambles. Technical Report, LIFO, Universit\u00e9 d\u2019Orl\u00e9ans (2009)","DOI":"10.1007\/978-3-642-03816-7_20"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-44867-5_6","volume-title":"Experimental and Efficient Algorithms","author":"F. Clautiaux","year":"2003","unstructured":"Clautiaux, F., Carlier, J., Moukrim, A., N\u00e8gre, S.: New Lower and Upper Bounds for Graph Treewidth. In: Jansen, K., Margraf, M., Mastrolli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol.\u00a02647, pp. 70\u201380. Springer, Heidelberg (2003)"},{"issue":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s00453-007-9041-6","volume":"53","author":"F.V. Fomin","year":"2009","unstructured":"Fomin, F.V., Fraigniaud, P., Nisse, N.: Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica\u00a053(3), 358\u2013373 (2009)","journal-title":"Algorithmica"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1137\/050643350","volume":"38","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Kratsch, D., Todinca, I., Villanger, Y.: Exact Algorithms for Treewidth and Minimum Fill-in. SIAM J. Comput.\u00a038(3), 1058\u20131079 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An Annotated Bibliography on Guaranteed Graph Searching. Theor. Comput. Sci.\u00a0399(3), 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.jctb.2008.06.004","volume":"99","author":"M. Grohe","year":"2009","unstructured":"Grohe, M., Marx, D.: On Tree Width, Bramble Size, and Expansion. J. Comb. Theory, Ser. B\u00a099(1), 218\u2013228 (2009)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Lyaudet, L., Mazoit, F., Thomass\u00e9, S.: Partitions Versus Sets: A Case of Duality (submitted 2009), http:\/\/www.lirmm.fr\/~thomasse\/liste\/dualite.pdf","DOI":"10.1016\/j.ejc.2009.09.004"},{"key":"20_CR19","unstructured":"Mazoit, F.: D\u00e9compositions Algorithmiques des Graphes. PhD thesis, \u00c9cole Normale Sup\u00e9rieure de Lyon (2004) (in French)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/11682462_66","volume-title":"LATIN 2006: Theoretical Informatics","author":"F. Mazoit","year":"2006","unstructured":"Mazoit, F.: The Branch-width of Circular-Arc Graphs. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 727\u2013736. Springer, Heidelberg (2006)"},{"key":"20_CR21","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 Decompositions. J. Comb. Theory, Ser. B\u00a052, 153\u2013190 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"P.D. Seymour","year":"1993","unstructured":"Seymour, P.D., Thomas, R.: Graph Searching and a Min-Max Theorem for Tree-Width. J. Comb. Theory, Ser. B\u00a058(1), 22\u201333 (1993)","journal-title":"J. Comb. Theory, Ser. B"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:33:50Z","timestamp":1558478030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}