A loopless algorithm for generating the permutations of a multiset
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Discrete Applied Mathematics
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Genetic algorithms based approach to database vertical partition
Journal of Intelligent Information Systems
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
Journal of Discrete Algorithms
Combinatorial Gray codes for classes of pattern avoiding permutations
Theoretical Computer Science
Generating balanced parentheses and binary trees by prefix shifts
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
The rotation graph of k-ary trees is Hamiltonian
Information Processing Letters
Constant Time Generation of Integer Partitions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Generating gray codes in o(1) worst-case time per word
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Generating combinations by prefix shifts
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Constant time generation of linear extensions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The rand and block distances of pairs of set partitions
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Counting and computing the Rand and block distances of pairs of set partitions
Journal of Discrete Algorithms
Optimizing decomposition of software architecture for local recovery
Software Quality Control
Efficient generation of restricted growth words
Information Processing Letters
| Hi-index | 0.00 |