On the public citation graph

Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem

0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/3527603794.ch4openalex-snapshot
Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch‐and‐Cut
inferredcites →https://doi.org/10.1007/3-540-16766-8_9openalex-snapshot
Diogenes, circa 1986 Ψαχνω για ενα τιμιo ανϑρoπo
inferredcites →https://doi.org/10.1007/978-94-015-9634-3_24openalex-snapshot
Forbidden Subsequences and Permutations Sortable on Two Parallel Stacks
inferredcites →https://doi.org/10.1016/0022-0000(89)90036-6openalex-snapshot
On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape turing machines
inferredcites →https://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferredcites →https://doi.org/10.1016/s0166-218x(01)00314-6openalex-snapshot
Algorithms for the fixed linear crossing number problem
inferredcites →https://doi.org/10.1016/s0927-0507(05)12008-8openalex-snapshot
Semidefinite Programming and Integer Programming
inferredcites →https://doi.org/10.1049/piee.1968.0004openalex-snapshot
Permutation procedure for minimising the number of crossings in a network
inferredcites →https://doi.org/10.1109/12.46286openalex-snapshot
Crossing minimization in linear embeddings of graphs
inferredcites →https://doi.org/10.1137/0604033openalex-snapshot
Crossing Number is NP-Complete
inferredcites →https://doi.org/10.1137/s0097539799364092openalex-snapshot
Succinct Representation of Balanced Parentheses and Static Trees
inferredcites →https://doi.org/10.1145/12130.12135openalex-snapshot
On nontrivial separators for k -page graphs and simulations by nondeterministic one-tape Turing machines
inferredcites →https://doi.org/10.1145/318951.319049openalex-snapshot
CNMGRAF—graphic presentation services for network management

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.21910openalex-snapshot
The Same Upper Bound for Both: The 2‐page and the Rectilinear Crossing Numbers of the n‐Cube
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_38openalex-snapshot
Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_33openalex-snapshot
The Crossing Number of the Cone of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_22openalex-snapshot
The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube
inferred← citeshttps://doi.org/10.1007/s00454-013-9514-0openalex-snapshot
The 2-Page Crossing Number of $$K_{n}$$ K n
inferred← citeshttps://doi.org/10.1016/j.dam.2013.11.001openalex-snapshot
Book drawings of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.039openalex-snapshot
Complexity-separating graph classes for vertex, edge and total colouring
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.021openalex-snapshot
Revising Johnson’s table for the 21st century
inferred← citeshttps://doi.org/10.1016/j.endm.2016.10.040openalex-snapshot
The Complexity of SIMPLE MAX-CUT on Comparability Graphs
inferred← citeshttps://doi.org/10.1109/tst.2014.6867519openalex-snapshot
Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems
inferred← citeshttps://doi.org/10.1137/120886777openalex-snapshot
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs
inferred← citeshttps://doi.org/10.1137/17m1115320openalex-snapshot
The Crossing Number of the Cone of a Graph
inferred← citeshttps://doi.org/10.1142/s0129054123500168openalex-snapshot
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge
inferred← citeshttps://doi.org/10.1145/2261250.2261310openalex-snapshot
The 2-page crossing number of K n
inferred← citeshttps://doi.org/10.1155/2017/7640347openalex-snapshot
Bound for the 2-Page Fixed Linear Crossing Number of Hypercube Graph via SDP Relaxation
inferred← citeshttps://doi.org/10.11606/d.45.2016.tde-27012016-090223openalex-snapshot
Problemas computacionais em teoria topológica dos grafos
inferred← citeshttps://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.1206.5669openalex-snapshot
The 2-page crossing number of $K_n$
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.