Irrelevant vertices for the planar Disjoint Paths Problem-Reference-Cited by-同舟云学术

Irrelevant vertices for the planar Disjoint Paths Problem

Author:

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

Funder

European Social Fund

Greek national funds

German Academic Exchange Service

DFG

ERC

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference28 articles.

1. Faster parameterized algorithms for minor containment;Adler,2010

2. Tight bounds for linkages in planar graphs;Adler,2011

3. Planar disjoint-paths completion;Adler;Algorithmica,2015

5. The planar directed k-vertex-disjoint paths problem is fixed-parameter tractable;Cygan,2013

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

1. Dynamic treewidth;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Planar Disjoint Paths, Treewidth, and Kernels;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Combing a Linkage in an Annulus;SIAM Journal on Discrete Mathematics;2023-10-13