default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Arnborg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c16]Stefan Arnborg, Andrzej Proskurowski:
Seeing Arboretum for the (partial k-) Trees. Treewidth, Kernels, and Algorithms 2020: 3-6
2010 – 2019
- 2016
- [j16]Stefan Arnborg:
Robust Bayesian analysis in partially ordered plausibility calculi. Int. J. Approx. Reason. 78: 1-14 (2016) - 2015
- [i1]Stefan Arnborg, Gunnar Sjödin:
What is the plausibility of probability?(revised 2003, 2015). CoRR abs/1511.07373 (2015)
2000 – 2009
- 2006
- [j15]Stefan Arnborg:
Robust Bayesianism: Relation to Evidence Theory. J. Adv. Inf. Fusion 1(1): 75-90 (2006) - [j14]Joel Brynielsson, Stefan Arnborg:
An Information Fusion Game Component. J. Adv. Inf. Fusion 1(2): 108-121 (2006) - 2005
- [j13]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
- [c15]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
- [c14]Stefan Arnborg, Gunnar Sjödin:
Bayes Rules in Finite Models. ECAI 2000: 571-575
1990 – 1999
- 1999
- [c13]Stefan Arnborg:
Learning in prevision Space. ISIPTA 1999: 8-14 - 1998
- [e1]Stefan Arnborg, Lars Ivansson:
Algorithm Theory - SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings. Lecture Notes in Computer Science 1432, Springer 1998, ISBN 3-540-64682-5 [contents] - 1995
- [c12]Stefan Arnborg:
Decomposable Structures, Boolean Function Representations, and Optimization. MFCS 1995: 21-36 - 1994
- [c11]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
- [j12]Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese:
An Algebraic Theory of Graph Reduction. J. ACM 40(5): 1134-1164 (1993) - [j11]Stefan Arnborg:
Graph decompositions and tree automata in reasoning with uncertainty. J. Exp. Theor. Artif. Intell. 5(4): 335-357 (1993) - [c10]Stefan Arnborg:
Decomposability Helps for Deciding Logics of Knowledge and Belief. Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 37-50 - 1992
- [j10]Stefan Arnborg, Andrzej Proskurowski:
Canonical Representations of Partial 2- and 3-Trees. BIT 32(2): 197-214 (1992) - 1991
- [j9]Stefan Arnborg, Jens Lagergren, Detlef Seese:
Easy Problems for Tree-Decomposable Graphs. J. Algorithms 12(2): 308-340 (1991) - [c9]Jens Lagergren, Stefan Arnborg:
Finding Minimal Forbidden Minors Using a Finite Congruence. ICALP 1991: 532-543 - 1990
- [j8]Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil:
Forbidden minors characterization of partial 3-trees. Discret. Math. 80(1): 1-19 (1990) - [c8]Stefan Arnborg, Andrzej Proskurowski, Detlef Seese:
Monadic Second Order Logic, Tree Automata and Forbidden Minors. CSL 1990: 1-16 - [c7]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 - [c6]Stefan Arnborg, Andrzej Proskurowski:
Canonical Representation of Partial 2- and 3-Trees. SWAT 1990: 310-319
1980 – 1989
- 1989
- [j7]Stefan Arnborg, Andrzej Proskurowski:
Linear time algorithms for NP-hard problems restricted to partial k-trees. Discret. Appl. Math. 23(1): 11-24 (1989) - 1988
- [j6]Stefan Arnborg, Huichun Feng:
Algebraic Decomposition of Regular Curves. J. Symb. Comput. 5(1/2): 131-140 (1988) - [c5]Parosh Aziz Abdulla, Stefan Arnborg:
An Equivalence Decision Problem in Systolic Array Verification. Specification and Verification of Concurrent Systems 1988: 236-245 - [c4]Stefan Arnborg, Jens Lagergren, Detlef Seese:
Problems Easy for Tree-Decomposable Graphs (Extended Abstract). ICALP 1988: 38-51 - [c3]Stefan Arnborg:
Experiments with a Projection Operator for Algebraic Decomposition. ISSAC 1988: 177-182 - 1987
- [j5]Erik Tidén, Stefan Arnborg:
Unification Problems with One-Sided Distributivity. J. Symb. Comput. 3(1/2): 183-202 (1987) - 1986
- [c2]Stefan Arnborg, Huichun Feng:
Algebraic decomposition of regular curves. SYMSAC 1986: 53-55 - 1985
- [j4]Stefan Arnborg:
Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey. BIT 25(1): 1-23 (1985) - [j3]Stefan Arnborg, Andrzej Proskurowski:
Problems on graphs with bounded decomposability. Bull. EATCS 25: 7-10 (1985) - [c1]Stefan Arnborg, Erik Tidén:
Unification Problems with One-Sided Distributivity. RTA 1985: 398-406 - 1980
- [j2]Stefan Arnborg:
A Simple Query Language Based on Set Algebra. BIT 20(3): 265-278 (1980)
1970 – 1979
- 1974
- [j1]Stefan Arnborg:
Abstract Computation Model Used for a Production Compiler. Inf. Process. Lett. 3(2): 46-50 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
