Publication:5391139

From MaRDI portal
Revision as of 02:22, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


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

zbMATH Keywords

complexity; approximation; algorithmic graph theory; graph minors


Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

68R10: Graph theory (including graph drawing) in computer science

03D15: Complexity of computation (including implicit computational complexity)

68-02: Research exposition (monographs, survey articles) pertaining to computer science

05C83: Graph minors

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms


Related Items

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



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5391139&oldid=20125049"
Powered by MediaWiki