research
∙
05/28/2023
Overlapping and Robust Edge-Colored Clustering in Hypergraphs
A recent trend in data mining has explored (hyper)graph clustering algor...
share
research
∙
07/14/2022
Improved Parameterized Complexity of Happy Set Problems
We present fixed-parameter tractable (FPT) algorithms for two problems, ...
research
∙
05/13/2022
Gerrymandering Trees: Parameterized Hardness
In a representative democracy, elections involve partitioning geographic...
research
∙
12/21/2021
Sparse dominating sets and balanced neighborhood partitioning
Recent work in metagenomics constructs a partition of the assembly graph...
research
∙
12/20/2021
Hardness of the Generalized Coloring Numbers
The generalized coloring numbers of Kierstead and Yang offer an algorith...
research
∙
06/01/2021
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition
We present a new combinatorial model for identifying regulatory modules ...
research
∙
01/15/2020
A color-avoiding approach to subgraph counting in bounded expansion classes
We present an algorithm to count the number of occurrences of a pattern ...
research
∙
09/10/2019
Approximating Vertex Cover using Structural Rounding
In this work, we provide the first practical evaluation of the structura...
research
∙
03/04/2019
Faster Biclique Mining in Near-Bipartite Graphs
Identifying dense bipartite subgraphs is a common graph data mining task...
research
∙
10/26/2018
Mining Maximal Induced Bicliques using Odd Cycle Transversals
Many common graph data mining tasks take the form of identifying dense s...
research
∙
07/12/2018
Benchmarking treewidth as a practical component of tensor-network--based quantum simulation
Tensor networks are powerful factorization techniques which reduce resou...
research
∙
06/07/2018
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
We develop a new framework for generalizing approximation algorithms fro...
research
∙
05/02/2018
Practical Graph Bipartization with Applications in Near-Term Quantum Computing
We experimentally evaluate the practical state-of-the-art in graph bipar...
research
∙
02/27/2018
Treedepth Bounds in Linear Colorings
Low-treedepth colorings are an important tool for algorithms that exploi...
research
∙
12/18/2017
Experimental Evaluation of Counting Subgraph Isomorphisms in Classes of Bounded Expansion
Counting subgraph isomorphisms (also called motifs or graphlets) has bee...
research
∙
10/16/2014
