Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CSR
/
Paper
The Descriptive Complexity of Subgraph Isomorphism Without Numerics.
Oleg Verbitsky
,
Maksim Zhukovskii
Venue
National
CSR
Year
2017
Proceedings
CSR
DBLP record
conf/csr/VerbitskyZ17 ↗
Browse the full
CSR paper archive
.