#### Writes About:

#### Filter Results:

- Full text PDF available (22)

#### Publication Year

2005

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Hannes Moser, Dimitrios M. Thilikos
- ACiD
- 2006

The r-Regular Induced Subgraph problem asks, given a graph G and a non-negative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced subgraph in whichâ€¦ (More)

- Falk HÃ¼ffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
- Theory of Computing Systems
- 2008

We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted case, one searchesâ€¦ (More)

Given a graph G and an integer k â‰¥ 0, the NP-complete Induced Matching problem asks whether there exists an edge subset M of size at least k such that M is a matching and no two edges of M are joinedâ€¦ (More)

The NP-complete Vertex Cover problem has been intensively studied in the field of parameterized complexity theory. However, there exists only little work concerning important generalizations ofâ€¦ (More)

- Hannes Moser, Somnath Sikdar
- FAW
- 2007

Given a graph G and an integer k â‰¥ 0, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined by an edge of G. The complexity ofâ€¦ (More)

- Hannes Moser, Rolf Niedermeier, Manuel Sorge
- J. Comb. Optim.
- 2012

We propose new practical algorithms to find maximum-cardinality k-plexes in graphs. A k-plex denotes a vertex subset in a graph inducing a subgraph where every vertex has edges to all but at most kâ€¦ (More)

Making a graph unit interval by a minimum number of vertex deletions is NP-hard. The problem is motivated by applications in seriation and measuring indifference between data items. We present aâ€¦ (More)

- Falk HÃ¼ffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
- Theor. Comput. Sci.
- 2009

We do computational studies concerning the enumeration of isolated cliques in graphs. Isolation, as recently introduced, measures the degree of connectedness of the cliques to the rest of the graph.â€¦ (More)

- Daniel BrÃ¼gmann, Christian Komusiewicz, Hannes Moser
- Electronic Notes in Discrete Mathematics
- 2009

We show that the problem to decide whether a graph can be made triangle-free with at most k edge deletions remains NP-complete even when restricted to planar graphs of maximum degree seven. Inâ€¦ (More)

- RenÃ© van Bevern, Hannes Moser, Rolf Niedermeier
- LATIN
- 2010