#### Filter Results:

- Full text PDF available (39)

#### Publication Year

2009

2017

- This year (8)
- Last 5 years (38)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

The Bisection problem asks for a partition of the vertices of a graph into two equally sized sets, while minimizing the cut size. This is the number of edges connecting the two vertex sets. Bisection has been thoroughly studied in the past. However, only few results have been published that consider the parameterized complexity of this problem. We show that… (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 vertices in the k-plex. Cliques are 1plexes. In analogy to the special case of finding maximum-cardinality cliques, finding maximum-cardinality k-plexes is… (More)

- René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
- Theory of Computing Systems
- 2014

A balanced partition is a clustering of a graph into a given number of equal-sized parts. For instance, the Bisection problem asks to remove at most k edges in order to partition the vertices into two equal-sized parts. We prove that Bisection is FPT for the distance to constant cliquewidth if we are given the deletion set. This implies FPT algorithms for… (More)

- Falk Hüffner, Christian Komusiewicz, Manuel Sorge
- SOFSEM
- 2015

A popular way of formalizing clusters in networks are highly connected subgraphs, that is, subgraphs of k vertices that have edge connectivity larger than k/2 (equivalently, minimum degree larger than k/2). We examine the computational complexity of finding highly connected subgraphs. We show that the problem is NP-hard. Thus, we explore possible… (More)

An author’s profile on Google Scholar consists of indexed articles and associated data, such as the number of citations and the H-index. The author is allowed to merge articles, which may affect the H-index. We analyze the parameterized complexity of maximizing the H-index using article merges. Herein, to model realistic manipulation scenarios, we define a… (More)

- Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller
- SIAM J. Discrete Math.
- 2015

The NP-hard Subset Interconnection Design problem, also known as Minimum Topic-Connected Overlay, is motivated by numerous applications including the design of scalable overlay networks and vacuum systems. It has as input a finite set V and a collection of subsets V1, V2, . . . , Vm ⊆ V , and asks for a minimum-cardinality edge set E such that for the graph… (More)

- Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion
- ArXiv
- 2017

The classical Stable Roommates problem (which is a non-bipartite generalization of the well-known Stable Marriage problem) asks whether there is a stable matching for a given set of agents (i.e. a partitioning of the agents into disjoint pairs such that no two agents induce a blocking pair). Herein, each agent has a preference list denoting who it prefers… (More)

Finding a vertex subset in a graph that satisfies a certain property is one of the most-studied topics in algorithmic graph theory. The focus herein is often on minimizing or maximizing the size of the solution, that is, the size of the desired vertex set. In several applications, however, we also want to limit the “exposure” of the solution to the rest of… (More)

- Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
- J. Discrete Algorithms
- 2011

We provide a new characterization of the NP-hard arc routing problem Rural Postman in terms of a constrained variant of minimum-weight perfect matching on bipartite graphs. To this end, we employ a parameterized equivalence between Rural Postman and Eulerian Extension, a natural arc addition problem in directed multigraphs. We indicate the NP-hardness of… (More)

- Hannes Moser, Rolf Niedermeier, Manuel Sorge
- SEA
- 2009

We propose new practical algorithms to find degree-relaxed variants of cliques called s-plexes. An s-plex denotes a vertex subset in a graph inducing a subgraph where every vertex has edges to all but at most s vertices in the s-plex. Cliques are 1-plexes. In analogy to the special case of finding maximum-cardinality cliques, finding maximumcardinality… (More)