We show that the NP-complete Feedback Vertex Set problem, which asks for the smallest set of vertices to remove from a graph to destroy all cycles, is deterministically solvable in O(c^[email protected]?m) time.Expand

This work gives various novel algorithmic improvements for color-coding, both from a worst-case perspective as well as under practical considerations.Expand

In the network querying problem, one is given a protein complex or pathway of species A and a protein interaction network of species B; the goal is to identify subnetworks of B that are similar to the query in terms of sequence, topology, or both.Expand

We examine exact algorithms for the NP-complete Graph Bipartization problem that asks for a minimum set of vertices to delete from a graph to make it bipartite.Expand

We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics.Expand

We initiate the first systematic study of the NP-hard CLUSTER VERTEX DELETION (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics.Expand