Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICALP
/
Paper
Determining the Outerthickness of Graphs Is NP-Hard.
Pin-Hsian Lee
,
Te-Cheng Liu
,
Meng-Tsung Tsai
Venue
A*
ICALP
Year
2026
Proceedings
ICALP
DBLP record
conf/icalp/LeeLT26 ↗
Browse the full
ICALP paper archive
.