11 citations · 15 across the 15 of their papers we have counts for
4 papers · 1 filter
Modification-Fair Cluster Editing
Vincent Froese, Leon Kellerhals, Rolf Niedermeier
The classic Cluster Editing problem (also known as Correlation Clustering) asks to transform a given graph into a disjoint union of cliques (clusters) by a small number of edge mod…
Optimal Virtual Network Embeddings for Tree Topologies
Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier +3
The performance of distributed and data-centric applications often critically depends on the interconnecting network. Applications are hence modeled as virtual networks, also accou…
Parameterized Algorithms for Diverse Multistage Problems
Leon Kellerhals, Malte Renken, Philipp Zschoche
The world is rarely static -- many problems need not only be solved once but repeatedly, under changing conditions. This setting is addressed by the "multistage" view on computatio…
A comparison between D-wave and a classical approximation algorithm and a heuristic for computing the ground state of an Ising spin glass
Ran Yaacoby, Nathan Schaar, Leon Kellerhals +3
Finding the ground state of an Ising-spin glass on general graphs belongs to the class of NP-hard problems, widely believed to have no efficient polynomial-time algorithms for solv…