scientific article; zbMATH DE number 5874803

zbMath1220.68074MaRDI QIDQ5391139

Siamak Tazari

Publication date: 5 April 2011

Full work available at URL: http://www2.informatik.hu-berlin.de/~tazari/papers/diss-siamak-tazari.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityapproximationalgorithmic graph theorygraph minors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph minors (05C83) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering

This page was built for publication: