Martin Vatshelle
Martin Vatshelle
Bestätigte E-Mail-Adresse bei
Zitiert von
Zitiert von
New width parameters of graphs
M Vatshelle
The University of Bergen, 2012
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
Boolean-width of graphs
BM Bui-Xuan, JA Telle, M Vatshelle
Theoretical Computer Science 412 (39), 5187-5204, 2011
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
Graph classes with structured neighborhoods and algorithmic applications
R Belmonte, M Vatshelle
Theoretical Computer Science 511, 54-65, 2013
Solving MaxSAT and #SAT on Structured CNF Formulas
SH Sæther, JA Telle, M Vatshelle
International Conference on Theory and Applications of Satisfiability …, 2014
H-join and algorithms on graphs of bounded rankwidth
BM Bui-Xuan, M Vatshelle, JA Telle
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
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
Parameter ecology for feedback vertex set
BMP Jansen, V Raman, M Vatshelle
Tsinghua Science and Technology 19 (4), 387-409, 2014
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
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
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
The graph parameter hierarchy
M Sorge, M Weller, F Foucaud, O Suchý, P Ochem, M Vatshelle, ...
Unpublished manuscript, 10, 2019
Faster algorithms for vertex partitioning problems parameterized by clique-width
S Oum, SH Sæther, M Vatshelle
Theoretical Computer Science 535, 16-24, 2014
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
The point-set embeddability problem for plane graphs
T Biedl, M Vatshelle
Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012
Monitoring the Ormen Lange field with 4D gravity and seafloor subsidence
M Vatshelle, M Glegola, M Lien, T Noble, H Ruiz
79th EAGE Conference and Exhibition 2017 2017 (1), 1-5, 2017
Finding good decompositions for dynamic programming on dense graphs
EM Hvidevold, S Sharmin, JA Telle, M Vatshelle
Parameterized and Exact Computation: 6th International Symposium, IPEC 2011 …, 2012
Density changes and reservoir compaction from in-situ calibrated 4D gravity and subsidence measured at the seafloor
R Agersborg, LT Hille, M Lien, JE Lindgård, H Ruiz, M Vatshelle
SPE Annual Technical Conference and Exhibition?, D031S044R006, 2017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20