Alpha-algorithms for incremental planarity testing (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An analysis of some heuristics for the maximum planar subgraph problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A better approximation algorithm for finding planar subgraphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Mathematical Software (TOMS)
Automatic layout of UML class diagrams in orthogonal style
Information Visualization - Special issue: Software visualization
A simulated annealing algorithm for determining the thickness of a graph
Information Sciences—Informatics and Computer Science: An International Journal
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
Information Processing Letters
A simulated annealing algorithm for determining the thickness of a graph
Information Sciences: an International Journal
Metamodel matching based on planar graph edit distance
ICMT'10 Proceedings of the Third international conference on Theory and practice of model transformations
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
An effective ant colony algorithm for graph planarization problem
ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
A branch-and-cut approach to the crossing number problem
Discrete Optimization
Hi-index | 0.00 |