Concepedia

Stefan Arnborg

SA

29

Publications

4.1K

Citations

21

H-Index

1972

Active since

Affiliations

KTH Royal Institute of Technology(Current)

University of Oregon

University of Newcastle Australia

Karolinska Institutet

University of Toronto

Stefan Arnborg is an author at KTH Royal Institute of Technology specializing in engineering, computer science, and graph theory.

Top concepts

EngineeringComputer ScienceGraph TheoryComputational ComplexityCombinatorial OptimizationData ScienceSystems EngineeringDiscrete MathematicsElectrical EngineeringSmart Grid

Publications per year

1972–2012

29

Publications

29

Complexity of Finding Embeddings in a <i>k</i>-Tree

Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski · SIAM Journal on Algebraic and Discrete Methods · 1987 · 1.2K citations

Partial K-tree, Engineering, Computational Complexity +16

Easy problems for tree-decomposable graphs

Stefan Arnborg, Jens Lagergren, Detlef Seese · Journal of Algorithms · 1991 · 864 citations

Mathematical Programming, Engineering, Graph Theory +7

Linear time algorithms for NP-hard problems restricted to partial k-trees

Stefan Arnborg, Andrzej Proskurowski · Discrete Applied Mathematics · 1989 · 573 citations

Engineering, Graph Theory, Combinatorial Problem +8

Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey

Stefan Arnborg · BIT Numerical Mathematics · 1985 · 364 citations

Engineering, Graph Theory, Combinatorial Problem +7

Characterization and Recognition of Partial 3-Trees

Stefan Arnborg, Andrzej Proskurowski · SIAM Journal on Algebraic and Discrete Methods · 1986 · 171 citations

Engineering, Network Analysis, Computational Complexity +22

Rows per page

1–5 of 29