Algorithms for parallel k-vertex connectivity and sparse certificates
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Proceedings of the 30th IEEE symposium on Foundations of computer science
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Graph connectivity, partial words, and a theorem of Fine and Wilf
Information and Computation
Yet another optimal algorithm for 3-edge-connectivity
Journal of Discrete Algorithms
Fast computation of small cuts via cycle space sampling
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |