Damon Kaller

Most-cited papers

1. An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs

   B. Bhattacharya, Damon Kaller

   1997J. Algorithms22 citations

   Semantic Scholar

   Save

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

   B. Bhattacharya, Damon Kaller

   1998Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170)17 citations

   Semantic Scholar

   Save

3. Definability Equals Recognizability of Partial 3-Trees

   Damon Kaller

   1996International Workshop on Graph-Theoretic Concepts in Computer Science14 citations

   Semantic Scholar

   Save

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

   Damon Kaller

   2000Algorithmica12 citations

   Semantic Scholar

   Save

5. The Chi-t-Coloring Problem

   Damon Kaller, Arvind Gupta, T. Shermer

   1995Symposium on Theoretical Aspects of Computer Science7 citations

   Semantic Scholar

   Save

6. Direct evidence for the participation of pyruvate in N‐hydroxylation of lysine

   Edward W. Szczepan, Damon Kaller, J. Honek, T. Viswanatha

   1987FEBS Letters6 citations Open access

   Semantic Scholar

   Save

7. On the Complements of Partial k-Trees

   Arvind Gupta, Damon Kaller, T. Shermer

   1999International Colloquium on Automata, Languages and Programming4 citations

   Semantic Scholar

   Save

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

   Damon Kaller, Arvind Gupta, T. Shermer

   1995Workshop on Algorithms and Data Structures4 citations

   Semantic Scholar

   Save

9. Monadic second-order logic and linear-time algorithms for graphs of bounded treewidth

   Arvind Gupta, T. Shermer, Damon Kaller

   19963 citations

   Semantic Scholar

   Save

10. Vertex Partitioning Problems On Partial k-Trees

    Arvind Gupta, Damon Kaller, Sanjeev Mahajan, T. Shermer

    1996Scandinavian Workshop on Algorithm Theory3 citations

    Semantic Scholar

    Save

11. Linear-Time Algorithms for Partial \boldmathk -Tree Complements

    Arvind Gupta, Damon Kaller, T. Shermer

    2000Algorithmica2 citations

    Semantic Scholar

    Save

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

    Arvind Gupta, Damon Kaller, Sanjeev Mahajan, T. Shermer

    1997Contemporary Trends in Discrete Mathematics0 citations

    Semantic Scholar

    Save

13. Output sensitive algorithms to compute higher-order Voroni diagrams in Euclidean D-space

    Damon Kaller

    19920 citations

    Semantic Scholar

    Save