The Chi-t-Coloring Problem. - Damon Kaller; Arvind Gupta; Thomas C. Shermer (STACS, 1995)

Regular-Factors In The Complements Of Partial k-Trees. - Damon Kaller; Arvind Gupta; Thomas C. Shermer (WADS, 1995)

Vertex Partitioning Problems On Partial k-Trees. - Arvind Gupta; Damon Kaller; Sanjeev Mahajan; Thomas C. Shermer (SWAT, 1996)

Definability Equals Recognizability of Partial 3-Trees. - Damon Kaller (WG, 1996)

The generalized matching problem on partial $k$-trees. - Arvind Gupta; Damon Kaller; Sanjeev Mahajan; Thomas C. Shermer (Contemporary Trends in Discrete Mathematics, 1997)

An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs. - Binay K. Bhattacharya; Damon Kaller (J. Algorithms, 1997)

Reference set thinning for the k-nearest neighbor decision rule. - Binay K. Bhattacharya; Damon Kaller (ICPR, 1998)

On the Complements of Partial k-Trees. - Arvind Gupta; Damon Kaller; Thomas C. Shermer (ICALP, 1999)

Linear-Time Algorithms for Partial k-Tree Complements. - Arvind Gupta; Damon Kaller; Thomas C. Shermer (Algorithmica, 2000)

Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees. - Damon Kaller (Algorithmica, 2000)