| Publication | Date of Publication | Type |
|---|
Cut-down de Bruijn sequences
Discrete Mathematics | 2024-11-09 | Paper |
Pivot Gray codes for the spanning trees of a graph ft. the fan
Graphs and Combinatorics | 2024-07-29 | Paper |
Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs
Discrete Applied Mathematics | 2023-12-22 | Paper |
Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
| 2023-08-23 | Paper |
Constructing the first (and coolest) fixed-content universal cycle
Algorithmica | 2023-06-05 | Paper |
A pivot Gray code listing for the spanning trees of the fan graph
| 2023-03-30 | Paper |
Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
Algorithmica | 2023-03-09 | Paper |
Flip-swap languages in binary reflected Gray code order
Theoretical Computer Science | 2022-09-27 | Paper |
Inside the binary reflected gray code: flip-swap languages in 2-gray code order
| 2022-05-20 | Paper |
Cut-Down de Bruijn Sequences
| 2022-05-05 | Paper |
Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four
Discrete Applied Mathematics | 2022-03-24 | Paper |
A Hamilton cycle in the \(k\)-sided pancake network
| 2022-03-22 | Paper |
Investigating the discrepancy property of de Bruijn sequences
Discrete Mathematics | 2022-02-14 | Paper |
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan
| 2022-02-03 | Paper |
Gray codes and symmetric chains
Journal of Combinatorial Theory. Series B | 2022-01-26 | Paper |
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph
| 2021-08-20 | Paper |
Gray codes and symmetric chains
| 2021-07-28 | Paper |
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order
| 2021-05-07 | Paper |
A Hamilton Cycle in the $k$-Sided Pancake Network
| 2021-03-16 | Paper |
Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions
Theoretical Computer Science | 2021-01-25 | Paper |
Efficient constructions of the Prefer-same and Prefer-opposite de Bruijn sequences
| 2020-10-15 | Paper |
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
Theoretical Computer Science | 2020-10-12 | Paper |
Efficient universal cycle constructions for weak orders
Discrete Mathematics | 2020-08-12 | Paper |
Dichotomizing $k$-vertex-critical $H$-free graphs for $H$ of order four
| 2020-06-30 | Paper |
A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Solving the sigma-tau problem
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Ranking and unranking fixed-density necklaces and Lyndon words
Theoretical Computer Science | 2019-09-10 | Paper |
A framework for constructing de Bruijn sequences via simple successor rules
Discrete Mathematics | 2018-09-21 | Paper |
Constructing de Bruijn sequences by concatenating smaller universal cycles
Theoretical Computer Science | 2018-08-23 | Paper |
Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
European Journal of Combinatorics | 2018-06-28 | Paper |
scientific article; zbMATH DE number 6850346 (Why is no real title available?)
| 2018-03-15 | Paper |
A de Bruijn sequence construction by concatenating cycles of the complemented cycling register
| 2017-11-15 | Paper |
Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
Journal of Discrete Algorithms | 2017-11-09 | Paper |
Finding the largest fixed-density necklace and Lyndon word
Information Processing Letters | 2017-06-13 | Paper |
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
Journal of Discrete Algorithms | 2017-05-29 | Paper |
On prefix normal words and prefix normal forms
Theoretical Computer Science | 2016-12-23 | Paper |
A simple shift rule for \(k\)-ary de Bruijn sequences
Discrete Mathematics | 2016-12-22 | Paper |
Greedy flipping of pancakes and burnt pancakes
Discrete Applied Mathematics | 2016-06-22 | Paper |
Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
The Electronic Journal of Combinatorics | 2016-02-11 | Paper |
A surprisingly simple de Bruijn sequence construction
Discrete Mathematics | 2015-10-08 | Paper |
Generating rooted and free plane trees
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Snakes, coils, and single-track circuit codes with spread \(k\)
Journal of Combinatorial Optimization | 2015-07-01 | Paper |
Charm bracelets and their application to the construction of periodic Golay pairs
Discrete Applied Mathematics | 2015-05-22 | Paper |
A fast algorithm to generate open meandric systems and meanders
ACM Transactions on Algorithms | 2014-11-18 | Paper |
The lexicographically smallest universal cycle for binary strings with minimum specified weight
Journal of Discrete Algorithms | 2014-09-05 | Paper |
On combinatorial generation of prefix normal words
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Universal Cycles for Weight-Range Binary Strings
Lecture Notes in Computer Science | 2014-01-17 | Paper |
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
Theoretical Computer Science | 2014-01-10 | Paper |
Finding and listing induced paths and cycles
Discrete Applied Mathematics | 2013-03-12 | Paper |
Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
The Electronic Journal of Combinatorics | 2012-10-24 | Paper |
De Bruijn sequences for fixed-weight binary strings
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
Efficient oracles for generating binary bubble languages
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Binary bubble languages and cool-lex order
Journal of Combinatorial Theory. Series A | 2011-11-11 | Paper |
De Bruijn sequences for the binary strings with maximum density
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Gray codes for reflectable languages
Information Processing Letters | 2010-06-16 | Paper |
Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
Algorithmica | 2010-03-04 | Paper |
A certifying algorithm for 3-colorability of \(P _{5}\)-free graphs
Algorithms and Computation | 2009-12-17 | Paper |
A Note on k-Colorability of P 5-Free Graphs
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Magic Labelings on Cycles and Wheels
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
A fast algorithm to generate Beckett-Gray codes
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
scientific article; zbMATH DE number 5158494 (Why is no real title available?)
| 2007-05-29 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
scientific article; zbMATH DE number 2061795 (Why is no real title available?)
| 2004-03-25 | Paper |
Generating Lyndon brackets.
Journal of Algorithms | 2003-08-13 | Paper |
A fast algorithm to generate necklaces with fixed content
Theoretical Computer Science | 2003-07-30 | Paper |
Bent Hamilton cycles in \(d\)-dimensional grid graphs
The Electronic Journal of Combinatorics | 2003-05-13 | Paper |
A Fast Algorithm for Generating Nonisomorphic Chord Diagrams
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
scientific article; zbMATH DE number 1696649 (Why is no real title available?)
| 2002-07-22 | Paper |
Generating bracelets in constant amortized time
SIAM Journal on Computing | 2002-04-23 | Paper |
The number of irreducible polynomials and Lyndon words with given trace
SIAM Journal on Discrete Mathematics | 2001-06-21 | Paper |
scientific article; zbMATH DE number 1445312 (Why is no real title available?)
| 2000-05-10 | Paper |
An Efficient Algorithm for Generating Necklaces with Fixed Density
SIAM Journal on Computing | 2000-03-19 | Paper |
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
Journal of Algorithms | 2000-01-01 | Paper |
scientific article; zbMATH DE number 1305469 (Why is no real title available?)
| 1999-06-17 | Paper |
Efficient Construction of Long Orientable Sequences
| N/A | Paper |
