• Publications
  • Influence
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
TLDR
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
  • 191
  • 19
  • PDF
Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection
TLDR
This work gives various novel algorithmic improvements for color-coding, both from a worst-case perspective as well as under practical considerations. Expand
  • 85
  • 9
  • PDF
Separator-based data reduction for signed graph balancing
TLDR
Polynomial-time data reduction is a classical approach to hard graph problems. Expand
  • 42
  • 9
  • PDF
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation
TLDR
We present efficient fixed-parameter algorithms for the NP-complete edge modification problems Cluster Editing and Cluster Deletion. Expand
  • 117
  • 8
  • PDF
Topology-Free Querying of Protein Interaction Networks
TLDR
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
  • 108
  • 8
  • PDF
Algorithm Engineering for Optimal Graph Bipartization
TLDR
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
  • 75
  • 7
  • PDF
Fixed-Parameter Algorithms for Cluster Vertex Deletion
TLDR
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
  • 70
  • 5
  • PDF
Fixed-Parameter Algorithms for Cluster Vertex Deletion
TLDR
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
  • 47
  • 5
Optimal Edge Deletions for Signed Graph Balancing
TLDR
We present an exact algorithm for BALANCED SUBGRAPH based on a combination of data reduction rules and a fixed-parameter algorithm. Expand
  • 41
  • 5
  • PDF
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
TLDR
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. Expand
  • 105
  • 4
  • PDF