Discrete Mathematics - Kleitman and combinatorics: a celebration
Generating binary trees by Glivenko classes on Tamari lattices
Information Processing Letters
An O(1) Time Algorithm for Generating Multiset Permutations
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Maximum number of edges joining vertices on a cube
Information Processing Letters
A loopless algorithm for generating the permutations of a multiset
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Selection conditions in main memory
ACM Transactions on Database Systems (TODS)
Visualisation of satisfiability using the logic engine
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Test Sequence Construction Using Minimum Information on the Tested System
Programming and Computing Software
A loopless Gray code for rooted trees
ACM Transactions on Algorithms (TALG)
Combinatorial generation by fusing loopless algorithms
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
On the (n,t)-antipodal Gray codes
Theoretical Computer Science
Note: Perfect matchings extend to Hamilton cycles in hypercubes
Journal of Combinatorial Theory Series B
Mixed-Radix Gray Codes in Lee Metric
IEEE Transactions on Computers
Combinatorial Gray codes for classes of pattern avoiding permutations
Theoretical Computer Science
Distribution of distinguishable objects to bins: generating all distributions
International Journal of Computer Mathematics
Computational Geometry: Theory and Applications
The rotation graph of k-ary trees is Hamiltonian
Information Processing Letters
Gray codes for reflectable languages
Information Processing Letters
Loopless generation of multiset permutations using a constant number of variables by prefix shifts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Generating all distributions of objects to bins
International Journal of Computer Mathematics
Enumeration aspects of maximal cliques and bicliques
Discrete Applied Mathematics
Gray codes for non-crossing partitions and dissections of a convex polygon
Discrete Applied Mathematics
Constant Time Generation of Integer Partitions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Pure Parsimony Xor Haplotyping
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Matching graphs of hypercubes and complete bipartite graphs
European Journal of Combinatorics
Finding Lean Induced Cycles in Binary Hypercubes
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Long paths and cycles in hypercubes with faulty vertices
Information Sciences: an International Journal
Disjoint Hamilton cycles in the star graph
Information Processing Letters
Rank modulation for flash memories
IEEE Transactions on Information Theory
Organizing gray code states for maximum error tolerance
MACMESE'09 Proceedings of the 11th WSEAS international conference on Mathematical and computational methods in science and engineering
Pairwise boosted audio fingerprint
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March Tests
International Journal of Applied Mathematics and Computer Science - Selected Problems of Computer Science and Control
Combinatorial algorithms for listing paths in minimal change order
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Single-track gray codes and sequences
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
Probabilistic logic learning from haplotype data
Probabilistic inductive logic programming
Optimal waveband switching in optical ring networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Pure Parsimony Xor Haplotyping
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Reordering columns for smaller indexes
Information Sciences: an International Journal
Automatically designing selection heuristics
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Amortized efficiency of generating planar paths in convex position
Theoretical Computer Science
Transformation of quantum states using uniformly controlled rotations
Quantum Information & Computation
Less haste, less waste: on recycling and its limits in strand displacement systems
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Binary bubble languages and cool-lex order
Journal of Combinatorial Theory Series A
A loopless gray code for minimal signed-binary representations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
About the enumeration algorithms of closed sets
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Constant time generation of linear extensions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Constant time generation of trees with specified diameter
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Synthetic sequence design for signal location search
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
Simulating Size-constrained Galton-Watson Trees
SIAM Journal on Computing
Linear time construction of a compressed Gray code
European Journal of Combinatorics
Regional appearance modeling based on the clustering of intensity profiles
Computer Vision and Image Understanding
Efficient generation of restricted growth words
Information Processing Letters
Combinatorial generation by fusing loopless algorithms
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Optimal Wavebanding in WDM Ring Networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.07 |
The term combinatorial Gray code was introduced in 1980 to refer to any method for generating combinatorial objects so that successive objects differ in some prespecified, small way. This notion generalizes the classical binary reflected Gray code scheme for listing n-bit binary numbers so that successive numbers differ in exactly one bit position, as well as work in the 1960s and 1970s on minimal change listings for other combinatorial families, including permutations and combinations.The area of combinatorial Gray codes was popularized by Herbert Wilf in his invited address at the SIAM Conference on Discrete Mathematics in 1988 and his subsequent SIAM monograph [Combinatorial Algorithms: An Update, 1989] in which he posed some open problems and variations on the theme. This resulted in much recent activity in the area, and most of the problems posed by Wilf are now solved.In this paper, we survey the area of combinatorial Gray codes, describe recent results, variations, and trends, and highlight some open problems.