Blar i Department of Informatics på tidsskrift "Algorithmica"
Viser treff 1-15 av 15
-
A Fixed-Parameter Perspective on #BIS
(Peer reviewed; Journal article, 2019-07-18)The problem of (approximately) counting the independent sets of a bipartite graph (#BIS) is the canonical approximate counting problem that is complete in the intermediate complexity class #RHΠ1. It is believed that #BIS ... -
Metric Dimension Parameterized By Treewidth
(Journal article; Peer reviewed, 2021)A resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The METRIC DIMENSION problem asks for a resolving set of minimum size, and in its decision form, ... -
Mim-Width II. The Feedback Vertex Set Problem
(Peer reviewed; Journal article, 2020)We give a first polynomial-time algorithm for (WEIGHTED) FEEDBACK VERTEX SET on graphs of bounded maximum induced matching width (mim-width). Explicitly, given a branch decomposition of mim-width w, we give an nO(w)-time ... -
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
(Journal article; Peer reviewed, 2022)The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex Set (SFVS) both ask for a vertex set of minimum total weight, that for NMC disconnects a given set of terminals, and for SFVS intersects ... -
On cutwidth parameterized by vertex cover
(Peer reviewed; Journal article, 2014-04)We study the CUTWIDTH problem, where the input is a graph G, and the objective is find a linear layout of the vertices that minimizes the maximum number of edges intersected by any vertical line inserted between two ... -
On Perturbation Resilience of Non-uniform k-Center
(Journal article; Peer reviewed, 2021)The Non-Uniform k-center (NUkC) problem has recently been formulated by Chakrabarty et al. [ICALP, 2016; ACM Trans Algorithms 16(4):46:1–46:19, 2020] as a generalization of the classical k-center clustering problem. In ... -
On the Tractability of Optimization Problems on H-Graphs
(Journal article; Peer reviewed, 2020)For a graph H, a graph G is an H-graph if it is an intersection graph of connected subgraphs of some subdivision of H. H-graphs naturally generalize several important graph classes like interval graphs or circular-arc ... -
Parameterized Complexity of Directed Spanner Problems
(Journal article; Peer reviewed, 2021)We initiate the parameterized complexity study of minimum t-spanner problems on directed graphs. For a positive integer t, a multiplicative t-spanner of a (directed) graph G is a spanning subgraph H such that the distance ... -
Parameterized complexity of Eulerian deletion problems
(Peer reviewed; Journal article, 2014-01)We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity ... -
Parameterized complexity of the spanning tree congestion problem
(Peer reviewed; Journal article, 2012-09)We study the problem of determining the spanning tree congestion of a graph. We present some sharp contrasts in the parameterized complexity of this problem. First, we show that on apex-minor-free graphs, a general class ... -
Solving the 2-disjoint connected subgraphs problem faster than 2ⁿ
(Peer reviewed; Journal article, 2014-10)The 2-DISJOINT CONNECTED SUBGRAPHS problem, given a graph along with two disjoint sets of terminals Z1,Z2, asks whether it is possible to find disjoint sets A1,A2, such that Z1 ⊆ A1, Z2 ⊆ A2 and A1,A2 induce connected ... -
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
(Journal article; Peer reviewed, 2021)We study algorithmic properties of the graph class CHORDAL−ke, that is, graphs that can be turned into a chordal graph by adding at most k edges or, equivalently, the class of graphs of fll-in at most k. It appears that a ... -
Subgraph Complementation
(Journal article; Peer reviewed, 2020-02)A subgraph complement of the graph G is a graph obtained from G by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph G and graph class G, is there ... -
Towards a Polynomial Kernel for Directed Feedback Vertex Set
(Journal article; Peer reviewed, 2020)In the DIRECTED FEEDBACK VERTEX SET (DFVS) problem, the input is a directed graph D and an integer k. The objective is to determine whether there exists a set of at most k vertices intersecting every directed cycle of D. ... -
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
(Journal article; Peer reviewed, 2024)In this paper, we showcase the class XNLP as a natural place for many hard problems parameterized by linear width measures. This strengthens existing W[1]-hardness proofs for these problems, since XNLP-hardness implies ...