An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
On the one-sided crossing minimization in a bipartite graph with large degrees
Theoretical Computer Science
Fixed parameter algorithms for one-sided crossing minimization revisited
Journal of Discrete Algorithms
Crossing minimization in weighted bipartite graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A new exact algorithm for the two-sided crossing minimization problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
k-level crossing minimization is NP-hard for trees
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Ranking and drawing in subexponential time
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
Journal of Combinatorial Optimization
GD'05 Proceedings of the 13th international conference on Graph Drawing
Comparing and aggregating partial orders with kendall tau distances
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Journal of Experimental Algorithmics (JEA)
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Crossing-constrained hierarchical drawings
Journal of Discrete Algorithms
Hi-index | 0.00 |