D. Kaller
From MaRDI portal
Person:1578409
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Definability equals recognizability of partial 3-trees | 2024-06-05 | Paper |
| Regular-factors in the complements of partial k-trees Lecture Notes in Computer Science | 2022-12-16 | Paper |
| The χt-coloring problem STACS 95 | 2017-12-04 | Paper |
| Linear-time algorithms for partial \(k\)-tree complements Algorithmica | 2001-02-13 | Paper |
| Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees Algorithmica | 2000-08-27 | Paper |
| scientific article; zbMATH DE number 1341910 (Why is no real title available?) | 2000-02-23 | Paper |
| AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs Journal of Algorithms | 1998-05-25 | Paper |
| Vertex partitioning problems on partial k-trees Algorithm Theory — SWAT'96 | 1998-05-04 | Paper |
Research outcomes over time
This page was built for person: D. Kaller
