{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:05:55Z","timestamp":1740096355741,"version":"3.37.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038971"},{"type":"electronic","value":"9783319038988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03898-8_26","type":"book-chapter","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T02:57:26Z","timestamp":1384829846000},"page":"308-320","source":"Crossref","is-referenced-by-count":3,"title":["Upper Bounds on Boolean-Width with Applications to Exact Algorithms"],"prefix":"10.1007","author":[{"given":"Yuri","family":"Rabinovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Vatshelle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Belmonte, R., Vatshelle, M.: Graph classes with structured neighborhoods and algorithmic applications. In: TCS (2013), \n                  \n                    http:\/\/dx.doi.org\/10.1016\/j.tcs.2013.01.011","DOI":"10.1016\/j.tcs.2013.01.011"},{"issue":"39","key":"26_CR2","doi-asserted-by":"publisher","first-page":"5187","DOI":"10.1016\/j.tcs.2011.05.022","volume":"412","author":"B.-M. Bui-Xuan","year":"2011","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Boolean-width of graphs. Theoretical Computer Science\u00a0412(39), 5187\u20135204 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2010.08.004","volume":"32","author":"V. R\u00f6dl","year":"2011","unstructured":"R\u00f6dl, V., Duffus, D., Frankl, P.: Maximal independent sets in bipartite graphs obtained from boolean lattices. Eur. J. Comb.\u00a032(1), 1\u20139 (2011)","journal-title":"Eur. J. Comb."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms, 1st edn. Texts in Theoretical Computer Science (2010)","DOI":"10.1007\/978-3-642-16533-7_1"},{"issue":"4","key":"26_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1002\/jgt.3190110403","volume":"11","author":"Z. F\u00fcredi","year":"1987","unstructured":"F\u00fcredi, Z.: The number of maximal independent sets in connected graphs. Journal of Graph Theory\u00a011(4), 463\u2013470 (1987)","journal-title":"Journal of Graph Theory"},{"issue":"3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1137\/070685920","volume":"38","author":"P. Hlinen\u00fd","year":"2008","unstructured":"Hlinen\u00fd, P., Oum, S.I.: Finding branch-decompositions and rank-decompositions. SIAM J. Comput.\u00a038(3), 1012\u20131032 (2008)","journal-title":"SIAM J. Comput."},{"issue":"301","key":"26_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association\u00a058(301), 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11083-012-9253-5","volume":"30","author":"L. Ilinca","year":"2013","unstructured":"Ilinca, L., Kahn, J.: Counting maximal antichains and independent sets. Order\u00a030(2), 427\u2013435 (2013)","journal-title":"Order"},{"key":"26_CR9","unstructured":"Kim, K.H.: Boolean matrix theory and its applications. Monographs and textbooks in pure and applied mathematics. Marcel Dekker (1982)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"S.P. Vadhan","year":"1997","unstructured":"Vadhan, S.P.: The complexity of counting in sparse, regular, and planar graphs. SIAM Journal on Computing\u00a031, 398\u2013427 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR11","unstructured":"Vatshelle, M.: New Width Parameters of Graphs. PhD thesis, University of Bergen (2012) ISBN:978-82-308-2098-8"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03898-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T06:41:13Z","timestamp":1558680073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03898-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038971","9783319038988"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03898-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}