Martin Vatshelle
Martin Vatshelle
University of Bergen
Geverifieerd e-mailadres voor octio.com
Titel
Geciteerd door
Geciteerd door
Jaar
Independent Set in P5-Free Graphs in Polynomial Time
D Lokshantov, M Vatshelle, Y Villanger
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
1052014
Boolean-width of graphs
BM Bui-Xuan, JA Telle, M Vatshelle
Theoretical Computer Science 412 (39), 5187-5204, 2011
1042011
New width parameters of graphs
M Vatshelle
The University of Bergen, 2012
872012
Graph classes with structured neighborhoods and algorithmic applications
R Belmonte, M Vatshelle
Theoretical Computer Science 511, 54-65, 2013
712013
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
BM Bui-Xuan, JA Telle, M Vatshelle
Theoretical Computer Science 511, 66-76, 2013
61*2013
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
BM Bui-Xuan, JA Telle, M Vatshelle
Discrete Applied Mathematics 158 (7), 809-819, 2010
42*2010
Solving MaxSAT and# SAT on structured CNF formulas
SH Sæther, JA Telle, M Vatshelle
International Conference on Theory and Applications of Satisfiability …, 2014
33*2014
A Polynomial time Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs
JM Keil, JSB Mitchell, D Pradhan, M Vatshelle
CCCG 2015, 2-7, 2015
32*2015
Feedback vertex set on graphs of low cliquewidth
BM Bui-Xuan, O Suchý, JA Telle, M Vatshelle
European Journal of Combinatorics 34 (3), 666-679, 2013
27*2013
On the boolean-width of a graph: Structure and applications
I Adler, BM Bui-Xuan, Y Rabinovich, G Renault, JA Telle, M Vatshelle
International Workshop on Graph-Theoretic Concepts in Computer Science, 159-170, 2010
262010
Parameter ecology for feedback vertex set
BMP Jansen, V Raman, M Vatshelle
Tsinghua Science and Technology 19 (4), 387-409, 2014
252014
Faster algorithms on branch and clique decompositions
HL Bodlaender, EJ Van Leeuwen, JMM Van Rooij, M Vatshelle
International Symposium on Mathematical Foundations of Computer Science, 174-185, 2010
252010
Hardness of computing width parameters based on branch decompositions over the vertex set
SH Sæther, M Vatshelle
Theoretical Computer Science 615, 120-125, 2016
212016
Constructions of k-critical P5-free graphs
CT Hoàng, B Moore, D Recoskie, J Sawada, M Vatshelle
Discrete Applied Mathematics 182, 91-98, 2015
212015
Faster algorithms for vertex partitioning problems parameterized by clique-width
S Oum, SH Sæther, M Vatshelle
Theoretical Computer Science 535, 16-24, 2014
192014
The point-set embeddability problem for plane graphs
T Biedl, M Vatshelle
Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012
172012
Finding good decompositions for dynamic programming on dense graphs
EM Hvidevold, S Sharmin, JA Telle, M Vatshelle
International Symposium on Parameterized and Exact Computation, 219-231, 2011
152011
Recognizing digraphs of Kelly-width 2
D Meister, JA Telle, M Vatshelle
Discrete Applied Mathematics 158 (7), 741-746, 2010
152010
Upper bounds on boolean-width with applications to exact algorithms
Y Rabinovich, JA Telle, M Vatshelle
International Symposium on Parameterized and Exact Computation, 308-320, 2013
122013
Cops-and-robbers: remarks and problems
M Boyer, S El Harti, A El Ouarari, R Ganian, T Gavenciak, G Hahn, ...
Journal of Combinatorial Mathematics and Combinatorial Computing 85, 141-159, 2013
122013
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20