Joe Sawada

CoRR, 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

2022

Flip-swap languages in binary reflected Gray code order.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Gray codes and symmetric chains.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2022

Investigating the discrepancy property of de Bruijn sequences.

[BibT_eX]

[DOI]

Discret. Math., 2022

Dichotomizing k-vertex-critical H-free graphs for H of order four.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Vertex-critical (P3+𝓁P1)-free and vertex-critical (gem, co-gem)-free graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Cut-Down de Bruijn Sequences.

[BibT_eX]

[DOI]

Aysu Gündogan

CoRR, 2022

Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan.

[BibT_eX]

[DOI]

Aaron Grubb

CoRR, 2022

A 50 Gbps 49 mW CMOS Analog Multiplexer for a DAC Bandwidth Tripler.

[BibT_eX]

[DOI]

Proceedings of the 2022 IEEE Radio and Wireless Symposium, 2022

2021

Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions.

[BibT_eX]

[DOI]

Abbas Alhakim

Evan Sala

Theor. Comput. Sci., 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]

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

DAC Bandwidth Tripler with 3: 1 Image-Rejection Analog Multiplexer.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE International Conference on Electronics, 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

A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph.

[BibT_eX]

[DOI]

Aaron Grubb

Proceedings of the Computing and Combinatorics - 27th 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

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Solving the Sigma-Tau Problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Efficient universal cycle constructions for weak orders.

[BibT_eX]

[DOI]

Discret. Math., 2020

Efficient constructions of the Prefer-same and Prefer-opposite de Bruijn sequences.

[BibT_eX]

[DOI]

Evan Sala

Abbas Alhakim

CoRR, 2020

2019

A Pascal-like bound for the number of necklaces with fixed density.

[BibT_eX]

[DOI]

István Heckenberger

Theor. Comput. Sci., 2019

Ranking and unranking fixed-density necklaces and Lyndon words.

[BibT_eX]

[DOI]

Patrick Hartman

Theor. Comput. Sci., 2019

2018

Constructing de Bruijn sequences by concatenating smaller universal cycles.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

On prefix normal words and prefix normal forms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Finding the largest fixed-density necklace and Lyndon word.

[BibT_eX]

[DOI]

Patrick Hartman

Inf. Process. Lett., 2017

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

[BibT_eX]

[DOI]

Discret. Math., 2017

A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 11th International Conference, 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

2015

Snakes, coils, and single-track circuit codes with spread k.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Constructions of k-critical P5-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Charm bracelets and their application to the construction of periodic Golay pairs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2014

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

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Normal, Abby Normal, Prefix Normal.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

On Combinatorial Generation of Prefix Normal Words.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Generating bracelets with fixed content.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Greedy Pancake Flipping.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

On k-critical P5-free graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Finding and listing induced paths and cycles.

[BibT_eX]

[DOI]

Discret. Appl. 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]

SIAM J. Discret. Math., 2012

Binary bubble languages and cool-lex order.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2012

Efficient Oracles for Generating Binary Bubble Languages.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms.

[BibT_eX]

[DOI]

Roy Li

Electron. J. Comb., 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

2010

A fast algorithm to generate open meandric systems and meanders.

[BibT_eX]

[DOI]

Bruce A. Bobier

ACM Trans. Algorithms, 2010

Deciding k-Colorability of P5-Free Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Algorithmica, 2010

2009

Gray codes for reflectable languages.

[BibT_eX]

[DOI]

Yue Li

Inf. Process. Lett., 2009

A certifying algorithm for 3-colorability of P5-free graphs

[BibT_eX]

[DOI]

Daniel Bruce

CoRR, 2009

A Certifying Algorithm for 3-Colorability of P5-Free Graphs.

[BibT_eX]

[DOI]

Daniel Bruce

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

A Note on k-Colorability of P5-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Magic Labelings on Cycles and Wheels.

[BibT_eX]

[DOI]

Andrew Baker

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

A Simple Gray Code to List All Minimal Signed Binary Representations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

A fast algorithm to generate Beckett-Gray codes: Extended Abstract.

[BibT_eX]

[DOI]

Dennis Chi-Him Wong

Electron. Notes Discret. Math., 2007

Deciding k-colourability of P_5-free graphs in polynomial time

[BibT_eX]

[DOI]

CoRR, 2007

2006

Generating rooted and free plane trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

k-Colorability of P5-free graphs

[BibT_eX]

[DOI]

Xiao Shu

CoRR, 2006

2005

Oracles for vertex elimination orderings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A Gray code for binary subtraction.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

A Loopless Gray Code for Minimal Signed-Binary Representations.

[BibT_eX]

[DOI]

Gurmeet Singh Manku

Proceedings of the Algorithms, 2005

2003

A fast algorithm to generate necklaces with fixed content.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Euclidean strings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Generating and characterizing the perfect elimination orderings of a chordal graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2).

[BibT_eX]

[DOI]

J. Algorithms, 2003

From a simple elimination ordering to a strong elimination ordering in linear time.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

Inf. Process. Lett., 2003

Bent Hamilton Cycles in d-Dimensional Grid Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2003

2002

A Fast Algorithm for Generating Nonisomorphic Chord Diagrams.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

2001

The Number of Irreducible Polynomials and Lyndon Words with Given Trace.

[BibT_eX]

[DOI]

C. Robert Miers

SIAM J. Discret. Math., 2001

Generating Bracelets in Constant Amortized Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

2000

Fast algorithms to generate restricted classes of strings under rotation.

[BibT_eX]

[DOI]

PhD thesis, 2000

Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2).

[BibT_eX]

[DOI]

J. Algorithms, 2000

A fast algorithm to generate unlabeled necklaces.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Generating Necklaces and Strings with Forbidden Substrings.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

An Efficient Algorithm for Generating Necklaces with Fixed Density.

[BibT_eX]

[DOI]