3 citations · 3 across the 1 of their papers we have counts for
4 papers · 1 filter
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition
Madison Cooley, Casey S. Greene, Davis Issac +2
We present a new combinatorial model for identifying regulatory modules in gene co-expression data using a decomposition into weighted cliques. To capture complex interaction effec…
Balanced Crown Decomposition for Connectivity Constraints
Katrin Casel, Tobias Friedrich, Davis Issac +2
We introduce the balanced crown decomposition that captures the structure imposed on graphs by their connected induced subgraphs of a given size. Such subgraphs are a popular model…
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem
Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
We develop an FPT algorithm and a bi-kernel for the Weighted Edge Clique Partition (WECP) problem, where a graph with vertices and integer edge weights is given together with a…
Spanning Tree Congestion and Computation of Generalized Győri-Lovász Partition
L. Sunil Chandran, Yun Kuen Cheung, Davis Issac
We study a natural problem in graph sparsification, the Spanning Tree Congestion (\STC) problem. Informally, the \STC problem seeks a spanning tree with no tree-edge \emph{routing}…