Arrow Research search
Back to STOC

STOC 2020

An exponential time parameterized algorithm for planar disjoint paths

Conference Paper Session 10A: Graph Theory and Fixed-Parameter Tractability Algorithms and Complexity ยท Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
134071761741783777