On generating all maximal independent sets
Information Processing Letters
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Efficient algorithms for listing unlabeled graphs
Journal of Algorithms
Sparse sets in NP-P: Exptime versus nexptime
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Automated generation of conjectures on forbidden subgraph characterization
Discrete Applied Mathematics
| Hi-index | 0.01 |