Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace.
Thomas Thierauf
,
Fabian Wagner
Venue
A
STACS
Year
2008
Proceedings
STACS
DBLP record
conf/stacs/ThieraufW08 ↗
Browse the full
STACS paper archive
.