Martin Vatshelle

Førsteamanuensis

INF101 - Objektorientert programmering
INF102 - Aloritmer og datastrukturer

Masterprosjekt:

Master i Algoritmer: Improving Java Standard Library PriorityQueue
Marie N. Berg, forventet ferdig 2023.

Master i Maskinlæring: Tapered Arithmetic Mean a Better Mean for Periodic Data?
Per H. Mjelde, 2022

Master i Algoritmer: Routing of Offshore Survey Vessels
Ingrid N. Johansen, 2021

Vitenskapelig artikkel

Vis forfatter(e) (2022). Recognition of Linear and Star Variants of Leaf Powers is in P. Lecture Notes in Computer Science (LNCS). 70-83.

Vis forfatter(e) (2017). An algorithm for the maximum weight independent set problem on outerstring graphs. Computational geometry. 19-25.

Vis forfatter(e) (2016). Hardness of computing width parameters based on branch decompositions over the vertex set. Theoretical Computer Science. 120-125.

Vis forfatter(e) (2015). Solving #SAT and MaxSAT by dynamic programming. The journal of artificial intelligence research. 59-82.
Vis forfatter(e) (2015). Hardness of computing width parameters based on branch decompositions over the vertex set. Electronic Notes in Discrete Mathematics. 301-308.

Vis forfatter(e) (2014). Solving MAXSAT and #SAT on structured CNF formulas. Lecture Notes in Computer Science (LNCS). 16-31.
Vis forfatter(e) (2014). Parameter ecology for Feedback Vertex Set. Tsinghua Science and Technology. 387-409.
Vis forfatter(e) (2014). Faster algorithms for vertex partitioning problems parameterized by clique-width. Theoretical Computer Science. 16-24.

Vis forfatter(e) (2013). Upper bounds on boolean-width with applications to exact algorithms. Lecture Notes in Computer Science (LNCS). 308-320.
Vis forfatter(e) (2013). Graph classes with structured neighborhoods and algorithmic applications. Theoretical Computer Science. 54-65.
Vis forfatter(e) (2013). Feedback vertex set on graphs of low cliquewidth. European journal of combinatorics (Print). 666-679.
Vis forfatter(e) (2013). Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theoretical Computer Science. 66-76.

Vis forfatter(e) (2012). k-Gap Interval Graphs. Lecture Notes in Computer Science (LNCS). 350-361.
Vis forfatter(e) (2012). Finding good decompositions for dynamic programming on dense graphs. Lecture Notes in Computer Science (LNCS). 219-231.

Vis forfatter(e) (2011). Graph Classes with Structured Neighbourhoods and Algorithmic Applications. Lecture Notes in Computer Science (LNCS). 47-58.
Vis forfatter(e) (2011). Boolean-width of graphs. Theoretical Computer Science. 5187-5204.

Vis forfatter(e) (2010). Recognizing digraphs of Kelly-width 2. Discrete Applied Mathematics. 741-746.
Vis forfatter(e) (2010). On the boolean-width of a graph: structure and applications. Lecture Notes in Computer Science (LNCS). 159-170.
Vis forfatter(e) (2010). H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Applied Mathematics. 809-819.
Vis forfatter(e) (2010). Faster Algorithms on Branch and Clique Decompositions. Lecture Notes in Computer Science (LNCS). 174-185.

Vis forfatter(e) (2009). Feedback Vertex Set on Graphs of low Cliquewidth. Lecture Notes in Computer Science (LNCS). 113-124.
Vis forfatter(e) (2009). Boolean-width of graphs. Lecture Notes in Computer Science (LNCS). 61-74.

Vis forfatter(e) (2007). Characterization and recognition of graphs of bounded Kelly-width. Lecture Notes in Computer Science (LNCS). 270-279.

Doktorgradsavhandling

Vitenskapelig Kapittel/Artikkel/Konferanseartikkel

Vis forfatter(e) (2012). The point-set embeddability problem for plane graphs. 10 sider.

Kompetansefelt