Title resolution pending

doi:10 · 2007 · DOI 10.1007/978-3-540-70904-6

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it

open at publisher browse 2 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.

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.

Counting symmetric unimodular triangulations

math.CO · 2026-05-13 · unverdicted · novelty 5.0

Bounds and enumerations for symmetric unimodular triangulations of dilated triangles are provided.

citing papers explorer

Showing 2 of 2 citing papers.

Min-1-Planarity is NP-Hard cs.CG · 2026-05-14 · unverdicted · none · ref 13 · 2 links
Proves NP-hardness of recognizing min-1-planar graphs.
Counting symmetric unimodular triangulations math.CO · 2026-05-13 · unverdicted · none · ref 6
Bounds and enumerations for symmetric unimodular triangulations of dilated triangles are provided.

Title resolution pending

fields

years

verdicts

representative citing papers

citing papers explorer