{
  "abstract": "A drawing of a graph is $x$-monotone if every vertical line intersects each edge of the graph at most once. We present an $O(n^5)$ time algorithm for deciding whether a simple drawing of the complete graph $K_n$ is weakly isomorphic to an $x$-monotone drawing. We note that this algorithm can also decide whether a drawing of $K_n$ is strongly isomorphic to an $x$-monotone drawing.",
  "abstract_shown": true,
  "affiliations": [
    "Graz University of Technology",
    "Universidad Autonoma de San Luis Potosi"
  ],
  "article_type": null,
  "arxiv": null,
  "author_total": 3,
  "authors": [
    {
      "affs": [
        0
      ],
      "name": "Oswin Aichholzer",
      "orcid": "0000-0002-2364-0583"
    },
    {
      "affs": [
        1
      ],
      "name": "Gelasio Salazar",
      "orcid": "0000-0002-8458-3930"
    },
    {
      "affs": [
        0
      ],
      "name": "Birgit Vogtenhumber",
      "orcid": "0000-0002-7166-4467"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/9ebaw8hc7db8m.bib",
  "cited_by": 0,
  "doi": "10.20382/jocg.v17i1a11",
  "fulltext_url": "https://jocg.org/index.php/jocg/article/view/6105",
  "id": "9ebaw8hc7db8m",
  "issns": [
    "1920-180X"
  ],
  "landing_url": "https://doi.org/10.20382/jocg.v17i1a11",
  "language": "en",
  "licence": "CC-BY",
  "licence_label": "CC BY",
  "licence_source": "journal",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "lcc",
      "QA299.6-433"
    ],
    [
      "lcc",
      "QA76.75-76.765"
    ],
    [
      "openalex",
      "1703|Advanced Graph Theory Research"
    ]
  ],
  "openalex": "W7224440947",
  "pdf_url": null,
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-29",
  "publisher": "Carleton University",
  "ris": "https://research.draconitic.com/paper/9ebaw8hc7db8m.ris",
  "sources": [
    {
      "first_seen": "2026-10-31T14:22:36Z",
      "native_id": "0603fedb05c74fc4b7e3c9818c56fb22",
      "source": "doaj",
      "url": "https://doi.org/10.20382/jocg.v17i1a11"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "lcc:QA299.6-433",
      "subfield": "general"
    }
  ],
  "title": "Deciding monotonicity of simple drawings of the complete graph",
  "title_text": "Deciding monotonicity of simple drawings of the complete graph",
  "type": "peer-reviewed",
  "updated_at": "2026-10-31T14:22:36Z",
  "url": "https://research.draconitic.com/paper/9ebaw8hc7db8m",
  "venue": "Journal of Computational Geometry",
  "versions": []
}