Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report. - Thomas Drakengren; Peter Jonsson (AAAI/IAAI, Vol. 1, 1996)

Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. - Peter Jonsson; Thomas Drakengren; Christer Bäckström (KR, 1996)

Uniqueness of Scott's Reflexive Domain in P-omega. - Thomas Drakengren (Theor. Comput. Sci., 1996)

Towards a Complete Classification of Tractability in Allen's Algebra. - Thomas Drakengren; Peter Jonsson (IJCAI, 1997)

Twenty-One Large Tractable Subclasses of Allen's Algebra. - Thomas Drakengren; Peter Jonsson (Artif. Intell., 1997)

Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time. - Thomas Drakengren; Peter Jonsson (J. Artif. Intell. Res., 1997)

A Complete Classification of Tractability in RCC-5. - Peter Jonsson; Thomas Drakengren (J. Artif. Intell. Res., 1997)

A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations. - Thomas Drakengren; Peter Jonsson (Artif. Intell., 1998)

Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic. - Thomas Drakengren; Peter Jonsson (J. Log. Comput., 1998)

A Decidable Canonical Representation of the Compact Elements in Scott's Reflexive Domain in P-omega. - Thomas Drakengren (Theor. Comput. Sci., 1998)

Expressive Reasoning about Action in Nondeterministic Polynomial Time. - Thomas Drakengren; Marcus Bjäreland (IJCAI, 1999)

Reasoning About Action in Polynomial Time. - Thomas Drakengren; Marcus Bjäreland (Artif. Intell., 1999)

Computational Complexity of Relating Time Points with Intervals. - Peter Jonsson; Thomas Drakengren; Christer Bäckström (Artif. Intell., 1999)

Computational Complexity of Temporal Constraint Problems. - Thomas Drakengren; Peter Jonsson (Handbook of Temporal Reasoning in Artificial Intelligence, 2005)