scientific article; zbMATH DE number 7561324
From MaRDI portal
Publication:5090955
DOI10.4230/LIPIcs.FSTTCS.2018.19MaRDI QIDQ5090955
Anish Mukherjee, Raghav Kulkarni, Samir Datta, Siddharth Iyer
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1802.01338
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On shortest disjoint paths in planar graphs
- Graph minors. VI. Disjoint paths across a disc
- Matching is as easy as matrix inversion
- Graph minors. VII: Disjoint paths on a surface
- The directed subgraph homeomorphism problem
- The disjoint shortest paths problem
- Resolution of Hartmanis' conjecture for NL-hard sparse sets
- Length-bounded disjoint paths in planar graphs
- Graphs of non-crossing perfect matchings
- The complexity of planarity testing
- Graph minors. XIII: The disjoint paths problem
- On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
- On the complexity of the disjoint paths problem
- Planarity Testing Revisited
- Shortest vertex-disjoint two-face paths in planar graphs
- Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs
- On the Computational Complexity of Combinatorial Problems
- Fast Parallel Matrix Inversion Algorithms
- Finding k Disjoint Paths in a Directed Planar Graph
- New hardness results for routing on disjoint paths
- Shortest Two Disjoint Paths in Polynomial Time
- Almost polynomial hardness of node-disjoint paths in grids
- Improved approximation for node-disjoint paths in planar graphs
This page was built for publication:
