Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
IJCAI
/
Paper
An Efficient Algorithm To Compute Distance Between Lexicographic Preference Trees.
Minyi Li
,
Borhan Kazimipour
Venue
A*
IJCAI
Year
2018
Proceedings
IJCAI
DBLP record
conf/ijcai/LiK18 ↗
Browse the full
IJCAI paper archive
.