| 2005 | ||
|---|---|---|
| 28 | 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): 207-222 (2005) | |
| 2002 | ||
| 27 | 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: 27-38 | |
| 2000 | ||
| 26 | Stefan Arnborg, Gunnar Sjödin: Bayes Rules in Finite Models. ECAI 2000: 571-575 | |
| 1999 | ||
| 25 | Stefan Arnborg: Learning in prevision Space. ISIPTA 1999: 8-14 | |
| 1998 | ||
| 24 | Stefan Arnborg, Lars Ivansson: Algorithm Theory - SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings Springer 1998 | |
| 1995 | ||
| 23 | Stefan Arnborg: Decomposable Structures, Boolean Function Representations, and Optimization. MFCS 1995: 21-36 | |
| 1994 | ||
| 22 | Stefan Arnborg, Andrzej Proskurowski: A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths. TAGT 1994: 469-486 | |
| 1993 | ||
| 21 | Stefan Arnborg: Decomposability Helps for Deciding Logics of Knowledge and Belief. Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 37-50 | |
| 20 | Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese: An Algebraic Theory of Graph Reduction. J. ACM 40(5): 1134-1164 (1993) | |
| 19 | Stefan Arnborg: Graph decompositions and tree automata in reasoning with uncertainty. J. Exp. Theor. Artif. Intell. 5(4): 335-357 (1993) | |
| 1992 | ||
| 18 | Stefan Arnborg, Andrzej Proskurowski: Canonical Representations of Partial 2- and 3-Trees. BIT 32(2): 197-214 (1992) | |
| 1991 | ||
| 17 | Jens Lagergren, Stefan Arnborg: Finding Minimal Forbidden Minors Using a Finite Congruence. ICALP 1991: 532-543 | |
| 16 | Stefan Arnborg, Jens Lagergren, Detlef Seese: Easy Problems for Tree-Decomposable Graphs. J. Algorithms 12(2): 308-340 (1991) | |
| 1990 | ||
| 15 | Stefan Arnborg, Andrzej Proskurowski, Detlef Seese: Monadic Second Order Logic, Tree Automata and Forbidden Minors. CSL 1990: 1-16 | |
| 14 | Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese: An Algebraic Theory of Graph Reduction. Graph-Grammars and Their Application to Computer Science 1990: 70-83 | |
| 13 | Stefan Arnborg, Andrzej Proskurowski: Canonical Representation of Partial 2- and 3-Trees. SWAT 1990: 310-319 | |
| 12 | Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil: Forbidden minors characterization of partial 3-trees. Discrete Mathematics 80(1): 1-19 (1990) | |
| 1989 | ||
| 11 | Stefan Arnborg, Andrzej Proskurowski: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics 23(1): 11-24 (1989) | |
| 1988 | ||
| 10 | Stefan Arnborg, Jens Lagergren, Detlef Seese: Problems Easy for Tree-Decomposable Graphs (Extended Abstract). ICALP 1988: 38-51 | |
| 9 | Stefan Arnborg: Experiments with a Projection Operator for Algebraic Decomposition. ISSAC 1988: 177-182 | |
| 8 | Parosh Aziz Abdulla, Stefan Arnborg: An Equivalence Decision Problem in Systolic Array Verification. Specification and Verification of Concurrent Systems 1988: 236-245 | |
| 7 | Stefan Arnborg, Huichun Feng: Algebraic Decomposition of Regular Curves. J. Symb. Comput. 5(1/2): 131-140 (1988) | |
| 1987 | ||
| 6 | Erik Tidén, Stefan Arnborg: Unification Problems with One-Sided Distributivity. J. Symb. Comput. 3(1/2): 183-202 (1987) | |
| 1985 | ||
| 5 | Stefan Arnborg, Erik Tidén: Unification Problems with One-Sided Distributivity. RTA 1985: 398-406 | |
| 4 | Stefan Arnborg: Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey. BIT 25(1): 2-23 (1985) | |
| 3 | Stefan Arnborg, Andrzej Proskurowski: Problems on graphs with bounded decomposability. Bulletin of the EATCS 25: 7-10 (1985) | |
| 1980 | ||
| 2 | Stefan Arnborg: A Simple Query Language Based on Set Algebra. BIT 20(3): 266-278 (1980) | |
| 1974 | ||
| 1 | Stefan Arnborg: Abstract Computation Model Used for a Production Compiler. Inf. Process. Lett. 3(2): 46-50 (1974) | |
| 1 | Parosh Aziz Abdulla | [8] |
| 2 | Ingrid Agartz | [27] |
| 3 | Andrew Bate | [28] |
| 4 | Derek G. Corneil | [12] |
| 5 | Bruno Courcelle | [14] [20] |
| 6 | I. Ralph Edwards | [28] |
| 7 | Huichun Feng | [7] |
| 8 | Håkan Hall | [27] |
| 9 | Lars Ivansson | [24] |
| 10 | Erik Jönsson | [27] |
| 11 | Jens Lagergren | [10] [16] [17] |
| 12 | G. Niklas Norén | [28] |
| 13 | Roland Orre | [28] |
| 14 | Andrzej Proskurowski | [3] [11] [12] [13] [14] [15] [18] [20] [22] |
| 15 | Göran Sedvall | [27] |
| 16 | Detlef Seese | [10] [14] [15] [16] [20] |
| 17 | Anna Sillén | [27] |
| 18 | Gunnar Sjödin | [26] |
| 19 | Erik Swahn | [28] |
| 20 | Erik Tidén | [5] [6] |
Colors in the list of coauthors
Last update Thu May 24 01:13:30 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page