On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations