Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
New Approximation Algorithms for Minimum Cycle Bases of Graphs.
Telikepalli Kavitha
,
Kurt Mehlhorn
,
Dimitrios Michail
Venue
A
STACS
Year
2007
Proceedings
STACS
DBLP record
conf/stacs/KavithaMM07 ↗
Browse the full
STACS paper archive
.