Unambiguous DNFs and Alon–Saks–Seymour

Decomposition techniques applied to the Clique-Stable set separation problem

(2018) Nicolas Bousquet et al.   DISCRETE MATHEMATICS

Clique–Stable Set separation in perfect graphs with no balanced skew-partitions

(2016) Aurélie Lagoutte et al.   DISCRETE MATHEMATICS

Rectangles Are Nonnegative Juntas

(2016) Mika Göös et al.   SIAM JOURNAL ON COMPUTING

Ordered biclique partitions and communication complexity problems

(2015) Manami Shigeta et al.   DISCRETE APPLIED MATHEMATICS

Clique versus independent set

(2014) N. Bousquet et al.   EUROPEAN JOURNAL OF COMBINATORICS

Some improved bounds on communication complexity via new decomposition of cliques

(2013) Kazuyuki Amano   DISCRETE APPLIED MATHEMATICS

A counterexample to the Alon-Saks-Seymour conjecture and related problems

(2012) Hao Huang et al.   COMBINATORICA