Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The recognition of Series Parallel digraphs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Detecting cycles in dynamic graphs in polynomial time
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Study of parallelism in regular iterative algorithms
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Recognizing strong connectivity in (dynamic) periodic graphs and its relation to integer programming
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Efficient decision procedures for graph properties on context-free graph languages
Journal of the ACM (JACM)
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
Journal of the ACM (JACM)
Polynomial algorithms for minimum cost paths in periodic graphs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Reconfigurability and Reliability of Systolic/Wavefront Arrays
IEEE Transactions on Computers
| Hi-index | 0.00 |