Home
University of Bergen
Martin Vatshelle's picture

Martin Vatshelle

Associate Professor
Department of Informatics
Home Page
  • E-mailMartin.Vatshelle@uib.no
  • Phone+47 918 36 584
  • Visitor Address
    Høyteknologisenteret i Bergen, Thormøhlensgate 55, N-5008 Bergen
    Bergen
    Room 
    3151
  • Postal Address
    Postboks 7803
    5020 Bergen
Academic article
  • Show author(s) (2017). An algorithm for the maximum weight independent set problem on outerstring graphs. Computational geometry. 19-25.
  • Show author(s) (2016). Hardness of computing width parameters based on branch decompositions over the vertex set. Theoretical Computer Science. 120-125.
  • Show author(s) (2015). Solving #SAT and MaxSAT by dynamic programming. The journal of artificial intelligence research. 59-82.
  • Show author(s) (2015). Hardness of computing width parameters based on branch decompositions over the vertex set. Electronic Notes in Discrete Mathematics. 301-308.
  • Show author(s) (2014). Solving MAXSAT and #SAT on structured CNF formulas. Lecture Notes in Computer Science (LNCS). 16-31.
  • Show author(s) (2014). Parameter ecology for Feedback Vertex Set. Tsinghua Science and Technology. 387-409.
  • Show author(s) (2014). Faster algorithms for vertex partitioning problems parameterized by clique-width. Theoretical Computer Science. 16-24.
  • Show author(s) (2013). Upper bounds on boolean-width with applications to exact algorithms. Lecture Notes in Computer Science (LNCS). 308-320.
  • Show author(s) (2013). Graph classes with structured neighborhoods and algorithmic applications. Theoretical Computer Science. 54-65.
  • Show author(s) (2013). Feedback vertex set on graphs of low cliquewidth. European journal of combinatorics (Print). 666-679.
  • Show author(s) (2013). Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theoretical Computer Science. 66-76.
  • Show author(s) (2012). k-Gap Interval Graphs. Lecture Notes in Computer Science (LNCS). 350-361.
  • Show author(s) (2012). Finding good decompositions for dynamic programming on dense graphs. Lecture Notes in Computer Science (LNCS). 219-231.
  • Show author(s) (2011). Graph Classes with Structured Neighbourhoods and Algorithmic Applications. Lecture Notes in Computer Science (LNCS). 47-58.
  • Show author(s) (2011). Boolean-width of graphs. Theoretical Computer Science. 5187-5204.
  • Show author(s) (2010). Recognizing digraphs of Kelly-width 2. Discrete Applied Mathematics. 741-746.
  • Show author(s) (2010). On the boolean-width of a graph: structure and applications. Lecture Notes in Computer Science (LNCS). 159-170.
  • Show author(s) (2010). H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Applied Mathematics. 809-819.
  • Show author(s) (2010). Faster Algorithms on Branch and Clique Decompositions. Lecture Notes in Computer Science (LNCS). 174-185.
  • Show author(s) (2009). Feedback Vertex Set on Graphs of low Cliquewidth. Lecture Notes in Computer Science (LNCS). 113-124.
  • Show author(s) (2009). Boolean-width of graphs. Lecture Notes in Computer Science (LNCS). 61-74.
  • Show author(s) (2007). Characterization and recognition of graphs of bounded Kelly-width. Lecture Notes in Computer Science (LNCS). 270-279.
Doctoral dissertation
  • Show author(s) (2012). New Width Parameters of Graphs.
Academic chapter/article/Conference paper
  • Show author(s) (2012). The point-set embeddability problem for plane graphs. 10 pages.

More information in national current research information system (CRIStin)