Article in business/trade/industry journal

• Arrighi, Emmanuel Jean Paul Pierre; Drange, Pål Grønås; Langedal, Kenneth et al. (2023). PACE Solver Description: Zygosity. (external link)

Academic article

• Bergougnoux, Benjamin; Høgemo, Svein; Telle, Jan Arne et al. (2022). Recognition of Linear and Star Variants of Leaf Powers is in P. (external link)
• Keil, J. Mark; Mitchell, Joseph S.B.; Pradhan, Dinabandhu et al. (2017). An algorithm for the maximum weight independent set problem on outerstring graphs. (external link)
• Sæther, Sigve Hortemo; Vatshelle, Martin (2016). Hardness of computing width parameters based on branch decompositions over the vertex set. (external link)
• Sæther, Sigve Hortemo; Telle, Jan Arne; Vatshelle, Martin (2015). Solving #SAT and MaxSAT by dynamic programming. (external link)
• Sæther, Sigve Hortemo; Vatshelle, Martin (2015). Hardness of computing width parameters based on branch decompositions over the vertex set. (external link)
• Oum, Sang-il; Sæther, Sigve Hortemo; Vatshelle, Martin (2014). Faster algorithms for vertex partitioning problems parameterized by clique-width. (external link)
• Jansen, Bart Maarten Paul; Raman, Venkatesh; Vatshelle, Martin (2014). Parameter ecology for Feedback Vertex Set. (external link)
• Telle, Jan Arne; Vatshelle, Martin; Sæther, Sigve Hortemo (2014). Solving MAXSAT and #SAT on structured CNF formulas. (external link)
• Rabinovich, Yuri; Telle, Jan Arne; Vatshelle, Martin (2013). Upper bounds on boolean-width with applications to exact algorithms. (external link)
• Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin (2013). Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. (external link)
• Telle, Jan Arne; Suchy, Ondra; Bui-Xuan, Binh-Minh et al. (2013). Feedback vertex set on graphs of low cliquewidth. (external link)
• Vatshelle, Martin; Belmonte, Rémy (2013). Graph classes with structured neighborhoods and algorithmic applications. (external link)
• Telle, Jan Arne; Vatshelle, Martin; Hvidevold, Eivind et al. (2012). Finding good decompositions for dynamic programming on dense graphs. (external link)
• Fomin, Fedor; Gaspers, Serge; Golovach, Petr et al. (2012). k-Gap Interval Graphs. (external link)
• Belmonte, Rémy; Vatshelle, Martin (2011). Graph Classes with Structured Neighbourhoods and Algorithmic Applications. (external link)
• Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin (2011). Boolean-width of graphs. (external link)
• Bodlaender, Hans L.; Van Leeuwen, Erik Jan; van Rooij, Johan M. M. et al. (2010). Faster Algorithms on Branch and Clique Decompositions. (external link)
• Adler, Isolde Marianne; Bui-Xuan, Binh-Minh; Telle, Jan Arne et al. (2010). On the boolean-width of a graph: structure and applications. (external link)
• Meister, Daniel; Telle, Jan Arne; Vatshelle, Martin (2010). Recognizing digraphs of Kelly-width 2. (external link)
• Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin (2010). H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. (external link)
• Telle, Jan Arne; Bui-Xuan, Binh-Minh; Vatshelle, Martin (2009). Feedback Vertex Set on Graphs of low Cliquewidth. (external link)
• Bui-Xuan, Binh-Minh; Telle, Jan Arne; Vatshelle, Martin (2009). Boolean-width of graphs. (external link)
• Telle, Jan Arne; Meister, Daniel; Vatshelle, Martin (2007). Characterization and recognition of graphs of bounded Kelly-width. (external link)

Abstract

• Agersborg, Remy; Hille, Lars T.; Lien, Martha et al. (2017). Mapping water influx and hydrocarbon depletion in offshore reservoirs using gravimetry: Requirements on gravimeter calibration. (external link)
• Ruiz, Hugo; Agersborg, Remy; Hille, Lars T. et al. (2016). Monitoring offshore reservoirs using 4D gravity and subsidence with improved tide corrections. (external link)

Doctoral dissertation

• Vatshelle, Martin (2012). New Width Parameters of Graphs. (external link)

Academic chapter/article/Conference paper

• Biedl, Therese; Vatshelle, Martin (2012). The point-set embeddability problem for plane graphs. (external link)

See a complete overview of publications in Cristin.