#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2003

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Joachim Kneis, Alexander Langer, Peter Rossmanith
- ISAAC
- 2008

- Robert Ganian, Petr Hlinený, +4 authors Somnath Sikdar
- IPEC
- 2010

Several different measures for digraph width have appeared in the last few years. However, none of them shares all the “nice” properties of treewidth: First, being algorithmically useful i.e.… (More)

- Joachim Kneis, Alexander Langer, Peter Rossmanith
- Discrete Optimization
- 2011

Courcelle’s Theorem states that every problem definable in Monadic SecondOrder logic can be solved in linear time on structures of bounded treewidth, for example, by constructing a tree automaton… (More)

- Jianer Chen, Joachim Kneis, +5 authors Fenghui Zhang
- 2009

In contrast to undirected width measures (such as treewidth or clique-width), which have provided many important algorithmic applications, analogous measures for digraphs such as DAGwidth or… (More)

We prove that given a graph, one can efficiently find a set of no more than m/5.217 + 1 nodes whose removal yields a partial twotree. As an application, we immediately get simple algorithms for… (More)

- Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
- Inf. Process. Lett.
- 2006

The optimization problem of measuring all nodes in an electrical network by placing as few measurement units (PMUs) as possible is known as Power Dominating Set. Nodes can be measured indirectly… (More)

- Joachim Kneis, Alexander Langer, Peter Rossmanith
- FSTTCS
- 2009

We present a simple exact algorithm for the INDEPENDENT SET problem with a runtime bounded by O(1.2132npoly(n)). This bound is obtained by, firstly, applying a new branching rule and, secondly, by a… (More)

- Hans-Joachim Böckenhauer, Luca Forlizzi, +4 authors Peter Widmayer
- IFIP TCS
- 2006

Given an instance of an optimization problem together with an optimal solution, we consider the scenario in which this instance is modified locally. In graph problems, e. g., a singular edge might be… (More)