| dc.contributor.author | Sharmin, Sadia | eng |
| dc.date.accessioned | 2014-09-03T13:12:41Z | |
| dc.date.available | 2014-09-03T13:12:41Z | |
| dc.date.issued | 2014-08-18 | eng |
| dc.identifier.isbn | 978-82-308-2853-3 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1956/8406 | |
| dc.language.iso | eng | eng |
| dc.publisher | The University of Bergen | en_US |
| dc.relation.haspart | Paper I: Telle, Jan Arne; Vatshelle, Martin; Hvidevold, Eivind; Sharmin, Sadia. Finding good decompositions for dynamic programming on dense graphs. Lecture Notes in Computer Science 2012 ;Volum 7112. s. 219-231. Full text not available in BORA due to publisher restrictions. The article is available at: <a href="http://dx.doi.org/10.1007/978-3-642-28050-4_18" target="blank">http://dx.doi.org/10.1007/978-3-642-28050-4_18</a> | en_US |
| dc.relation.haspart | Paper II: Manne, Fredrik; Sharmin, Sadia. Efficient counting of maximal independent sets in sparse graphs. Lecture Notes in Computer Science 2013 ;Volum 7933. s. 103-114. Full text not available in BORA due to publisher restrictions. The article is available at: <a href="http://dx.doi.org/10.1007/978-3-642-38527-8_11" target="blank">http://dx.doi.org/10.1007/978-3-642-38527-8_11</a>. | en_US |
| dc.title | Practical Aspects of the Graph Parameter Boolean-width | en_US |
| dc.type | Doctoral thesis | |
| dc.rights.holder | Copyright the author. All rights reserved | en_US |
