Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICALP
/
Paper
A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs.
Andrzej Lingas
,
Maciej M. Syslo
Venue
A*
ICALP
Year
1988
Proceedings
ICALP
DBLP record
conf/icalp/LingasS88 ↗
Browse the full
ICALP paper archive
.