Pith. sign in

Title resolution pending

Walter Didimo, Giuseppe Liotta, Maurizio Patrignani · 2019 · Journal of Computer and System Sciences · DOI 10.1016/j.jcss.2018.08.003

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

1 Pith paper citing it
19 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

2026 1

verdicts

ACCEPT 1

representative citing papers

The Parameterized Complexity of Problems on Outer k-Planar Graphs

cs.DS · 2026-07-29 · accept · novelty 7.0

On outer k-planar graphs with a given drawing, most XALP-hard treewidth problems become FPT in k, while Binary CSP and Scattered Set remain XALP-complete, and outer k-planarity is placed in the parameter hierarchy.

citing papers explorer

Showing 1 of 1 citing paper.

  • The Parameterized Complexity of Problems on Outer k-Planar Graphs cs.DS · 2026-07-29 · accept · none · ref 28

    On outer k-planar graphs with a given drawing, most XALP-hard treewidth problems become FPT in k, while Binary CSP and Scattered Set remain XALP-complete, and outer k-planarity is placed in the parameter hierarchy.