1 citations · 1 across the 3 of their papers we have counts for
4 papers
Parameterized Complexity of Vehicle Routing
Michelle Döring, Jan Fehse, Tobias Friedrich +6
The Vehicle Routing Problem (VRP) is a popular generalization of the Traveling Salesperson Problem. Instead of one salesperson traversing the entire weighted, undirected graph ,…
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…
Connected Partitions via Connected Dominating Sets
Aikaterini Niklanovits, Kirill Simonov, Shaily Verma +1
The classical theorem due to Győri and Lovász states that any -connected graph admits a partition into connected subgraphs, where each subgraph has a prescribed size and…
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)…