Manuel Sorge

activity

20152022

most citedMatchings under Preferences: Strength of Stability and Trade-offs

6 citations · 12 across the 10 of their papers we have counts for

collaborators

Showing cs.CCShow all

3 papers · 1 filter

cs.CC2018

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

Iyad Kanj, Christian Komusiewicz, Manuel Sorge +1

A fundamental graph problem is to recognize whether the vertex set of a graph $G$ can be bipartitioned into sets $A$ and $B$ such that $G [A]$ and $G [B]$ satisfy properties $Π_{A}$ an…

cs.CC2018

On Computing Centroids According to the $p$ -Norms of Hamming Distance Vectors

Jiehua Chen, Danny Hermelin, Manuel Sorge

In this paper we consider the $p$ -Norm Hamming Centroid problem which asks to determine whether some given binary strings have a centroid with a bound on the $p$ -norm of its Hammin…

cs.CC2017★ 1 cited

The Complexity of Routing with Few Collisions

Till Fluschnik, Marco Morik, Manuel Sorge

We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal verti…

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

On Computing Centroids According to the p-Norms of Hamming Distance Vectors

The Complexity of Routing with Few Collisions

On Computing Centroids According to the $p$ -Norms of Hamming Distance Vectors