Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICDM
/
Paper
Discovering Robustly Connected Subgraphs with Simple Descriptions.
Janis Kalofolias
,
Mario Boley
,
Jilles Vreeken
Venue
A*
ICDM
Year
2019
Proceedings
ICDM
DBLP record
conf/icdm/KalofoliasBV19 ↗
Browse the full
ICDM paper archive
.