A better approximation algorithm for finding planar subgraphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Experiments on exact crossing minimization using column generation
Journal of Experimental Algorithmics (JEA)
Algorithms and theory of computation handbook
A linear time algorithm for finding a maximal planar subgraph based on PC-trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A branch-and-cut approach to the crossing number problem
Discrete Optimization
Hi-index | 0.00 |