Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SODA
/
Paper
Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching.
Sujoy Bhore
,
Timothy M. Chan
Venue
A*
SODA
Year
2025
Proceedings
SODA
DBLP record
conf/soda/BhoreC25 ↗
Browse the full
SODA paper archive
.