Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FOCS
/
Paper
Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time.
Karthekeyan Chandrasekaran
,
Chandra Chekuri
Venue
A*
FOCS
Year
2020
Proceedings
FOCS
DBLP record
conf/focs/ChandrasekaranC20 ↗
Browse the full
FOCS paper archive
.