Stefan Arnborg

34 papers A* 2A 1B 3Journal 17Unranked 10
YearRankTypeTitle / Venue / Authors
2020 — conf
Seeing Arboretum for the (partial k-) Trees.
Treewidth, Kernels, and Algorithms
Stefan Arnborg, Andrzej Proskurowski
2016 J jnl
Robust Bayesian analysis in partially ordered plausibility calculi.
Int. J. Approx. Reason.
Stefan Arnborg
2015 J jnl
What is the plausibility of probability?(revised 2003, 2015).
CoRR
Stefan Arnborg, Gunnar Sjödin
2006 J jnl
An Information Fusion Game Component.
J. Adv. Inf. Fusion
Joel Brynielsson, Stefan Arnborg
2006 J jnl
Robust Bayesianism: Relation to Evidence Theory.
J. Adv. Inf. Fusion
Stefan Arnborg
2005 J jnl
A bayesian recurrent neural network for unsupervised pattern recognition in large incomplete data sets.
Int. J. Neural Syst.
Roland Orre, Andrew Bate, G. Niklas Norén, Erik Swahn, Stefan Arnborg, I. Ralph Edwards
2002 — conf
Data Mining in Schizophrenia Research - Preliminary Analysis.
PKDD
Stefan Arnborg, Ingrid Agartz, Håkan Hall, Erik Jönsson, Anna Sillén, Göran Sedvall
2000 A conf
Bayes Rules in Finite Models.
ECAI
Stefan Arnborg, Gunnar Sjödin
1999 — conf
Learning in prevision Space.
ISIPTA
Stefan Arnborg
1998 — ed.
Algorithm Theory - SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings
SWAT
Stefan Arnborg, Lars Ivansson
1995 B conf
Decomposable Structures, Boolean Function Representations, and Optimization.
MFCS
Stefan Arnborg
1994 — conf
A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths.
TAGT
Stefan Arnborg, Andrzej Proskurowski
1993 J jnl
An Algebraic Theory of Graph Reduction.
J. ACM
Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
1993 — conf
Decomposability Helps for Deciding Logics of Knowledge and Belief.
Dagstuhl Seminar on Graph Transformations in Computer Science
Stefan Arnborg
1993 J jnl
Graph decompositions and tree automata in reasoning with uncertainty.
J. Exp. Theor. Artif. Intell.
Stefan Arnborg
1992 J jnl
Canonical Representations of Partial 2- and 3-Trees.
BIT
Stefan Arnborg, Andrzej Proskurowski
1991 J jnl
Easy Problems for Tree-Decomposable Graphs.
J. Algorithms
Stefan Arnborg, Jens Lagergren, Detlef Seese
1991 A* conf
Finding Minimal Forbidden Minors Using a Finite Congruence.
ICALP
Jens Lagergren, Stefan Arnborg
1990 — conf
An Algebraic Theory of Graph Reduction.
Graph-Grammars and Their Application to Computer Science
Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
1990 — conf
Canonical Representation of Partial 2- and 3-Trees.
SWAT
Stefan Arnborg, Andrzej Proskurowski
1990 J jnl
Forbidden minors characterization of partial 3-trees.
Discret. Math.
Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil
1990 B conf
Monadic Second Order Logic, Tree Automata and Forbidden Minors.
CSL
Stefan Arnborg, Andrzej Proskurowski, Detlef Seese
1989 J jnl
Linear time algorithms for NP-hard problems restricted to partial k-trees.
Discret. Appl. Math.
Stefan Arnborg, Andrzej Proskurowski
1988 J jnl
Algebraic Decomposition of Regular Curves.
J. Symb. Comput.
Stefan Arnborg, Huichun Feng
1988 — conf
An Equivalence Decision Problem in Systolic Array Verification.
Specification and Verification of Concurrent Systems
Parosh Aziz Abdulla, Stefan Arnborg
1988 B conf
Experiments with a Projection Operator for Algebraic Decomposition.
ISSAC
Stefan Arnborg
1988 A* conf
Problems Easy for Tree-Decomposable Graphs (Extended Abstract).
ICALP
Stefan Arnborg, Jens Lagergren, Detlef Seese
1987 J jnl
Unification Problems with One-Sided Distributivity.
J. Symb. Comput.
Erik Tidén, Stefan Arnborg
1986 — conf
Algebraic decomposition of regular curves.
SYMSAC
Stefan Arnborg, Huichun Feng
1985 J jnl
Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey.
BIT
Stefan Arnborg
1985 J jnl
Problems on graphs with bounded decomposability.
Bull. EATCS
Stefan Arnborg, Andrzej Proskurowski
1985 — conf
Unification Problems with One-Sided Distributivity.
RTA
Stefan Arnborg, Erik Tidén
1980 J jnl
A Simple Query Language Based on Set Algebra.
BIT
Stefan Arnborg
1974 J jnl
Abstract Computation Model Used for a Production Compiler.
Inf. Process. Lett.
Stefan Arnborg