4 citations · 10 across the 13 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Parameterizing Cluster Editing by the Number of Deletions
Vincent Froese, Leon Kellerhals, Frank Sommer +2
In Cluster Editing, we are given a graph and an integer and ask whether at most edge insertions and deletions turn into a disjoint union of cliques. Komusiewicz and…
cs.DS2026
Exact and Approximate Algorithms for Polytree Learning
Juha Harviainen, Frank Sommer, Manuel Sorge
Polytrees are a subclass of Bayesian networks that seek to capture the conditional dependencies between a set of variables as a directed forest and are motivated by their more…
cs.CG2026
Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
Thomas Depian, Frank Sommer
For a fixed graph class , the goal of -Modification is to transform an input graph into a graph using at most modifications. Vertex and edge deletions are com…