Abstract Computation Model Used for a Production Compiler. - Stefan Arnborg (Inf. Process. Lett., 1974)

A Simple Query Language Based on Set Algebra. - Stefan Arnborg (BIT, 1980)

Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey. - Stefan Arnborg (BIT, 1985)

Problems on graphs with bounded decomposability. - Stefan Arnborg; Andrzej Proskurowski (Bull. EATCS, 1985)

Unification Problems with One-Sided Distributivity. - Erik Tidén; Stefan Arnborg (J. Symb. Comput., 1987)

An Equivalence Decision Problem in Systolic Array Verification. - Parosh Aziz Abdulla; Stefan Arnborg (Specification and Verification of Concurrent Systems, 1988)

Problems Easy for Tree-Decomposable Graphs (Extended Abstract). - Stefan Arnborg; Jens Lagergren; Detlef Seese (ICALP, 1988)

Experiments with a Projection Operator for Algebraic Decomposition. - Stefan Arnborg (ISSAC, 1988)

Algebraic Decomposition of Regular Curves. - Stefan Arnborg; Huichun Feng (J. Symb. Comput., 1988)

Linear time algorithms for NP-hard problems restricted to partial k-trees. - Stefan Arnborg; Andrzej Proskurowski (Discret. Appl. Math., 1989)

Monadic Second Order Logic, Tree Automata and Forbidden Minors. - Stefan Arnborg; Andrzej Proskurowski; Detlef Seese (CSL, 1990)

Canonical Representation of Partial 2- and 3-Trees. - Stefan Arnborg; Andrzej Proskurowski (SWAT, 1990)

Forbidden minors characterization of partial 3-trees. - Stefan Arnborg; Andrzej Proskurowski; Derek G. Corneil (Discret. Math., 1990)

Finding Minimal Forbidden Minors Using a Finite Congruence. - Jens Lagergren; Stefan Arnborg (ICALP, 1991)

Easy Problems for Tree-Decomposable Graphs. - Stefan Arnborg; Jens Lagergren; Detlef Seese (J. Algorithms, 1991)

Canonical Representations of Partial 2- and 3-Trees. - Stefan Arnborg; Andrzej Proskurowski (BIT, 1992)

Decomposability Helps for Deciding Logics of Knowledge and Belief. - Stefan Arnborg (Dagstuhl Seminar on Graph Transformations in Computer Science, 1993)

An Algebraic Theory of Graph Reduction. - Stefan Arnborg; Bruno Courcelle; Andrzej Proskurowski; Detlef Seese (J. ACM, 1993)

Graph decompositions and tree automata in reasoning with uncertainty. - Stefan Arnborg (J. Exp. Theor. Artif. Intell., 1993)

A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths. - Stefan Arnborg; Andrzej Proskurowski (TAGT, 1994)

Decomposable Structures, Boolean Function Representations, and Optimization. - Stefan Arnborg (MFCS, 1995)

Learning in prevision Space. - Stefan Arnborg (ISIPTA, 1999)

Bayes Rules in Finite Models. - Stefan Arnborg; Gunnar Sjödin (ECAI, 2000)

Data Mining in Schizophrenia Research - Preliminary Analysis. - Stefan Arnborg; Ingrid Agartz; Håkan Hall; Erik Jönsson; Anna Sillén; Göran Sedvall (PKDD, 2002)

A bayesian recurrent neural network for unsupervised pattern recognition in large incomplete data sets. - Roland Orre; Andrew Bate; G. Niklas Norén; Erik Swahn; Stefan Arnborg; I. Ralph Edwards (Int. J. Neural Syst., 2005)

Robust Bayesianism: Relation to Evidence Theory. - Stefan Arnborg (J. Adv. Inf. Fusion, 2006)

An Information Fusion Game Component. - Joel Brynielsson; Stefan Arnborg (J. Adv. Inf. Fusion, 2006)

What is the plausibility of probability?(revised 2003, 2015). - Stefan Arnborg; Gunnar Sjödin (CoRR, 2015)

Robust Bayesian analysis in partially ordered plausibility calculi. - Stefan Arnborg (Int. J. Approx. Reason., 2016)

Seeing Arboretum for the (partial k-) Trees. - Stefan Arnborg; Andrzej Proskurowski (Treewidth, Kernels, and Algorithms, 2020)