Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
Approximating the Bandwidth for Asteroidal Triple-Free GraphsKloks, Ton ; Kratsch, Dieter ; Müller, HaikoJournal of algorithms, 1999-07, Vol.32 (1), p.41-57 [Periódico revisado por pares]San Diego, CA: Elsevier IncTexto completo disponível |
|
2 |
Material Type: Artigo
|
INDEPENDENT sets in asteroidal triple-free graphsBROERSMA, H ; KLOKS, T ; KRATSCH, D ; MÜLLER, HSIAM journal on discrete mathematics, 1999, Vol.12 (2), p.276-287 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
|
3 |
Material Type: Ata de Congresso
|
Asteroidal sets in graphsKloks, Ton ; Kratsch, Dieter ; Müller, HaikoGraph-Theoretic Concepts in Computer Science, 2005, p.229-241 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
4 |
Material Type: Artigo
|
Bandwidth of chain graphsKloks, Ton ; Kratsch, Dieter ; Müller, HaikoInformation processing letters, 1998-12, Vol.68 (6), p.313-315 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
5 |
Material Type: Artigo
|
Total domination and transformationKratsch, Dieter ; Stewart, LornaInformation processing letters, 1997-08, Vol.63 (3), p.167-170 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
6 |
Material Type: Ata de Congresso
|
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex RankingBroersma, Hajo ; Kloks, Ton ; Kratsch, Dieter ; Müller, HaikoGraph-Theoretic Concepts in Computer Science, 1998, p.88-99 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
7 |
Material Type: Ata de Congresso
|
Independent sets in asteroidal triple-free graphsBroersma, Hajo ; Kloks, Ton ; Kratsch, Dieter ; Müller, HaikoAutomata, Languages and Programming, 1997, p.760-770 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
8 |
Material Type: Capítulo de Livro
|
Approximating Bandwidth by Mixing Layouts of Interval GraphsKratsch, Dieter ; Stewart, LornaLecture notes in computer science, 1999, p.248-258 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
9 |
Material Type: Artigo
|
An approximation algorithm for clustering graphs with dominating diametral pathDeogun, Jitender S. ; Kratsch, Dieter ; Steiner, GeorgeInformation processing letters, 1997-02, Vol.61 (3), p.121-127 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
10 |
Material Type: Ata de Congresso
|
On Claw-Free Asteroidal Triple-Free GraphsHempel, Harald ; Kratsch, DieterGraph-Theoretic Concepts in Computer Science, 1999, p.377-390 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |