{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:32:10Z","timestamp":1767652330952},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319597751"},{"type":"electronic","value":"9783319597768"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59776-8_30","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T13:26:33Z","timestamp":1496150793000},"page":"376-386","source":"Crossref","is-referenced-by-count":22,"title":["htd \u2013 A Free, Open-Source Framework for\u00a0(Customized) Tree Decompositions and\u00a0Beyond"],"prefix":"10.1007","author":[{"given":"Michael","family":"Abseher","sequence":"first","affiliation":[]},{"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"30_CR1","unstructured":"Abseher, M.: htd 1.0.0-beta1 (2016). http:\/\/github.com\/mabseher\/htd\/tree\/v1.0.0-beta1"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-319-11558-0_39","volume-title":"Logics in Artificial Intelligence","author":"M Abseher","year":"2014","unstructured":"Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Hecher, M., Woltran, S.: The D-FLAT system for dynamic programming on tree decompositions. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 558\u2013572. Springer, Cham (2014). doi: 10.1007\/978-3-319-11558-0_39"},{"key":"30_CR3","unstructured":"Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Hecher, M., Woltran, S.: D-FLAT: progress report. Technical report, DBAI-TR-2014-86, TU Wien (2014). http:\/\/www.dbai.tuwien.ac.at\/research\/report\/dbai-tr-2014-86.pdf"},{"key":"30_CR4","unstructured":"Abseher, M., Dusberger, F., Musliu, N., Woltran, S.: Improving the efficiency of dynamic programming on tree decompositions via machine learning. In: Proceedings of IJCAI, pp. 275\u2013282. AAAI Press (2015)"},{"key":"30_CR5","unstructured":"Abseher, M., Musliu, N., Woltran, S.: htd - A free, open-source framework for tree decompositions and beyond. Technical report, DBAI-TR-2016-96, TU Wien (2016). http:\/\/www.dbai.tuwien.ac.at\/research\/report\/dbai-tr-2016-96.pdf"},{"key":"30_CR6","unstructured":"Abseher, M., Musliu, N., Woltran, S.: Improving the efficiency of dynamic programming on tree decompositions via machine learning. Technical report, DBAI-TR-2016-94, TU Wien (2016). http:\/\/www.dbai.tuwien.ac.at\/research\/report\/dbai-tr-2016-94.pdf"},{"issue":"2","key":"30_CR7","doi-asserted-by":"crossref","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. J. Algebraic Discrete Methods 8(2), 277\u2013284 (1987)","journal-title":"J. Algebraic Discrete Methods"},{"issue":"1","key":"30_CR8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial $$k$$ -trees. Discrete Appl. Math. 23(1), 11\u201324 (1989)","journal-title":"Discrete Appl. Math."},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/11775096_24","volume-title":"Algorithmic Aspects in Information and Management","author":"EH Bachoore","year":"2006","unstructured":"Bachoore, E.H., Bodlaender, H.L.: A branch and bound algorithm for exact, upper, and lower bounds on treewidth. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 255\u2013266. Springer, Heidelberg (2006). doi: 10.1007\/11775096_24"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-39890-5_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A Berry","year":"2003","unstructured":"Berry, A., Heggernes, P., Simonet, G.: The minimum degree heuristic and the minimal triangulation process. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 58\u201370. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-39890-5_6"},{"issue":"2","key":"30_CR11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0097-3165(73)90016-2","volume":"14","author":"U Bertel\u00e8","year":"1973","unstructured":"Bertel\u00e8, U., Brioschi, F.: On non-serial dynamic programming. J. Comb. Theor. Ser. A 14(2), 137\u2013148 (1973)","journal-title":"J. Comb. Theor. Ser. A"},{"issue":"3","key":"30_CR12","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"HL Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255\u2013269 (2008)","journal-title":"Comput. J."},{"issue":"3","key":"30_CR13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.ic.2009.03.008","volume":"208","author":"HL Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper bounds. Inf. Comput. 208(3), 259\u2013275 (2010)","journal-title":"Inf. Comput."},{"key":"30_CR14","unstructured":"Charwat, G., Woltran, S.: Dynamic programming-based QBF solving. In: Proceedings of the 4th International Workshop on Quantified Boolean Formulas, vol. 1719, pp. 27\u201340. CEUR Workshop Proceedings (2016)"},{"key":"30_CR15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1051\/ro:2004011","volume":"38","author":"F Clautiaux","year":"2004","unstructured":"Clautiaux, F., Moukrim, A., N\u00e9gre, S., Carlier, J.: Heuristic and meta-heuristic methods for computing graph treewidth. RAIRO Oper. Res. 38, 13\u201326 (2004)","journal-title":"RAIRO Oper. Res."},{"key":"30_CR16","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, USA (2003)"},{"issue":"2","key":"30_CR17","doi-asserted-by":"crossref","first-page":"277","DOI":"10.7155\/jgaa.00109","volume":"9","author":"Y Dourisboure","year":"2005","unstructured":"Dourisboure, Y.: Compact routing schemes for generalised chordal graphs. J. Graph Algorithms Appl. 9(2), 277\u2013297 (2005)","journal-title":"J. Graph Algorithms Appl."},{"key":"30_CR18","series-title":"Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"30_CR19","unstructured":"Ganzow, T., Gottlob, G., Musliu, N., Samer, M.: A CSP hypergraph library. Technical report, DBAI-TR-2005-50, TU Wien (2005). http:\/\/www.dbai.tuwien.ac.at\/proj\/hypertree\/csphgl.pdf"},{"key":"30_CR20","unstructured":"Gaspers, S., Gudmundsson, J., Jones, M., Mestre, J., R\u00fcmmele, S.: Turbocharging treewidth heuristics. In: Proceedings of IPEC (2016, to appear)"},{"key":"30_CR21","unstructured":"Gogate, V., Dechter, R.: A complete anytime algorithm for treewidth. In: Proceedings of UAI, pp. 201\u2013208. AUAI Press (2004)"},{"issue":"3","key":"30_CR22","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1006\/jcss.2001.1809","volume":"64","author":"G Gottlob","year":"2002","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64(3), 579\u2013627 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR23","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01917434","volume":"8","author":"R Halin","year":"1976","unstructured":"Halin, R.: S-functions for graphs. J. Geom. 8, 171\u2013186 (1976)","journal-title":"J. Geom."},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Hamann, M., Strasser, B.: Graph bisection with pareto-optimization. In: Proceedings of ALENEX, pp. 90\u2013102. SIAM (2016)","DOI":"10.1137\/1.9781611974317.8"},{"key":"30_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-12139-5_9","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"T Hammerl","year":"2010","unstructured":"Hammerl, T., Musliu, N.: Ant colony optimization for tree decompositions. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 95\u2013106. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-12139-5_9"},{"key":"30_CR26","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1007\/978-3-662-43505-2_64","volume-title":"Springer Handbook of Computational Intelligence","author":"T Hammerl","year":"2015","unstructured":"Hammerl, T., Musliu, N., Schafhauser, W.: Metaheuristic algorithms and tree decomposition. In: Kacprzyk, J., Pedrycz, W. (eds.) Springer Handbook of Computational Intelligence, pp. 1255\u20131270. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-43505-2_64"},{"key":"30_CR27","unstructured":"J\u00e9gou, P., Terrioux, C.: Bag-connected tree-width: a new parameter for graph decomposition. In: Proceedings of ISAIM, pp. 12\u201328 (2014)"},{"issue":"1","key":"30_CR28","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01890544","volume":"2","author":"U Kjaerulff","year":"1992","unstructured":"Kjaerulff, U.: Optimal decomposition of probabilistic networks by simulated annealing. Stat. Comput. 2(1), 2\u201317 (1992)","journal-title":"Stat. Comput."},{"key":"30_CR29","series-title":"LNCS","volume-title":"Treewidth, Computations and Approximations","author":"T Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth, Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)"},{"key":"30_CR30","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/S1571-0653(05)80034-4","volume":"3","author":"AMCA Koster","year":"1999","unstructured":"Koster, A.M.C.A., van Hoesel, S.P.M., Kolen, A.W.J.: Solving frequency assignment problems via tree-decomposition 1. Electr. Notes Discrete Math. 3, 102\u2013105 (1999)","journal-title":"Electr. Notes Discrete Math."},{"issue":"1","key":"30_CR31","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1023\/A:1018553211613","volume":"7","author":"P Larranaga","year":"1997","unstructured":"Larranaga, P., Kujipers, C.M., Poza, M., Murga, R.H.: Decomposing bayesian networks: triangulation of the moral graph with genetic algorithms. Stat. Comput. 7(1), 19\u201334 (1997)","journal-title":"Stat. Comput."},{"key":"30_CR32","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"SL Lauritzen","year":"1988","unstructured":"Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J. R. Stat. Soc. Ser. B 50, 157\u2013224 (1988)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"30_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-34413-8_10","volume-title":"Learning and Intelligent Optimization","author":"M Morak","year":"2012","unstructured":"Morak, M., Musliu, N., Pichler, R., R\u00fcmmele, S., Woltran, S.: Evaluating tree-decomposition based algorithms for answer set programming. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, pp. 130\u2013144. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-34413-8_10"},{"key":"30_CR34","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-3-540-70807-0_9","volume-title":"Recent Advances in Evolutionary Computation for Combinatorial Optimization","author":"N Musliu","year":"2008","unstructured":"Musliu, N.: An iterative heuristic algorithm for tree decomposition. In: Cotta, C., van Hemert, J. (eds.) Recent Advances in Evolutionary Computation for Combinatorial Optimization. Studies in Computational Intelligence, vol. 153, pp. 133\u2013150. Springer, Heidelberg (2008)"},{"issue":"3","key":"30_CR35","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1504\/EJIE.2007.014690","volume":"1","author":"N Musliu","year":"2007","unstructured":"Musliu, N., Schafhauser, W.: Genetic algorithms for generalized hypertree decompositions. Eur. J. Ind. Eng. 1(3), 317\u2013340 (2007)","journal-title":"Eur. J. Ind. Eng."},{"key":"30_CR36","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)"},{"issue":"1","key":"30_CR37","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.: Graph minors. III. Planar tree-width. J. Comb. Theor. Ser. B 36(1), 49\u201364 (1984)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"2","key":"30_CR38","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theor. Ser. B 52(2), 153\u2013190 (1991)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"30_CR39","unstructured":"Shoikhet, K., Geiger, D.: A practical algorithm for finding optimal triangulations. In: Proceedings of AAAI\/IAAI, pp. 185\u2013190. AAAI Press\/The MIT Press (1997)"},{"key":"30_CR40","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithm to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13, 566\u2013579 (1984)","journal-title":"SIAM J. Comput."},{"key":"30_CR41","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.dam.2016.09.023","volume":"217","author":"R Wersch van","year":"2017","unstructured":"van Wersch, R., Kelk, S.: Toto: an open database for computation, storage and retrieval of tree decompositions. Discrete Appl. Math. 217, 389\u2013393 (2017)","journal-title":"Discrete Appl. Math."},{"key":"30_CR42","doi-asserted-by":"crossref","unstructured":"Xu, J., Jiao, F., Berger, B.: A tree-decomposition approach to protein structure prediction. In: Proceedings of CSB, pp. 247\u2013256 (2005)","DOI":"10.1109\/CSB.2005.9"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T12:23:54Z","timestamp":1719231834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}