The following pages link to D. Kaller (Q1578409):
Displaying 8 items.
- Linear-time algorithms for partial \(k\)-tree complements (Q1578411) (← links)
- Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees (Q1578419) (← links)
- (Q4263472) (← links)
- AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs (Q4373007) (← links)
- Vertex partitioning problems on partial k-trees (Q4375643) (← links)
- The χt-coloring problem (Q4596640) (← links)
- Regular-factors in the complements of partial k-trees (Q5057452) (← links)
- Definability equals recognizability of partial 3-trees (Q6550548) (← links)
