Stefan Arnborg

Publication Activity (10 Years)

Years Active: 1974-2020
Publications (10 Years): 2

Top Topics

Bayesian Analysis

Computationally Feasible

Partially Ordered

Top Venues

Int. J. Approx. Reason.

Treewidth, Kernels, and Algorithms

Publications

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