Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISAAC
/
Paper
Approximating the Minmax Subtree Cover Problem in a Cactus.
Hiroshi Nagamochi
,
Taizo Kawada
Venue
B
ISAAC
Year
2004
Proceedings
ISAAC
DBLP record
conf/isaac/NagamochiK04 ↗
Browse the full
ISAAC paper archive
.