No article text was recorded for this version.
cross-composition
Version 2 of 212 papers16 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Clique Cover and Graph Separation: New Incompressibility Results
- Blog: The Parameterized Complexity of Motion Planning for Snake-Like Robots
- Blog: Parameterized Complexity and Kernel Bounds for Hard Planning Problems
- Blog: Clique cover and graph separation: New incompressibility results
- Blog: On Cutwidth Parameterized by Vertex Cover
- Blog: Limits of Preprocessing
- Blog: A Parameterized Perspective on Uniquely Restricted Matchings
- Blog: Parameterized Complexity of Eulerian Deletion Problems
- Blog: Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
- Blog: Kernelization lower bound for Permutation Pattern Matching
- Blog: Parameterized Complexity of Firefighting Revisited
- Blog: On the Parameterized Complexity of Computing Balanced Partitions in Graphs
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_cross_composition_a2426699,
title = {cross-composition},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/cross-composition/rdr_a2426699bb0e4a29943336892b40593d},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_cross_composition_a2426699_v2,
title = {cross-composition},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/cross-composition/rdr_a2426699bb0e4a29943336892b40593d/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}