27 citations · 100 across the 31 of their papers we have counts for
4 papers · 1 filter
Reducing Access Disparities in Networks using Edge Augmentation
Ashkan Bashardoust, Sorelle A. Friedler, Carlos E. Scheidegger +2
In social networks, a node's position is a form of \it{social capital}. Better-positioned members not only benefit from (faster) access to diverse information, but innately have mo…
Improved Parameterized Complexity of Happy Set Problems
Yosuke Mizutani, Blair D. Sullivan
We present fixed-parameter tractable (FPT) algorithms for two problems, Maximum Happy Set (MaxHS) and Maximum Edge Happy Set (MaxEHS)--also known as Densest k-Subgraph. Given a gra…
Faster Decomposition of Weighted Graphs into Cliques using Fisher's Inequality
Shweta Jain, Yosuke Mizutani, Blair Sullivan
Mining groups of genes that consistently co-express is an important problem in biomedical research, where it is critical for applications such as drug-repositioning and designing n…
Parameterized Complexity of Gerrymandering
Andrew Fraser, Brian Lavallee, Blair D. Sullivan
In a representative democracy, the electoral process involves partitioning geographical space into districts which each elect a single representative. These representatives craft a…