Mutual exclusion scheduling with interval graphs or related classes, Part I
Discrete Applied Mathematics
Computing maximum non-crossing matching in convex bipartite graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Hi-index | 0.89 |