Pages that link to "Item:Q4381060"

The following pages link to 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms (Q4381060):

Displaying 35 items.

• Semidefinite relaxations of ordering problems (Q359627) (← links)
• A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236) (← links)
• A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
• 2-layer right angle crossing drawings (Q476445) (← links)
• Curve-constrained drawings of planar graphs (Q706719) (← links)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
• A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
• Crossing minimization in extended level drawings of graphs (Q968125) (← links)
• On the complexity of crossings in permutations (Q1011761) (← links)
• Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
• Advances in the theory and practice of graph drawing (Q1285778) (← links)
• A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
• Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
• Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
• Tabu search for the dynamic bipartite drawing problem (Q1652530) (← links)
• On the one-sided crossing minimization in a bipartite graph with large degrees (Q1770400) (← links)
• New bounds on the barycenter heuristic for bipartite graph drawing. (Q1853018) (← links)
• Tabu search tutorial. A graph drawing application (Q1979170) (← links)
• Rejoinder on: ``Tabu search tutorial. A graph drawing application'' (Q1979172) (← links)
• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
• Block-insertion-based algorithms for the linear ordering problem (Q2289935) (← links)
• Tabu search for min-max edge crossing in graphs (Q2337395) (← links)
• Counting edge crossings in a 2-layered drawing (Q2390316) (← links)
• Crossing-constrained hierarchical drawings (Q2458930) (← links)
• An analysis of some linear graph layout heuristics (Q2491338) (← links)
• DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY (Q2708043) (← links)
• Bipartite Graph Representation of Multiple Decision Table Classifiers (Q3646117) (← links)
• (Q4789076) (← links)
• Computing orthogonal drawings with the minimum number of bends (Q5096950) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
• Approximation algorithms for minimizing edge crossings in radial drawings (Q5961979) (← links)
• Comments on: ``Tabu search tutorial. A graph drawing application'' (Q5970665) (← links)
• Quantum graph drawing (best student paper) (Q6575378) (← links)
• Computing hive plots: a combinatorial framework (Q6636992) (← links)