Similar Items: Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
- Improved Approximation Algorithm for Maximum Balanced Biclique
- Small Independent Sets versus Small Separator in Geometric Intersection Graphs
- EPTAS for Hard Graph Cut Problems for Dense Graphs
- Succinct Graph Representations and Algorithmic Applications
- Online Coloring for Graphs of Large Odd Girth
- Tree-independence number of $P_5$-free graphs with no large bicliques