Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Simple alternating path problem
Discrete Mathematics
Bipartite embedding of trees in the plane
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Manhattan-Geodesic embedding of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Hi-index | 0.00 |
Let R be a set of red points and let B be a set of blue points. The point set P=R@?B is called equitable if ||B|-|R||=