Stefan Arnborg

Available identifiers

zbMath Open arnborg.stefanMaRDI QIDQ324652

List of research outcomes

Publication	Date of Publication	Type
Canonical representations of partial 2-and 3-trees	2022-12-09	Paper
Seeing Arboretum for the (partial k-) Trees	2022-10-19	Paper
Decomposability helps for deciding logics of knowledge and belief	2022-08-16	Paper
A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths	2019-01-10	Paper
Robust Bayesian analysis in partially ordered plausibility calculi	2016-10-17	Paper
Decomposable structures, Boolean function representations, and optimization	2010-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4406004	2003-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q4281679	2000-08-14	Paper
Graph decompositions and tree automata in reasoning with uncertainty	1994-12-11	Paper
An algebraic theory of graph reduction	1994-09-11	Paper
https://portal.mardi4nfdi.de/entity/Q4036591	1993-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4037299	1993-05-18	Paper
Canonical representations of partial 2- and 3-trees	1992-12-14	Paper
Easy problems for tree-decomposable graphs	1991-01-01	Paper
Forbidden minors characterization of partial 3-trees	1990-01-01	Paper
Linear time algorithms for NP-hard problems restricted to partial k- trees	1989-01-01	Paper
Algebraic decomposition of regular curves	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3812222	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3475304	1988-01-01	Paper
Complexity of Finding Embeddings in a k-Tree	1987-01-01	Paper
Unification problems with one-sided distributivity	1987-01-01	Paper
Characterization and Recognition of Partial 3-Trees	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3029044	1986-01-01	Paper
Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3758844	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3696499	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3334090	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3042417	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3042845	1984-01-01	Paper
A simple query language based on set algebra	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3926080	1980-01-01	Paper
A Simple Event-Definition Notation and Associated Computer Programs	1979-01-01	Paper
Reduced State EnumerationߞAnother Algorithm for Reliability Evaluation	1978-01-01	Paper
Analysis of non-deterministic drum scheduling	1978-01-01	Paper
Optimal memory management in a system with garbage collection	1974-01-01	Paper
A note on the assignment of measurement points for frequency counts in structured programs	1974-01-01	Paper
Storage administration in a virtual memory Simula system	1972-01-01	Paper

Research outcomes over time

This page was built for person: Stefan Arnborg