Login / Signup

Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number.

Boris KlemzMarie Diana Sieper
Published in: ICALP (2024)
Keyphrases
  • vertex cover
  • upper bound
  • partial order
  • approximation algorithms
  • space complexity