On finding minimal 2-connected subgraphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Computing minimal spanning subgraphs in linear time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Approximating the minimum equivalent digraph
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Managing RBAC states with transitive relations
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
The minimum spanning strong subdigraph problem is fixed parameter tractable
Discrete Applied Mathematics
| Hi-index | 0.00 |