Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

We present a method for reducing the treewidth of a graph while preserving all of its minimal
st separators up to a certain fixed size k. This technique allows us to solve st Cut and …

For a connected graph G=(V, E), a subset U⊆ V is called a disconnected cut if U
disconnects the graph and the subgraph induced by U is disconnected as well. We show …

Obtaining planarity by contracting few edges Page 1 Theoretical Computer Science 476 (2013)
38–46 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science …

The Strong Exponential Time Hypothesis (SETH) asserts that for every ε> 0 there exists k
such that k-SAT requires time (2—ε) n. The field of fine-grained complexity has leveraged …

Time-evolving or temporal graphs gain more and more popularity when exploring complex
networks. In this context, the multistage view on computational problems is among the most …

Abstract The Bipartite Contraction problem is to decide, given a graph G and a parameter k,
whether we can obtain a bipartite graph from G by at most k edge contractions. The fixed …

Graph modification problems such as vertex deletion, edge deletion or edge contractions
are a fundamental class of optimization problems. Recently, the parameterized complexity of …

We study some well-known graph contraction problems in the recently introduced framework
of lossy kernelization. In classical kernelization, given an instance (I, k) of a parameterized …

We prove two dichotomy results for detecting long paths as patterns in a given graph. The
NP-hard problem Longest Induced Path is to determine the longest induced path in a graph …