An exponential time parameterized algorithm for planar disjoint paths-Reference-Cited by-同舟云学术

An exponential time parameterized algorithm for planar disjoint paths

Published:2020-06-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Lokshtanov Daniel¹,Misra Pranabendu²,Pilipczuk Michał³,Saurabh Saket⁴,Zehavi Meirav⁵

Affiliation:

1. University of California at Santa Barbara, USA

2. MPI-INF, Germany

3. University of Warsaw, Poland

4. IMSc, India

5. Ben-Gurion University of the Negev, Israel

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3357713.3384250

Reference48 articles.

1. Irrelevant vertices for the planar Disjoint Paths Problem. J. Comb. Theory;Adler Isolde;Ser. B,2017

2. Isolde Adler and Philipp Klaus Krause. 2010. A lower bound for the tree-width of planar graphs with vital linkages. CoRR abs/1011.2136 (2010). arXiv: 1011.2136 http://arxiv.org/abs/1011.2136 Isolde Adler and Philipp Klaus Krause. 2010. A lower bound for the tree-width of planar graphs with vital linkages. CoRR abs/1011.2136 (2010). arXiv: 1011.2136 http://arxiv.org/abs/1011.2136

3. The role of planarity in connectivity problems parameterized by treewidth

4. org/10.1016/j.tcs.2014.12.010 10.1016/j.tcs.2014.12.010 org/10.1016/j.tcs.2014.12.010 10.1016/j.tcs.2014.12.010

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

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

2. A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs;SIAM Journal on Discrete Mathematics;2023-05-10

3. Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs;Computer Science – Theory and Applications;2022

4. A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

5. Exploiting Dense Structures in Parameterized Complexity;LEIBNIZ INT PR INFOR;2021