The following pages link to Algorithms – ESA 2005 (Q5475886):
Displaying 11 items.
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Extending common intervals searching from permutations to sequences (Q473211) (← links)
- Common intervals of multiple permutations (Q534763) (← links)
- New algorithms for text fingerprinting (Q935841) (← links)
- A more efficient algorithm for perfect sorting by reversals (Q963340) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- Some families of trees arising in permutation analysis (Q2185210) (← links)
- Competitive graph searches (Q2481952) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
