BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
2 × USA
Collaborated with:
K.Kawarabayashi M.Grohe D.Marx
Talks about:
algorithm (2) shorter (2) proof (2) minor (2) graph (2) decomposit (1) tractabl (1) subgraph (1) topolog (1) theorem (1)

Person: Paul Wollan

DBLP DBLP: Wollan:Paul

Contributed to:

STOC 20112011
STOC 20102010

Wrote 3 papers:

STOC-2011-GroheKMW #parametricity
Finding topological subgraphs is fixed-parameter tractable (MG, KiK, DM, PW), pp. 479–488.
STOC-2011-KawarabayashiW #algorithm #composition #graph #proving
A simpler algorithm and shorter proof for the graph minor decomposition (KiK, PW), pp. 451–458.
STOC-2010-KawarabayashiW #algorithm #graph #proving #theorem
A shorter proof of the graph minor algorithm: the unique linkage theorem (KiK, PW), pp. 687–694.

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.