3 citations · 3 across the 5 of their papers we have counts for
6 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}…
Algorithms and Bounds for Very Strong Rainbow Coloring
L. Sunil Chandran, Anita Das, Davis Issac +1
A well-studied coloring problem is to assign colors to the edges of a graph so that, for every pair of vertices, all edges of at least one shortest path between them receive di…
Sampling in Space Restricted Settings
Anup Bhattacharya, Davis Issac, Ragesh Jaiswal +1
Space efficient algorithms play a central role in dealing with large amount of data. In such settings, one would like to analyse the large data using small amount of "working space…