No article text was recorded for this version.
planarity-preserving reduction
Version 1 of 110 papers17 conceptsfrozen 2026-10-04
Papers in this version
- Blog: NC Algorithms for Weighted Planar Perfect Matching and Related Problems
- Blog: The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable
- Blog: Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
- Blog: Complexity of planar signed graph homomorphisms to cycles
- Blog: Maximum Flow in Directed Planar Graphs with Vertex Capacities
- Blog: Towards Better Approximation of Graph Crossing Number
- Blog: Improved Approximation for Node-Disjoint Paths in Planar Graphs
- Blog: Exact square coloring of subcubic planar graphs
- Blog: Clique-Based Separators for Geometric Intersection Graphs
- Blog: Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_planarity_preserving_reduction_f8c472bd,
title = {planarity-preserving reduction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/planarity-preserving-reduction/rdr_f8c472bd9edd4dd7909bcaced395177e},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_planarity_preserving_reduction_f8c472bd_v1,
title = {planarity-preserving reduction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/planarity-preserving-reduction/rdr_f8c472bd9edd4dd7909bcaced395177e/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}