Finding minimum-quotient cuts in planar graphs
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Optimal Partitioning of Heterogeneous Traffic Sources in Mobile Communications Networks
IEEE Transactions on Computers - Special issue on mobile computing
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning
IEEE Transactions on Computers
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Throughput-driven synthesis of embedded software for pipelined execution on multicore architectures
ACM Transactions on Embedded Computing Systems (TECS)
Simple cuts are fast and good: optimum right-angled cuts in solid grids
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
| Hi-index | 0.01 |