Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
On the Approximability of the Maximum Common Subgraph Problem.
Viggo Kann
Venue
A
STACS
Year
1992
Proceedings
STACS
DBLP record
conf/stacs/Kann92 ↗
Browse the full
STACS paper archive
.