Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
Space-Efficient Biconnected Components and Recognition of Outerplanar GraphsKammer, Frank ; Kratsch, Dieter ; Laudahn, MoritzAlgorithmica, 2019-03, Vol.81 (3), p.1180-1204 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
2 |
Material Type: Artigo
|
Finding Shortest Paths Between Graph ColouringsJohnson, Matthew ; Kratsch, Dieter ; Kratsch, Stefan ; Patel, Viresh ; Paulusma, DaniëlAlgorithmica, 2016-06, Vol.75 (2), p.295-321 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
3 |
Material Type: Livro
|
Graph-Theoretic Concepts in Computer Science: 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected PapersKratsch, DieterBerlin, Heidelberg: Springer Berlin / Heidelberg 2005Sem texto completo |
|
4 |
Material Type: Livro
|
Graph-theoretic concepts in computer science: 31st International Workshop,WG 2005, Metz, France, June 23-25 2005, revised selected papersKratsch, DieterSpringer 2014Sem texto completo |
|
5 |
Material Type: Artigo
|
An exact algorithm for the minimum dominating clique problemKratsch, Dieter ; Liedloff, MathieuTheoretical computer science, 2007-10, Vol.385 (1), p.226-240 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
6 |
Material Type: Artigo
|
An exact algorithm for the Maximum Leaf Spanning Tree problemFernau, Henning ; Kneis, Joachim ; Kratsch, Dieter ; Langer, Alexander ; Liedloff, Mathieu ; Raible, Daniel ; Rossmanith, PeterTheoretical computer science, 2011-10, Vol.412 (45), p.6290-6302 [Periódico revisado por pares]Oxford: Elsevier B.VTexto completo disponível |
|
7 |
Material Type: Artigo
|
Exact algorithms for KaylesBodlaender, Hans L. ; Kratsch, Dieter ; Timmer, Sjoerd T.Theoretical computer science, 2015, Vol.562, p.165-176 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
8 |
Material Type: Artigo
|
Iterative compression and exact algorithmsFomin, Fedor V. ; Gaspers, Serge ; Kratsch, Dieter ; Liedloff, Mathieu ; Saurabh, SaketTheoretical computer science, 2010-02, Vol.411 (7), p.1045-1053 [Periódico revisado por pares]Oxford: Elsevier B.VTexto completo disponível |
|
9 |
Material Type: Artigo
|
On exact algorithms for treewidthBodlaender, Hans ; Fomin, Fedor ; Koster, Arie ; Kratsch, Dieter ; Thilikos, Dimitrios MACM transactions on algorithms, 2012-12, Vol.9 (1), p.1-23 [Periódico revisado por pares]ACMTexto completo disponível |
|
10 |
Material Type: Artigo
|
Bicolored independent sets and bicliquesCouturier, Jean-François ; Kratsch, DieterInformation processing letters, 2012-04, Vol.112 (8-9), p.329-334 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |