The following pages link to Joe Sawada (Q299049):
Displaying 27 items.
- Greedy flipping of pancakes and burnt pancakes (Q299051) (← links)
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- Stamp foldings, semi-meanders, and open meanders: fast generation algorithms (Q456294) (← links)
- A surprisingly simple de Bruijn sequence construction (Q501039) (← links)
- Binary bubble languages and cool-lex order (Q645969) (← links)
- A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
- On prefix normal words and prefix normal forms (Q729994) (← links)
- Efficient universal cycle constructions for weak orders (Q785821) (← links)
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (Q831869) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- Gray codes for reflectable languages (Q976101) (← links)
- A fast algorithm to generate necklaces with fixed content (Q1400003) (← links)
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence (Q1645055) (← links)
- Constructing de Bruijn sequences by concatenating smaller universal cycles (Q1659978) (← links)
- A de Bruijn sequence construction by concatenating cycles of the complemented cycling register (Q1678337) (← links)
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order (Q1679610) (← links)
- A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
- Bent Hamilton cycles in \(d\)-dimensional grid graphs (Q1856346) (← links)
- Finding and listing induced paths and cycles (Q1941391) (← links)
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word (Q2006779) (← links)
- Gray codes and symmetric chains (Q2072179) (← links)
- Investigating the discrepancy property of de Bruijn sequences (Q2075526) (← links)
- A Hamilton cycle in the \(k\)-sided pancake network (Q2115848) (← links)
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order (Q2140470) (← links)
- (Q5002744) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
- Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs (Q6180578) (← links)
