Aaron Williams

Proceedings of the WALCOM: Algorithms and Computation, 2024

Generating Signed Permutations by Twisting Two-Sided Ribbons.

[BibT_eX]

[DOI]

Yuan Qiu

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

Constructing the first (and coolest) fixed-content universal cycle.

[BibT_eX]

[DOI]

Algorithmica, June, 2023

Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality.

[BibT_eX]

[DOI]

Algorithmica, March, 2023

Constant Time and Space Updates for the Sigma-Tau Problem.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2023

Cordial Forests.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Flip-swap languages in binary reflected Gray code order.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

A Shift Gray Code for Fixed-Content Łukasiewicz Words.

[BibT_eX]

[DOI]

Paul W. Lapey

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Pop & Push: Ordered Tree Iteration in 𝒪(1)-Time.

[BibT_eX]

[DOI]

Paul W. Lapey

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges.

[BibT_eX]

[DOI]

Arturo I. Merino

Torsten Mütze

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Rolling Polyhedra on Tessellations.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Entropy Lost: Nintendo's Not-So-Random Sequence of 32, 767 Bits.

[BibT_eX]

[DOI]

Trang Ngo

Proceedings of the FDG '22: Proceedings of the 17th International Conference on the Foundations of Digital Games, 2022

2021

A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

A Hamilton Cycle in the k-Sided Pancake Network.

[BibT_eX]

[DOI]

Ben Cameron

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2020

A Successor Rule Framework for Constructing k-Ary de Bruijn Sequences and Universal Cycles.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Solving the Sigma-Tau Problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

2018

Constructing de Bruijn sequences with co-lexicographic order: The k-ary Grandmama sequence.

[BibT_eX]

[DOI]

Patrick Baxter Dragon

Eur. J. Comb., 2018

A framework for constructing de Bruijn sequences via simple successor rules.

[BibT_eX]

[DOI]

Discret. Math., 2018

A Hamilton Path for the Sigma-Tau Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Necklaces and Lyndon words in colexicographic and binary reflected Gray code order.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2017

Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2017

A simple shift rule for k-ary de Bruijn sequences.

[BibT_eX]

[DOI]

Discret. Math., 2017

2016

Successor rules for flipping pancakes and burnt pancakes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

A surprisingly simple de Bruijn sequence construction.

[BibT_eX]

[DOI]

Discret. Math., 2016

Greedy flipping of pancakes and burnt pancakes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Generalizing the Classic Greedy and Necklace Constructions of de Bruijn Sequences and Universal Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

The Grandmama de Bruijn Sequence for Binary Strings.

[BibT_eX]

[DOI]

Patrick Baxter Dragon

Oscar I. Hernandez

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2014

The Coolest Way to Generate Binary Strings.

[BibT_eX]

[DOI]

Brett Stevens

Theory Comput. Syst., 2014

The lexicographically smallest universal cycle for binary strings with minimum specified weight.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

2013

A Gray code for fixed-density necklaces and Lyndon words in constant amortized time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Greedy Pancake Flipping.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Universal Cycles for Weight-Range Binary Strings.

[BibT_eX]

[DOI]

Dennis Chi-Him Wong

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

De Bruijn Sequences for Fixed-Weight Binary Strings.

[BibT_eX]

[DOI]

Frank Ruskey

SIAM J. Discret. Math., 2012

Binary bubble languages and cool-lex order.

[BibT_eX]

[DOI]

Frank Ruskey

J. Comb. Theory A, 2012

Efficient Oracles for Generating Binary Bubble Languages.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Shorthand Universal Cycles for Permutations.

[BibT_eX]

[DOI]

Alexander E. Holroyd

Frank Ruskey

Algorithmica, 2012

2011

De Bruijn Sequences for the Binary Strings with Maximum Density.

[BibT_eX]

[DOI]

Brett Stevens

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Hamilton Cycles in Restricted Rotator Graphs.

[BibT_eX]

[DOI]

Brett Stevens

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2009

Shift gray codes.

[BibT_eX]

[DOI]

Aaron Michael Williams

PhD thesis, 2009

2006

Packing Dicycle Covers in Planar Graphs with No K5-e Minor.

[BibT_eX]

[DOI]

Orlando Lee