Pith. sign in

Title resolution pending

doi:10 · 2018 · Information Processing Letters · DOI 10.1016/j.ipl.2018.04.012

1 Pith paper cite this work, alongside 10 external citations. Polarity classification is still indexing.

1 Pith paper citing it
10 external citations · OpenAlex
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Structural Parameterizations of $k$-Planarity

cs.DS · 2025-06-12 · conditional · novelty 7.0

k-Planarity Testing stays NP-hard and hard to approximate on graphs with tiny feedback vertex sets, while becoming fixed-parameter tractable and kernelizable under vertex cover or treedepth parameters.

citing papers explorer

Showing 1 of 1 citing paper.

  • Structural Parameterizations of $k$-Planarity cs.DS · 2025-06-12 · conditional · none · ref 20

    k-Planarity Testing stays NP-hard and hard to approximate on graphs with tiny feedback vertex sets, while becoming fixed-parameter tractable and kernelizable under vertex cover or treedepth parameters.