| 2000 |
|---|
| 8 | EE | Arvind Gupta,
Damon Kaller,
Thomas C. Shermer:
Linear-Time Algorithms for Partial k-Tree Complements.
Algorithmica 27(3): 254-274 (2000) |
| 7 | EE | Damon Kaller:
Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees.
Algorithmica 27(3): 348-381 (2000) |
| 1999 |
|---|
| 6 | EE | Arvind Gupta,
Damon Kaller,
Thomas C. Shermer:
On the Complements of Partial k-Trees.
ICALP 1999: 382-391 |
| 1997 |
|---|
| 5 | | 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): 336-358 (1997) |
| 1996 |
|---|
| 4 | | Arvind Gupta,
Damon Kaller,
Sanjeev Mahajan,
Thomas C. Shermer:
Vertex Partitioning Problems On Partial k-Trees.
SWAT 1996: 161-172 |
| 3 | | Damon Kaller:
Definability Equals Recognizability of Partial 3-Trees.
WG 1996: 239-253 |
| 1995 |
|---|
| 2 | | Damon Kaller,
Arvind Gupta,
Thomas C. Shermer:
The Chi-t-Coloring Problem.
STACS 1995: 409-420 |
| 1 | | Damon Kaller,
Arvind Gupta,
Thomas C. Shermer:
Regular-Factors In The Complements Of Partial k-Trees.
WADS 1995: 403-414 |
