{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:39Z","timestamp":1725559479323},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_20","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:38:24Z","timestamp":1279042704000},"page":"216-227","source":"Crossref","is-referenced-by-count":7,"title":["New Upper Bound Heuristics for Treewidth"],"prefix":"10.1007","author":[{"given":"Emgad H.","family":"Bachoore","sequence":"first","affiliation":[]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, UAI 2001, Seattle, Washington, USA, pp. 7\u201315 (2001)","key":"20_CR1"},{"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 Journal on Algebraic and Discrete Methods\u00a08, 277\u2013284 (1987)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30577-4_1","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L.: Discovering treewidth. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"20_CR4","first-page":"32","volume-title":"Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence","author":"H.L. Bodlaender","year":"2001","unstructured":"Bodlaender, H.L., Koster, A.M.C.A., van den Eijkhof, F., van der Graag, L.C.: Preprocessing for triangulation of probabilistic networks. In: Breese, J., Koller, D. (eds.) Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pp. 32\u201339. Morgan Kaufmann Publishers, San Francisco (2001)"},{"key":"20_CR5","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. Theoretical Computer Science\u00a0209, 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"20_CR6","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica\u00a011(1-2), 1\u201321 (1993)","journal-title":"Acta Cybernetica"},{"key":"20_CR7","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., Negre, 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)"},{"key":"20_CR8","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Columbic","year":"1980","unstructured":"Columbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, Inc., London (1980)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W. Cook","year":"2003","unstructured":"Cook, W., Seymour, P.D.: Tour Merging via branch-decomposition. Informs J. on Computing\u00a015, 233\u2013248 (2003)","journal-title":"Informs J. on Computing"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0166-218X(92)90208-R","volume":"36","author":"A. Kornai","year":"1992","unstructured":"Kornai, A., Tuza, Z.: Narrowness, pathwidth, and their application in natural language processing. Discrete Application Mathematics\u00a036, 87\u201392 (1992)","journal-title":"Discrete Application Mathematics"},{"key":"20_CR11","volume-title":"Electronic Notes in Discrete Mathematics","author":"A.M.C.A. Koster","year":"2001","unstructured":"Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.: Treewidth: Computational experiments. In: Broersma, H., Faigle, U., Hurink, J., Pickl, S. (eds.) Electronic Notes in Discrete Mathematics, vol.\u00a08. Elsevier Science Publishers, Amsterdam (2001)"},{"unstructured":"Koster, A.M.C.A., van Hoesel, C.P.M., Kolen, A.W.J.: Solving frequency assignment problems via tree-decomposition. Technical report RM 99\/011, Maastricht University (1999), Available at \n                    \n                      http:\/\/www.zib.de\/koster\/","key":"20_CR12"},{"issue":"94-95","key":"20_CR13","first-page":"101","volume":"30","author":"A.M.C.A. Koster","year":"2000","unstructured":"Koster, A.M.C.A., van Hoesel, C.P.M., Kolen, A.W.J.: Lower bounds for minimum interference frequency assignment problems. Ricerca Operativa\u00a030(94-95), 101\u2013116 (2000)","journal-title":"Ricerca Operativa"},{"unstructured":"Koster, A.M.C.A.: Frequency Assignment? Models and Algorithms. PhD thesis, Maastricht University, Maastricht, the Netherlands (1999)","key":"20_CR14"},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S.J. Lauritzen","year":"1988","unstructured":"Lauritzen, S.J., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. The Journal of the Royal Statistical Society, Series B (Methodological)\u00a050, 157\u2013224 (1988)","journal-title":"The Journal of the Royal Statistical Society, Series B (Methodological)"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing\u00a05, 266\u2013283 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR17","first-page":"185","volume-title":"Proceeding National conference on Artificial Intelligence (AAAI 1997)","author":"K. Shoikhet","year":"1997","unstructured":"Shoikhet, K., Geiger, D.: A practical algorithm for finding optimal triangulations. In: Proceeding National conference on Artificial Intelligence (AAAI 1997), pp. 185\u2013190. Morgan Kaufmann, San Francisco (1997)"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:59:57Z","timestamp":1558281597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11427186_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}