Stefan Arnborg

According to our database, Stefan Arnborg authored at least 30 papers between 1974 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Seeing Arboretum for the (partial k-) Trees.

Stefan Arnborg, Andrzej Proskurowski

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2016

Robust Bayesian analysis in partially ordered plausibility calculi.

Stefan Arnborg

Int. J. Approx. Reason., 2016

2015

What is the plausibility of probability?(revised 2003, 2015).

Stefan Arnborg, Gunnar Sjödin

CoRR, 2015

2006

An Information Fusion Game Component.

Joel Brynielsson, Stefan Arnborg

J. Adv. Inf. Fusion, 2006

Robust Bayesianism: Relation to Evidence Theory.

Stefan Arnborg

J. Adv. Inf. Fusion, 2006

2005

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

2002

Data Mining in Schizophrenia Research - Preliminary Analysis.

Stefan Arnborg, Ingrid Agartz, Håkan Hall, Erik Jönsson, Anna Sillén, Göran Sedvall

Proceedings of the Principles of Data Mining and Knowledge Discovery, 2002

2000

Bayes Rules in Finite Models.

Stefan Arnborg, Gunnar Sjödin

Proceedings of the ECAI 2000, 2000

1999

Learning in prevision Space.

Stefan Arnborg

Proceedings of the ISIPTA '99, Proceedings of the First International Symposium on Imprecise Probabilities and Their Applications, held at the Conference Center "Het Pand" of the Universiteit Gent, Ghent, Belgium, 29 June, 1999

1995

Decomposable Structures, Boolean Function Representations, and Optimization.

Stefan Arnborg

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994

A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths.

Stefan Arnborg, Andrzej Proskurowski

Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

1993

Graph decompositions and tree automata in reasoning with uncertainty.

Stefan Arnborg

J. Exp. Theor. Artif. Intell., 1993

An Algebraic Theory of Graph Reduction.

Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese

J. ACM, 1993

Decomposability Helps for Deciding Logics of Knowledge and Belief.

Stefan Arnborg

Proceedings of the Graph Transformations in Computer Science, International Workshop, 1993

1992

Canonical Representations of Partial 2- and 3-Trees.

Stefan Arnborg, Andrzej Proskurowski

BIT, 1992

1991

Easy Problems for Tree-Decomposable Graphs.

Stefan Arnborg, Jens Lagergren, Detlef Seese

J. Algorithms, 1991

Finding Minimal Forbidden Minors Using a Finite Congruence.

Jens Lagergren, Stefan Arnborg

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

Forbidden minors characterization of partial 3-trees.

Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil

Discret. Math., 1990

Canonical Representation of Partial 2- and 3-Trees.

Stefan Arnborg, Andrzej Proskurowski

Proceedings of the SWAT 90, 1990

Monadic Second Order Logic, Tree Automata and Forbidden Minors.

Stefan Arnborg, Andrzej Proskurowski, Detlef Seese

Proceedings of the Computer Science Logic, 4th Workshop, 1990

1989

Linear time algorithms for NP-hard problems restricted to partial k-trees.

Stefan Arnborg, Andrzej Proskurowski

Discret. Appl. Math., 1989

1988

Algebraic Decomposition of Regular Curves.

Stefan Arnborg, Huichun Feng

J. Symb. Comput., 1988

Experiments with a Projection Operator for Algebraic Decomposition.

Stefan Arnborg

Proceedings of the Symbolic and Algebraic Computation, 1988

Problems Easy for Tree-Decomposable Graphs (Extended Abstract).

Stefan Arnborg, Jens Lagergren, Detlef Seese

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

An Equivalence Decision Problem in Systolic Array Verification.

Parosh Aziz Abdulla, Stefan Arnborg

Proceedings of the Specification and Verification of Concurrent Systems [BCS-FACS Workshop, 1988

1987

Unification Problems with One-Sided Distributivity.

Erik Tidén, Stefan Arnborg

J. Symb. Comput., 1987

1985

Problems on graphs with bounded decomposability.

Stefan Arnborg, Andrzej Proskurowski

Bull. EATCS, 1985

Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey.

Stefan Arnborg

BIT, 1985

1980

A Simple Query Language Based on Set Algebra.

Stefan Arnborg

BIT, 1980

1974

Abstract Computation Model Used for a Production Compiler.

Stefan Arnborg

Inf. Process. Lett., 1974