Four pages are necessary and sufficient for planar graphs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Efficient parallel algorithms for edge coloring problems
Journal of Algorithms
Embedding graphs in books: a layout problem with applications to VLSI design
SIAM Journal on Algebraic and Discrete Methods
Edge-packing of graphs and network reliability
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Algorithms for edge coloring bipartite graphs
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the completeness of a generalized matching problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |