research
∙
07/10/2023
Parameterised distance to local irregularity
A graph G is locally irregular if no two of its adjacent vertices have t...
share
research
∙
03/06/2023
Odd Chromatic Number of Graph Classes
A graph is called odd (respectively, even) if every vertex has odd (resp...
research
∙
02/19/2023
Parameterized Max Min Feedback Vertex Set
Given a graph G and an integer k, Max Min FVS asks whether there exists ...
research
∙
01/11/2022
Approximating Subset Sum Ratio via Subset Sum Computations
We present a new FPTAS for the Subset Sum Ratio problem, which, given a ...
research
∙
09/23/2021
Filling Crosswords is Very Hard
We revisit a classical crossword filling puzzle which already appeared i...
research
∙
10/13/2020
Digraph Coloring and Distance to Acyclicity
In k-Digraph Coloring we are given a digraph and are asked to partition ...
research
∙
09/21/2020
(In)approximability of Maximum Minimal FVS
We study the approximability of the NP-complete Maximum Minimal Feedback...
research
∙
03/14/2020
Approximation Schemes for Subset Sum Ratio Problems
We consider the Subset Sum Ratio Problem (SSR), in which given a set of ...
research
∙
03/27/2018
