Leon Kellerhals

activity

20172026

most citedA comparison between D-wave and a classical approximation algorithm and a heuristic for computing the ground state of an Ising spin glass

11 citations · 15 across the 15 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

cs.DS2023

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem

Lito Goldmann, Leon Kellerhals, Tomohiro Koana

In this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \leq j$ , find a set of at most $k$ vertices that intersects every (not ne…

cs.DS2023★ 1 cited

Parameterized Algorithms for Colored Clustering

Leon Kellerhals, Tomohiro Koana, Pascal Kunz +1

In the Colored Clustering problem, one is asked to cluster edge-colored (hyper-)graphs whose colors represent interaction types. More specifically, the goal is to select as many ed…