Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs.
Matthias Lanzinger
,
Igor Razgon
Venue
A
STACS
Year
2024
Proceedings
STACS
DBLP record
conf/stacs/LanzingerR24 ↗
Browse the full
STACS paper archive
.