{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreibv4y6hqqd2yysgfst2wk7ipo7s6uyld3csml2qawghzblq4xebrq",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mluiyl73klw2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2605.14834v1",
  "publishedAt": "2026-05-15T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Yuto Okada"
  ],
  "textContent": "**Authors:** Yuto Okada\n\nIn this paper, we show that it is NP-hard to determine whether a given graph admits a min-1-planar drawing. A drawing of a graph is min-$k$-planar if, for every crossing in the drawing, at least one of the two crossing edges involves at most $k$ crossings. This notion of min-$k$-planarity was introduced by Binucci, Büngener, Di Battista, Didimo, Dujmović, Hong, Kaufmann, Liotta, Morin, and Tappini [GD 2023; JGAA, 2024] as a generalization of $k$-planarity.",
  "title": "Min-1-Planarity is NP-Hard"
}