Damon Kaller

Publication Activity (10 Years)

Years Active: 1995-2000
Publications (10 Years): 0

Publications

Arvind Gupta, Damon Kaller, Thomas C. Shermer
-Tree Complements. Algorithmica 27 (3) (2000)
Damon Kaller
Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees. Algorithmica 27 (3) (2000)
Arvind Gupta, Damon Kaller, Thomas C. Shermer
On the Complements of Partial k-Trees. ICALP (1999)
Binay K. Bhattacharya, Damon Kaller
Reference set thinning for the k-nearest neighbor decision rule. ICPR (1998)
Binay K. Bhattacharya, Damon Kaller
An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs. J. Algorithms 25 (2) (1997)
Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
The generalized matching problem on partial $k$-trees. Contemporary Trends in Discrete Mathematics (1997)
Damon Kaller
Definability Equals Recognizability of Partial 3-Trees. WG (1996)
Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer
Vertex Partitioning Problems On Partial k-Trees. SWAT (1996)
Damon Kaller, Arvind Gupta, Thomas C. Shermer
The Chi-t-Coloring Problem. STACS (1995)
Damon Kaller, Arvind Gupta, Thomas C. Shermer
Regular-Factors In The Complements Of Partial k-Trees. WADS (1995)