On the public citation graph
Crossing minimization in linear embeddings of graphs
0 signed · 76 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1966.tb01713.xopenalex-snapshot
Topology of Thin Film RC Circuits
inferredcites →https://doi.org/10.1007/bf01744433openalex-snapshot
New lower bound techniques for VLSI
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0095-8956(79)90021-2openalex-snapshot
The book thickness of a graph
inferredcites →https://doi.org/10.1016/0196-6774(82)90032-3openalex-snapshot
The NP-completeness column: An ongoing gulde
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
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/sfcs.1981.22openalex-snapshot
New lower bound techniques for VLSI
inferredcites →https://doi.org/10.1109/tcad.1983.1270041openalex-snapshot
Minimum-Via Topological Routing
inferredcites →https://doi.org/10.1109/tcad.1984.1270074openalex-snapshot
An Unconstrained Topological Via Minimization Problem for Two-Layer Routing
inferredcites →https://doi.org/10.1137/0601025openalex-snapshot
The Complexity of Coloring Circular Arcs and Chords
inferredcites →https://doi.org/10.1137/0608002openalex-snapshot
Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
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/11604686_24openalex-snapshot
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints
inferred← citeshttps://doi.org/10.1007/11809678_53openalex-snapshot
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_49openalex-snapshot
Crossing Minimization for Symmetries
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_32openalex-snapshot
Visualization of Parallel Execution Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_18openalex-snapshot
The Constrained Crossing Minimization Problem
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_53openalex-snapshot
Book embeddings and crossing numbers
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-030-68766-3_36openalex-snapshot
The Turing Test for Graph Drawing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_22openalex-snapshot
Many-to-One Boundary Labeling with Backbones
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_30openalex-snapshot
Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-29516-9_4openalex-snapshot
1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_19openalex-snapshot
Experimental Evaluation of Book Drawing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-73007-1_24openalex-snapshot
Two Pages Graph Layout Via Recurrent Multivalued Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74695-9_84openalex-snapshot
K-Pages Graph Drawing with Multivalued Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_24openalex-snapshot
Line Crossing Minimization on Metro Maps
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_11openalex-snapshot
A Tighter Insertion-Based Approximation of the Crossing Number
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/s00224-005-1142-5openalex-snapshot
Crossing Minimization for Symmetries
inferred← citeshttps://doi.org/10.1007/s00453-023-01142-yopenalex-snapshot
Upward Book Embeddability of st-Graphs: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/s10732-006-4294-9openalex-snapshot
An analysis of some linear graph layout heuristics
inferred← citeshttps://doi.org/10.1007/s10732-006-9000-4openalex-snapshot
Genetic algorithms for the 2-page book drawing problem of graphs
inferred← citeshttps://doi.org/10.1007/s10878-016-0030-zopenalex-snapshot
A tighter insertion-based approximation of the crossing number
inferred← citeshttps://doi.org/10.1007/s12293-013-0115-5openalex-snapshot
$$K$$ -page crossing number minimization problem: An evaluation of heuristics and its solution using GESAKP
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferred← citeshttps://doi.org/10.1016/b978-0-12-809633-8.20430-5openalex-snapshot
Visualization of Biomedical Networks
inferred← citeshttps://doi.org/10.1016/b978-0-323-95502-7.00183-4openalex-snapshot
Visualization of Biomedical Networks
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.009openalex-snapshot
Approximating the fixed linear crossing number
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.05.006openalex-snapshot
A branch-and-cut approach to the crossing number problem
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.07.009openalex-snapshot
1 -page and 2 -page drawings with bounded number of crossings per edge
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.088openalex-snapshot
Crossing Minimisation Heuristics for 2-page Drawings
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.1016/j.jpdc.2006.08.002openalex-snapshot
Parallelisation of genetic algorithms for the 2-page crossing number problem
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.106352openalex-snapshot
An efficient metaheuristic for the K -page crossing number minimization problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00314-6openalex-snapshot
Algorithms for the fixed linear crossing number problem
inferred← citeshttps://doi.org/10.1080/00207160802524747openalex-snapshot
One- and two-page crossing numbers for some types of graphs
inferred← citeshttps://doi.org/10.1109/cec.2008.4630933openalex-snapshot
An evolutionary algorithm for the 2-page crossing number problem
inferred← citeshttps://doi.org/10.1109/pacificvis.2018.00010openalex-snapshot
Optimal Algorithms for Compact Linear Layouts
inferred← citeshttps://doi.org/10.1109/tcsii.2008.922373openalex-snapshot
Hopfield Neural Network Based on Estimation of Distribution for Two-Page Crossing Number Problem
inferred← citeshttps://doi.org/10.1109/tnn.2006.881486openalex-snapshot
An Improved Neural Network Model for the Two-Page Crossing Number Problem
inferred← citeshttps://doi.org/10.1111/cgf.13729openalex-snapshot
External Labeling Techniques: A Taxonomy and Survey
inferred← citeshttps://doi.org/10.1137/110852206openalex-snapshot
Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/120886777openalex-snapshot
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs
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.1155/1999/59138openalex-snapshot
An ILP Formulation for Minimizing the Numberof Feedthrough Cells in a Standard Cell Placement
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.1177/1473871620972339openalex-snapshot
Stable visualization of connected components in dynamic graphs
inferred← citeshttps://doi.org/10.1515/comp-2015-0004openalex-snapshot
Various heuristic algorithms to minimise the two-page crossing numbers of graphs
inferred← citeshttps://doi.org/10.20382/jocg.v10i2a4openalex-snapshot
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts
inferred← citeshttps://doi.org/10.2200/s01115ed1v01y202107vis014openalex-snapshot
External Labeling: Fundamental Concepts and Algorithmic Techniques
inferred← citeshttps://doi.org/10.26583/npe.2018.2.14openalex-snapshot
Verification of applied programs generation and loading for safety systems of nuclear power plants based on a reverse-engineering method
inferred← citeshttps://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.1308.5741openalex-snapshot
Fixed parameter tractability of crossing minimization of almost-trees
inferred← citeshttps://doi.org/10.48550/arxiv.1308.6801openalex-snapshot
Many-to-One Boundary Labeling with Backbones
inferred← citeshttps://doi.org/10.48550/arxiv.1708.09221openalex-snapshot
Experimental Evaluation of Book Drawing Algorithms
inferred← citeshttps://doi.org/10.7155/jgaa.00032openalex-snapshot
Planarizing Graphs - A Survey and Annotated Bibliography
inferred← citeshttps://doi.org/10.7155/jgaa.00199openalex-snapshot
On Metro-Line Crossing Minimization
inferred← citeshttps://doi.org/10.7155/jgaa.00267openalex-snapshot
How to Visualize the K-root Name Server
inferred← citeshttps://doi.org/10.7155/jgaa.00296openalex-snapshot
Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme
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.