Tight Bounds for Linkages in Planar Graphs-Reference-Cited by-同舟云学术

Tight Bounds for Linkages in Planar Graphs

Published:2011 Issue: Volume: Page:110-121
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Adler Isolde,Kolliopoulos Stavros G.,Krause Philipp Klaus,Lokshtanov Daniel,Saurabh Saket,Thilikos Dimitrios

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22006-7_10

Reference23 articles.

1. Adler, I., Kolliopoulos, S.G., Thilikos, D.: Planar disjoint paths completion. Submitted for publication (2011)

2. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernet. 11(1-2), 1–21 (1993)

3. Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: LICS 2007, pp. 270–279. IEEE Computer Society, Los Alamitos (2007)

4. Dawar, A., Kreutzer, S.: Domination problems in nowhere-dense classes. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), pp. 157–168 (2009)

5. Diestel, R.: Graph Theory. Springer, Heidelberg (2005)

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL;ACM Transactions on Computation Theory;2022-12-31

2. Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths;Treewidth, Kernels, and Algorithms;2020

3. A lower bound on the tree-width of graphs with irrelevant vertices;Journal of Combinatorial Theory, Series B;2019-07

4. Modification to Planarity is Fixed Parameter Tractable;2019

5. Explicit bounds for graph minors;Journal of Combinatorial Theory, Series B;2018-09