The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stefan Arnborg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stefan Arnborg
    A Simple Query Language Based on Set Algebra. [Citation Graph (1, 0)][DBLP]
    BIT, 1980, v:20, n:3, pp:266-278 [Journal]
  2. Stefan Arnborg
    Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey. [Citation Graph (1, 0)][DBLP]
    BIT, 1985, v:25, n:1, pp:2-23 [Journal]
  3. Stefan Arnborg, Jens Lagergren, Detlef Seese
    Easy Problems for Tree-Decomposable Graphs. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:2, pp:308-340 [Journal]
  4. Stefan Arnborg, Andrzej Proskurowski, Detlef Seese
    Monadic Second Order Logic, Tree Automata and Forbidden Minors. [Citation Graph (0, 0)][DBLP]
    CSL, 1990, pp:1-16 [Conf]
  5. Stefan Arnborg
    Decomposability Helps for Deciding Logics of Knowledge and Belief. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Graph Transformations in Computer Science, 1993, pp:37-50 [Conf]
  6. Stefan Arnborg, Gunnar Sjödin
    Bayes Rules in Finite Models. [Citation Graph (0, 0)][DBLP]
    ECAI, 2000, pp:571-575 [Conf]
  7. Parosh Aziz Abdulla, Stefan Arnborg
    An Equivalence Decision Problem in Systolic Array Verification. [Citation Graph (0, 0)][DBLP]
    Specification and Verification of Concurrent Systems, 1988, pp:236-245 [Conf]
  8. Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
    An Algebraic Theory of Graph Reduction. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1990, pp:70-83 [Conf]
  9. Stefan Arnborg, Jens Lagergren, Detlef Seese
    Problems Easy for Tree-Decomposable Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:38-51 [Conf]
  10. Jens Lagergren, Stefan Arnborg
    Finding Minimal Forbidden Minors Using a Finite Congruence. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:532-543 [Conf]
  11. Stefan Arnborg
    Learning in prevision Space. [Citation Graph (0, 0)][DBLP]
    ISIPTA, 1999, pp:8-14 [Conf]
  12. Stefan Arnborg
    Experiments with a Projection Operator for Algebraic Decomposition. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1988, pp:177-182 [Conf]
  13. Stefan Arnborg
    Decomposable Structures, Boolean Function Representations, and Optimization. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:21-36 [Conf]
  14. Stefan Arnborg, Ingrid Agartz, Håkan Hall, Erik Jönsson, Anna Sillén, Göran Sedvall
    Data Mining in Schizophrenia Research - Preliminary Analysis. [Citation Graph (0, 0)][DBLP]
    PKDD, 2002, pp:27-38 [Conf]
  15. Stefan Arnborg, Erik Tidén
    Unification Problems with One-Sided Distributivity. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:398-406 [Conf]
  16. Stefan Arnborg, Andrzej Proskurowski
    Canonical Representation of Partial 2- and 3-Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:310-319 [Conf]
  17. Stefan Arnborg, Andrzej Proskurowski
    A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths. [Citation Graph (0, 0)][DBLP]
    TAGT, 1994, pp:469-486 [Conf]
  18. Stefan Arnborg, Andrzej Proskurowski
    Canonical Representations of Partial 2- and 3-Trees. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:2, pp:197-214 [Journal]
  19. Stefan Arnborg, Andrzej Proskurowski
    Problems on graphs with bounded decomposability. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:25, n:, pp:7-10 [Journal]
  20. 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. [Citation Graph (0, 0)][DBLP]
    Int. J. Neural Syst., 2005, v:15, n:3, pp:207-222 [Journal]
  21. Stefan Arnborg
    Abstract Computation Model Used for a Production Compiler. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1974, v:3, n:2, pp:46-50 [Journal]
  22. Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
    An Algebraic Theory of Graph Reduction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:5, pp:1134-1164 [Journal]
  23. Stefan Arnborg, Huichun Feng
    Algebraic Decomposition of Regular Curves. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1988, v:5, n:1/2, pp:131-140 [Journal]
  24. Erik Tidén, Stefan Arnborg
    Unification Problems with One-Sided Distributivity. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1987, v:3, n:1/2, pp:183-202 [Journal]
  25. Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil
    Forbidden minors characterization of partial 3-trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:1, pp:1-19 [Journal]

  26. Linear time algorithms for NP-hard problems restricted to partial k-trees. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002