In this work, we study the Biclique-Free Vertex Deletion problem: Given ...
In the Colored Clustering problem, one is asked to cluster edge-colored
...
We consider opinion diffusion for undirected networks with sequential up...
The computation of short paths in graphs with edge lengths is a pillar o...
Vertex Cover parameterized by the solution size k is the quintessential
...
Choosing the placement of wildlife crossings (i.e., green bridges) to
re...
The classic Cluster Editing problem (also known as Correlation Clusterin...
The performance of distributed and data-centric applications often criti...
The world is rarely static – many problems need not only be solved once ...
We study the problem of placing wildlife crossings, such as green bridge...
Given a matrix A ∈ℝ^n× n, we consider the problem of
maximizing x^TAx su...
A vertex set S of a graph G is geodetic if every vertex of G lies on a
s...
Betweenness centrality, measuring how many shortest paths pass through a...