research
∙
07/11/2023
Maximizing Social Welfare in Score-Based Social Distance Games
Social distance games have been extensively studied as a coalition forma...
share
research
∙
01/24/2023
Treewidth is NP-Complete on Cubic Graphs (and related results)
In this paper, we give a very simple proof that Treewidth is NP-complete...
research
∙
07/03/2022
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations
For many problems, the important instances from practice possess certain...
research
∙
02/24/2022
Polynomial Kernels for Tracking Shortest Paths
Given an undirected graph G=(V,E), vertices s,t∈ V, and an integer k, Tr...
research
∙
02/18/2022
Hedonic Diversity Games: A Complexity Picture with More than Two Colors
Hedonic diversity games are a variant of the classical Hedonic games des...
research
∙
11/10/2021
Generating faster algorithms for d-Path Vertex Cover
For a constant d, the d-Path Vertex Cover problem (d-PVC) is as follows:...
research
∙
08/03/2021
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set
Consider a vertex-weighted graph G with a source s and a target t. Track...
research
∙
07/26/2021
On Kernels for d-Path Vertex Cover
In this paper we study the kernelization of d-Path Vertex Cover (d-PVC) ...
research
∙
05/21/2021
Balancing the Spread of Two Opinions in Sparse Social Networks
Inspired by the famous Target Set Selection problem, we propose a new di...
research
∙
08/18/2020
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
The Minimum Eccentricity Shortest Path Problem consists in finding a sho...
research
∙
07/08/2020
Waypoint Routing on Bounded Treewidth Graphs
In the Waypoint Routing Problem one is given an undirected capacitated a...
research
∙
08/29/2019
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem
We consider the subgraph isomorphism problem where, given two graphs G (...
research
∙
06/21/2019
Faster FPT Algorithm for 5-Path Vertex Cover
The problem of d-Path Vertex Cover, d-PVC lies in determining a subset F...
research
∙
05/31/2018
A Parameterized Complexity View on Collapsing k-Cores
We study the NP-hard graph problem Collapsed k-Core where, given an undi...
research
∙
02/22/2018
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
In the Directed Steiner Network problem we are given an arc-weighted dig...
research
∙
09/26/2017
