Maximum k-chains in planar point sets: combinatorial structure and algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Maximum independent sets on transitive graphs and their applications in testing and CAD
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Discrete Applied Mathematics
The maximum vertex coverage problem on bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |