Some blog entries on this subject that I wrote after the publication of my master thesis:

- Two Open Problems for the Subgroup-Reduction based Dedekindian HSP Algorithm:
- Can my algorithm work for the Hamiltonian HSP i.e. over non-abelian dedekindian groups?
- Is my algorithm more efficient than the standard Dedekindian HSP?

- Regarding generalization of the subgroup reduction for simple groups, I gave some reflexion on Maximal Subgroup Reduction and HSP over Projective Linear Groups and related it to an existing algorithm by Denney, Moore and Russell.
- I conjectured that the answer to the second question is negative and proved this assertion in the cyclic case: Cyclic HSP based on Subgroup Reduction.