BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Finland
1 × France
1 × Spain
1 × USA
2 × Germany
Collaborated with:
A.Proskurowski D.Seese J.Lagergren E.Tidén B.Courcelle
Talks about:
graph (3) forbidden (2) problem (2) minor (2) tree (2) treewidth (1) distribut (1) congruenc (1) techniqu (1) subclass (1)

Person: Stefan Arnborg

DBLP DBLP: Arnborg:Stefan

Contributed to:

TAGT 19941994
ICALP 19911991
CSL 19901990
GG 19901990
ICALP 19881988
RTA 19851985

Wrote 6 papers:

TAGT-1994-ArnborgP #bound #graph #subclass
A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths (SA, AP), pp. 469–486.
ICALP-1991-LagergrenA #congruence #finite #using
Finding Minimal Forbidden Minors Using a Finite Congruence (JL, SA), pp. 532–543.
CSL-1990-ArnborgPS #automaton #higher-order #logic #monad
Monadic Second Order Logic, Tree Automata and Forbidden Minors (SA, AP, DS), pp. 1–16.
GG-1990-ArnborgCPS #algebra #graph #reduction
An Algebraic Theory of Graph Reduction (SA, BC, AP, DS), pp. 70–83.
ICALP-1988-ArnborgLS #graph #problem
Problems Easy for Tree-Decomposable Graphs (SA, JL, DS), pp. 38–51.
RTA-1985-ArnborgT #problem #unification
Unification Problems with One-Sided Distributivity (SA, ET), pp. 398–406.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.