Arie M. C. A. Koster
Computational Theory and Mathematics · 2008
A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 5 citations into it
Whom Arie M. C. A. Koster trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Arie M. C. A. Koster's perspective
Ordered by how strongly the researchers Arie M. C. A. Koster trusts endorse each paper. Same corpus, a different order for every researcher.
- Local computations with probabilities on graphical structures and their application to expert systems
- Graph Minors. XX. Wagner's conjecture (J. Comb. Theory B)
- Invitation to fixed-parameter algorithms (Computer Science Review)
- Exact Algorithms for NP-Hard Problems: A Survey (Combinatorial Optimization)
- Improved approximation algorithms for minimum-weight vertex separators (Symposium on the Theory of Computing)
- The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks
- Probabilistic reasoning in intelligent systems: Networks of plausible inference
- Causation, prediction, and search
- Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper
- Causal diagrams for empirical research
Their papers
- Combinatorial Optimization on Graphs of Bounded Treewidth (2008) — 318 citations