Stefan Arnborg

From MaRDI portal
Revision as of 09:25, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:324652

Available identifiers

zbMath Open arnborg.stefanMaRDI QIDQ324652

List of research outcomes

PublicationDate of PublicationType
Canonical representations of partial 2-and 3-trees2022-12-09Paper
Seeing Arboretum for the (partial k-) Trees2022-10-19Paper
Decomposability helps for deciding logics of knowledge and belief2022-08-16Paper
A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths2019-01-10Paper
Robust Bayesian analysis in partially ordered plausibility calculi2016-10-17Paper
Decomposable structures, Boolean function representations, and optimization2010-06-17Paper
https://portal.mardi4nfdi.de/entity/Q44060042003-06-25Paper
https://portal.mardi4nfdi.de/entity/Q42816792000-08-14Paper
Graph decompositions and tree automata in reasoning with uncertainty1994-12-11Paper
An algebraic theory of graph reduction1994-09-11Paper
https://portal.mardi4nfdi.de/entity/Q40365911993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40372991993-05-18Paper
Canonical representations of partial 2- and 3-trees1992-12-14Paper
Easy problems for tree-decomposable graphs1991-01-01Paper
Forbidden minors characterization of partial 3-trees1990-01-01Paper
Linear time algorithms for NP-hard problems restricted to partial k- trees1989-01-01Paper
Algebraic decomposition of regular curves1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34753041988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38122221988-01-01Paper
Unification problems with one-sided distributivity1987-01-01Paper
Complexity of Finding Embeddings in a k-Tree1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30290441986-01-01Paper
Characterization and Recognition of Partial 3-Trees1986-01-01Paper
Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36964991985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37588441985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30424171984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30428451984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33340901984-01-01Paper
A simple query language based on set algebra1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39260801980-01-01Paper
A Simple Event-Definition Notation and Associated Computer Programs1979-01-01Paper
Reduced State EnumerationߞAnother Algorithm for Reliability Evaluation1978-01-01Paper
Analysis of non-deterministic drum scheduling1978-01-01Paper
Optimal memory management in a system with garbage collection1974-01-01Paper
A note on the assignment of measurement points for frequency counts in structured programs1974-01-01Paper
Storage administration in a virtual memory Simula system1972-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Stefan Arnborg