フォロー
Dieter Kratsch
Dieter Kratsch
professeur d'informatique, Universite de Lorraine
確認したメール アドレス: univ-lorraine.fr
タイトル
引用先
引用先
年
Exact Exponential Algorithms
FV Fomin, D Kratsch
5802010
A measure & conquer approach for the analysis of exact algorithms
FV Fomin, F Grandoni, D Kratsch
Journal of the ACM (JACM) 56 (5), 1-32, 2009
2752009
Rankings of graphs
HL Bodlaender, JS Deogun, K Jansen, T Kloks, D Kratsch, H Müller, ...
SIAM Journal on Discrete Mathematics 11 (1), 168-181, 1998
218*1998
Measure and conquer: a simple O (2^0.288 n) independent set algorithm
FV Fomin, F Grandoni, D Kratsch
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
1892006
Measure and conquer: Domination–a case study
FV Fomin, F Grandoni, D Kratsch
International Colloquium on Automata, Languages, and Programming, 191-203, 2005
1822005
Domination on cocomparability graphs
D Kratsch, L Stewart
SIAM Journal on Discrete Mathematics 6 (3), 400-417, 1993
1721993
Certifying algorithms for recognizing interval graphs and permutation graphs
D Kratsch, RM McConnell, K Mehlhorn, JP Spinrad
SIAM Journal on Computing 36 (2), 326-353, 2006
1552006
Exact (exponential) algorithms for the dominating set problem
FV Fomin, D Kratsch, GJ Woeginger
International Workshop on Graph-Theoretic Concepts in Computer Science, 245-256, 2004
1492004
Treewidth and pathwidth of permutation graphs
HL Bodlaender, T Kloks, D Kratsch
SIAM Journal on Discrete Mathematics 8 (4), 606-616, 1995
1481995
Finding and counting small induced subgraphs efficiently
T Kloks, D Kratsch, H Müller
Information Processing Letters 74 (3-4), 115-121, 2000
1382000
Listing all minimal separators of a graph
T Kloks, D Kratsch
SIAM Journal on Computing 27 (3), 605-613, 1998
136*1998
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
129*2012
Treewidth of chordal bipartite graphs
T Kloks, D Kratsch
Journal of Algorithms 19 (2), 266-281, 1995
123*1995
Solving connected dominating set faster than 2^n
FV Fomin, F Grandoni, D Kratsch
Algorithmica 52 (2), 153-166, 2008
1222008
On domination problems for permutation and other graphs
A Brandstädt, D Kratsch
Theoretical Computer Science 54 (2-3), 181-198, 1987
1091987
Some new techniques in design and analysis of exact (exponential) algorithms
FV Fomin, F Grandoni, D Kratsch
Bull. EATCS 87, 47-77, 2005
1052005
On treewidth and minimum fill-in of asteroidal triple-free graphs
T Kloks, D Kratsch, J Spinrad
Theoretical Computer Science 175 (2), 309-335, 1997
1041997
Linear-time certifying recognition algorithms and forbidden induced subgraphs.
P Heggernes, D Kratsch
Nord. J. Comput. 14 (1-2), 87-108, 2007
103*2007
Independent sets in asteroidal triple-free graphs
H Broersma, T Kloks, D Kratsch, H Müller
SIAM Journal on Discrete Mathematics 12 (2), 276-287, 1999
1011999
Domination in convex and chordal bipartite graphs
P Damaschke, H Müller, D Kratsch
Information Processing Letters 36 (5), 231-236, 1990
1011990
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20