On the public citation graph

Exact and heuristic algorithms for 2-layer straightline crossing minimization

https://doi.org/10.1007/bfb0021817
0 signed · 57 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.1007/bf01187020openalex-snapshot
Edge crossings in drawings of bipartite graphs
inferredcites →https://doi.org/10.1007/bf01582010openalex-snapshot
Facets of the linear ordering polytope
inferredcites →https://doi.org/10.1007/bf02932410openalex-snapshot
Optimal triangulation of large real world input-output matrices
inferredcites →https://doi.org/10.1109/tsmc.1977.4309760openalex-snapshot
Crossing Theory and Hierarchy Mapping
inferredcites →https://doi.org/10.1109/tsmc.1981.4308636openalex-snapshot
Methods for Visual Understanding of Hierarchical System Structures
inferredcites →https://doi.org/10.1137/0604033openalex-snapshot
Crossing Number is NP-Complete
inferredcites →https://doi.org/10.1287/opre.32.6.1195openalex-snapshot
A Cutting Plane Algorithm for the Linear Ordering Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-36151-0_26openalex-snapshot
Applying Crossing Reduction Strategies to Layered Compound Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_5openalex-snapshot
An Experimental Comparison of Orthogonal Compaction Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_21openalex-snapshot
The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_23openalex-snapshot
On 3-Layer Crossings and Pseudo Arrangements
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_9openalex-snapshot
Two-Layer Planarization in Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_39openalex-snapshot
Drawing directed acyclic graphs: An experimental study
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_57openalex-snapshot
An alternative method to crossing minimization on hierarchical graphs
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_66openalex-snapshot
Nice drawings for planar bipartite graphs
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_48openalex-snapshot
On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_72openalex-snapshot
Computing orthogonal drawings with the minimum number of bends
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_48openalex-snapshot
Bipartite crossing numbers of meshes and hypercubes
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_22openalex-snapshot
A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-60831-5_10openalex-snapshot
Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen
inferred← citeshttps://doi.org/10.1007/s002870050066openalex-snapshot
Algorithmen zum automatischen Zeichnen von Graphen
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50022-xopenalex-snapshot
Graph Drawing**Work supported in part by the National Science Foundation under grant CCR-9732327, and by the U.S. Army Research Office under grant DAAH04-96-1-0013.
inferred← citeshttps://doi.org/10.1016/j.jda.2005.06.001openalex-snapshot
Crossing-constrained hierarchical drawings
inferred← citeshttps://doi.org/10.1016/j.jda.2008.08.003openalex-snapshot
Crossing minimization in weighted bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.jvlc.2013.11.005openalex-snapshot
Drawing layered graphs with port constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.02.033openalex-snapshot
Algorithms for multi-level graph planarity testing and layout
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115424openalex-snapshot
Quantum algorithms for one-sided crossing minimization
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00397-9openalex-snapshot
Heuristics and meta-heuristics for 2-layer straight line crossing minimization
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00270-9openalex-snapshot
Graph layout for applications in compiler construction
inferred← citeshttps://doi.org/10.1016/s0305-0548(00)00040-xopenalex-snapshot
Incremental bipartite drawing problem
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00005-3openalex-snapshot
An experimental comparison of four graph drawing algorithms
inferred← citeshttps://doi.org/10.1109/geoinformatics.2009.5293552openalex-snapshot
Quantitative visualizations of hierarchically organized data in a geographic context
inferred← citeshttps://doi.org/10.1109/infvis.2005.1532130openalex-snapshot
Dig-CoLa: directed graph layout through constrained energy minimization
inferred← citeshttps://doi.org/10.1109/pacificvis53943.2022.00015openalex-snapshot
UNICON: A UNIform CONstraint Based Graph Layout Framework
inferred← citeshttps://doi.org/10.1109/tencon.2002.1182612openalex-snapshot
An efficient parallel algorithm for two-layer planarization in graph drawing
inferred← citeshttps://doi.org/10.1109/tvcg.2004.1260757openalex-snapshot
Combining hierarchy and energy for drawing directed graphs
inferred← citeshttps://doi.org/10.1109/tvcg.2006.67openalex-snapshot
Drawing directed graphs using quadratic programming
inferred← citeshttps://doi.org/10.1109/tvcg.2017.2744878openalex-snapshot
Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow
inferred← citeshttps://doi.org/10.1109/tvcg.2017.2745919openalex-snapshot
Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization
inferred← citeshttps://doi.org/10.1109/tvcg.2018.2864911openalex-snapshot
Structure-aware Fisheye Views for Efficient Large Graph Exploration
inferred← citeshttps://doi.org/10.1109/tvcg.2021.3114756openalex-snapshot
STRATISFIMAL LAYOUT: A modular optimization model for laying out layered node-link network visualizations
inferred← citeshttps://doi.org/10.1109/tvcg.2024.3456349openalex-snapshot
Evaluating and Extending Speedup Techniques for Optimal Crossing Minimization in Layered Graph Drawings
inferred← citeshttps://doi.org/10.1109/wpc.1999.777735openalex-snapshot
Improving the visibility of graphical program displays: an experimental study
inferred← citeshttps://doi.org/10.1111/cgf.15073openalex-snapshot
Evaluating Graph Layout Algorithms: A Systematic Review of Methods and Best Practices
inferred← citeshttps://doi.org/10.1111/cgf.70139openalex-snapshot
Optimizing Staircase Motifs in Biofabric Network Layouts
inferred← citeshttps://doi.org/10.1111/poms.13441openalex-snapshot
Crossing Minimal Edge‐Constrained Layout Planning using Benders Decomposition
inferred← citeshttps://doi.org/10.1145/230514.571643openalex-snapshot
Technical Report Column
inferred← citeshttps://doi.org/10.1145/306363.306406openalex-snapshot
Improving bipartite graphs using multi-strategy simulated annealing
inferred← citeshttps://doi.org/10.1541/ieejeiss.125.471openalex-snapshot
An Efficient Neural Algorithm for Two-layer Planarization Problem in Graph Drawing
inferred← citeshttps://doi.org/10.17760/d20486922openalex-snapshot
Layered graphs and their layouts, evaluations, and applications
inferred← citeshttps://doi.org/10.2312/vcbm/vcbm08/135-142openalex-snapshot
Visual Analysis of Bipartite Biological Networks
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.31219/osf.io/abz8eopenalex-snapshot
Evaluating and extending speedup techniques for optimal crossing minimization in layered graph drawings
inferred← citeshttps://doi.org/10.31219/osf.io/abz8e_v1openalex-snapshot
Evaluating and extending speedup techniques for optimal crossing minimization in layered graph drawings
inferred← citeshttps://doi.org/10.31219/osf.io/ms27ropenalex-snapshot
Evaluating Graph Layout Algorithms: A Systematic Review of Methods and Best Practices
inferred← citeshttps://doi.org/10.48550/arxiv.0810.4431openalex-snapshot
An Eye Tracking Study into the Effects of Graph Layout
inferred← citeshttps://doi.org/10.54337/jovi.v1i1.11236openalex-snapshot
GLaDOS: Graph Layout algorithm Datasets for Open Science
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.