pith. sign in

Title resolution pending

Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou · 2025 · Algorithmica · DOI 10.1007/s00453-005-1184-8

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

1 Pith paper citing it
21 external citations · Crossref
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.CG 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Min-1-Planarity is NP-Hard

cs.CG · 2026-05-14 · unverdicted · novelty 6.0 · 2 refs

Proves NP-hardness of recognizing min-1-planar graphs.

citing papers explorer

Showing 1 of 1 citing paper.

  • Min-1-Planarity is NP-Hard cs.CG · 2026-05-14 · unverdicted · none · ref 6 · 2 links

    Proves NP-hardness of recognizing min-1-planar graphs.