A recent trend in data mining has explored (hyper)graph clustering algor...
We present fixed-parameter tractable (FPT) algorithms for two problems,
...
In a representative democracy, elections involve partitioning geographic...
Recent work in metagenomics constructs a partition of the assembly graph...
The generalized coloring numbers of Kierstead and Yang offer an
algorith...
We present a new combinatorial model for identifying regulatory modules ...
We present an algorithm to count the number of occurrences of a pattern ...
In this work, we provide the first practical evaluation of the structura...
Identifying dense bipartite subgraphs is a common graph data mining task...
Many common graph data mining tasks take the form of identifying dense
s...
Tensor networks are powerful factorization techniques which reduce resou...
We develop a new framework for generalizing approximation algorithms fro...
We experimentally evaluate the practical state-of-the-art in graph
bipar...
Low-treedepth colorings are an important tool for algorithms that exploi...
Counting subgraph isomorphisms (also called motifs or graphlets) has bee...
This work presents a novel modeling and analysis framework for graph
seq...