Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kaller, Damon"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complements of partial
k
-trees
Arvind Gupta
,
Damon Kaller
,
Thomas Shermer
Lecture Notes in Computer Science
1644
, 1999, pp. 382-391
An
O(m+n\log n)
algorithm for the maximum-clique problem in circular-arc graphs
Binay K. Bhattacharya
,
Damon Kaller
Journal of Algorithms
25
(2), 1997, pp. 336-358
Definability equals recognizability of partial 3-trees
Damon Kaller
Lecture Notes in Computer Science
1197
, 1997, pp. 239-253
Vertex partitioning problems on partial
k
-trees
Arvind Gupta
,
Damon Kaller
,
Sanjeev Mahajan
,
Tom Shermer
Lecture Notes in Computer Science
1097
, 1996, pp. 161-172
The
\chi_t
-coloring problem
Damon Kaller
,
Arvind Gupta
,
Tom Shermer
Lecture Notes in Computer Science
900
, 1995, pp. 409-420
Regular-factors in the complements of partial
k
-trees
Damon Kaller
,
Arvind Gupta
,
Tom Shermer
Lecture Notes in Computer Science
955
, 1995, pp. 403-414