受强制性开放获取政策约束的文章 - Dieter Kratsch了解详情
无法在其他位置公开访问的文章：1 篇
The jump number problem: Exact and parameterized
D Kratsch, S Kratsch
International Symposium on Parameterized and Exact Computation, 230-242, 2013
强制性开放获取政策： German Research Foundation
可在其他位置公开访问的文章：28 篇
On exact algorithms for treewidth
HL Bodlaender, FV Fomin, AMCA Koster, D Kratsch, DM Thilikos
ACM Transactions on Algorithms (TALG) 9 (1), 1-23, 2012
强制性开放获取政策： German Research Foundation, Government of Spain
A note on exact algorithms for vertex ordering problems on graphs
HL Bodlaender, FV Fomin, AMCA Koster, D Kratsch, DM Thilikos
Theory of Computing Systems 50 (3), 420-432, 2012
强制性开放获取政策： German Research Foundation, Government of Spain
An exact algorithm for the maximum leaf spanning tree problem
H Fernau, J Kneis, D Kratsch, A Langer, M Liedloff, D Raible, ...
Theoretical Computer Science 412, 6290 - 6302, 2011
强制性开放获取政策： German Research Foundation
Finding shortest paths between graph colourings
M Johnson, D Kratsch, S Kratsch, V Patel, D Paulusma
Algorithmica 75 (2), 295-321, 2016
强制性开放获取政策： German Research Foundation, UK Engineering and Physical Sciences Research …
List coloring in the absence of a linear forest
JF Couturier, PA Golovach, D Kratsch, D Paulusma
Algorithmica 71, 21-35, 2015
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
PA Golovach, P Heggernes, D Kratsch, Y Villanger
Algorithmica 72 (3), 836-859, 2015
强制性开放获取政策： European Commission, Research Council of Norway
Enumerating minimal dominating sets in chordal bipartite graphs
PA Golovach, P Heggernes, MM Kanté, D Kratsch, Y Villanger
Discrete Applied Mathematics 199, 30-36, 2016
强制性开放获取政策： European Commission, Research Council of Norway
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
PA Golovach, P Heggernes, MM Kanté, D Kratsch, SH Sæther, ...
Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya …, 2015
强制性开放获取政策： European Commission
Breaking the 2^n-barrier for Irredundance: Two lines of attack
D Binkele-Raible, L Brankovic, M Cygan, H Fernau, J Kneis, D Kratsch, ...
Journal of Discrete Algorithms 9 (3), 214-230, 2011
强制性开放获取政策： German Research Foundation
Subset feedback vertex sets in chordal graphs
PA Golovach, P Heggernes, D Kratsch, R Saei
Journal of Discrete Algorithms 26, 7-15, 2014
强制性开放获取政策： European Commission
Finding clubs in graph classes
PA Golovach, P Heggernes, D Kratsch, A Rafiey
Discrete Applied Mathematics 174, 57-65, 2014
强制性开放获取政策： European Commission, Research Council of Norway
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
PA Golovach, C Komusiewicz, D Kratsch
Journal of Computer and System Sciences 123, 76-102, 2022
强制性开放获取政策： Research Council of Norway
Enumeration and maximum number of minimal connected vertex covers in graphs
PA Golovach, P Heggernes, D Kratsch
European Journal of Combinatorics 68, 132-147, 2018
强制性开放获取政策： European Commission, Research Council of Norway
Enumerating minimal connected dominating sets in graphs of bounded chordality
PA Golovach, P Heggernes, D Kratsch
Theoretical Computer Science 630, 63-75, 2016
强制性开放获取政策： Research Council of Norway
Minimal dominating sets in interval graphs and trees
PA Golovach, P Heggernes, MM Kanté, D Kratsch, Y Villanger
Discrete Applied Mathematics 216, 162-170, 2017
强制性开放获取政策： European Commission, Research Council of Norway
Parameterized algorithms for finding square roots
M Cochefert, JF Couturier, PA Golovach, D Kratsch, D Paulusma
Algorithmica 74 (2), 602-629, 2016
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, European Commission
Finding cactus roots in polynomial time
PA Golovach, D Kratsch, D Paulusma, A Stewart
International Workshop on Combinatorial Algorithms, 361-372, 2016
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, Research Council of …
Detecting induced minors in AT-free graphs
PA Golovach, D Kratsch, D Paulusma
Theoretical computer science 482, 20-32, 2013
强制性开放获取政策： UK Engineering and Physical Sciences Research Council
A linear kernel for finding square roots of almost planar graphs
PA Golovach, D Kratsch, D Paulusma, A Stewart
Theoretical Computer Science 689, 36-47, 2017
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, Research Council of …
出版信息和资助信息由计算机程序自动确定