Academic article

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

Doctoral thesis (PhD)

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

Academic book chapter

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

Conference abstract

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

Professional article

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

See a complete overview of publications in NVA.