Damon Kaller

According to our database, Damon Kaller authored at least 10 papers between 1995 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2000

Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees.

Damon Kaller

Algorithmica, 2000

Linear-Time Algorithms for Partial <i>k</i>-Tree Complements.

Arvind Gupta, Damon Kaller, Thomas C. Shermer

Algorithmica, 2000

1999

On the Complements of Partial k-Trees.

Arvind Gupta, Damon Kaller, Thomas C. Shermer

Proceedings of the Automata, 1999

1998

Reference set thinning for the k-nearest neighbor decision rule.

Binay K. Bhattacharya, Damon Kaller

Proceedings of the Fourteenth International Conference on Pattern Recognition, 1998

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

The generalized matching problem on partial $k$-trees.

Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

Definability Equals Recognizability of Partial 3-Trees.

Damon Kaller

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Vertex Partitioning Problems On Partial k-Trees.

Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer

Proceedings of the Algorithm Theory, 1996

1995

Regular-Factors In The Complements Of Partial k-Trees.

Damon Kaller, Arvind Gupta, Thomas C. Shermer

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

The Chi-t-Coloring Problem.

Damon Kaller, Arvind Gupta, Thomas C. Shermer

Proceedings of the STACS 95, 1995