most citedOptimal Padded Decomposition For Bounded Treewidth Graphs

2 citations · 3 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

3 papers · 1 filter

cs.DS2025

Binary -Center with Missing Entries: Structure Leads to Tractability

Farehe Soheil, Kirill Simonov, Tobias Friedrich

$\kC$ clustering is a fundamental classification problem, where the task is to categorize the given collection of entities into clusters and come up with a representative for e…

cs.DS2024★ 2 cited

Optimal Padded Decomposition For Bounded Treewidth Graphs

Arnold Filtser, Tobias Friedrich, Davis Issac +4

A -padded decomposition of an edge-weighted graph is a stochastic decomposition into clusters of diameter at most such that for every vertex , th…

cs.DS2024★ 1 cited

Combining Crown Structures for Vulnerability Measures

Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits +2

Over the past decades, various metrics have emerged in graph theory to grasp the complex nature of network vulnerability. In this paper, we study two specific measures: (weighted)…