Optimal node-degree bounds for the complexity of nonplanarity parameters
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of the approximation of nonplanarity parameters for cubic graphs
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Heuristics for the Maximum Outerplanar Subgraph Problem
Journal of Heuristics
Large planar subgraphs in dense graphs
Journal of Combinatorial Theory Series B
On maximum planar induced subgraphs
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Experiments on exact crossing minimization using column generation
Journal of Experimental Algorithmics (JEA)
Algebraic algorithms for linear matroid parity problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Planarization and acyclic colorings of subcubic claw-free graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
A branch-and-cut approach to the crossing number problem
Discrete Optimization
| Hi-index | 0.00 |