Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
INOC
/
Paper
Complexity of Inverse Shortest Path Routing.
Mikael Call
,
Kaj Holmberg
Venue
C
INOC
Year
2011
Proceedings
INOC
DBLP record
conf/inoc/CallH11 ↗
Browse the full
INOC paper archive
.