#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2009

2015

- This year (0)
- Last 5 years (6)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Andreas Brandstädt, Christian Rosenke, Ragnar Nevries
- LATIN
- 2010

- Andreas Brandstädt, Ragnar Nevries
- Encyclopedia of Algorithms
- 2012

Let G = (V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v ∈ V dominates its closed neighborhood N [v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v ∈ V , there is exactly one d ∈ D dominating v. An edge set M ⊆ E is an efficient edge dominating (e.e.d.) set for G if it is an… (More)

- Christian Rosenke, Maciej Liskiewicz, Ragnar Nevries
- Theor. Comput. Sci.
- 2009

The problem of two-dimensional pattern matching invariant under a given class of admissible transformationsF is to findmatches of transformed versions f (P) of a pattern P in a given text T , for all f inF . In this paper, patternmatching invariant under compositions of real valued scaling and rotation are investigated.We give a new discretization technique… (More)

- Ragnar Nevries, Christian Rosenke
- SOFSEM
- 2015

The class Lk of k-leaf powers consists of graphs G = (V,E) that have a k-leaf root, that is, a tree T with leaf set V , where xy ∈ E, if and only if the T -distance between x and y is at most k. Structure and linear time recognition algorithms have been found for 2-, 3-, 4-, and, to some extent, 5-leaf powers, and it is known that the union of all k-leaf… (More)

- Andreas Brandstädt, Martin Milanic, Ragnar Nevries
- MFCS
- 2013

Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d. in G, is known to be NP-complete even for very restricted… (More)

- Van Bang Le, Ragnar Nevries
- Theor. Comput. Sci.
- 2014

- Ragnar Nevries
- 2014

- Ragnar Nevries, Christian Rosenke
- WG
- 2013

- Van Bang Le, Ragnar Nevries
- ISAAC
- 2011

Polar and monopolar graphs are natural generalizations of bipartite or split graphs. A graph G = (V,E) is polar if its vertex set admits a partition V = A∪B such thatA induces a complete multipartite and B the complement of a complete multipartite graph. If A is even a stable set then G is called monopolar. Recognizing general polar or monopolar graphs is… (More)

- ‹
- 1
- ›