Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FCT
/
Paper
The Complexity of Maximum Matroid-Greedoid Intersection.
Taneli Mielikinen
,
Esko Ukkonen
Venue
B
FCT
Year
2001
Proceedings
FCT
DBLP record
conf/fct/MielikainenU01 ↗
Browse the full
FCT paper archive
.