Shenwei Huang

activity

20132026

most citedImproved Complexity Results on

k

-Coloring

P_{t}

-Free Graphs

23 citations · 59 across the 29 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017

Linearly $χ$ -Bounding $(P_{6}, C_{4})$ -Free Graphs

Serge Gaspers, Shenwei Huang

Given two graphs $H_{1}$ and $H_{2}$ , a graph $G$ is $(H_{1}, H_{2})$ -free if it contains no subgraph isomorphic to $H_{1}$ or $H_{2}$ . Let $P_{t}$ and $C_{s}$ be the path on $t$ vertices and the c…

cs.GT2017★ 3 cited

A Polynomial-time Algorithm to Achieve Extended Justified Representation

Haris Aziz, Shenwei Huang

We consider a committee voting setting in which each voter approves of a subset of candidates and based on the approvals, a target number of candidates are to be selected. In parti…

Linearly χ-Bounding (P6​,C4​)-Free Graphs

A Polynomial-time Algorithm to Achieve Extended Justified Representation

Linearly $χ$ -Bounding $(P_{6}, C_{4})$ -Free Graphs