


default search action
Algorithmica, Volume 66
Volume 66, Number 1, May 2013
- Harish Chandran, Nikhil Gopalkrishnan, John H. Reif:

Tile Complexity of Approximate Squares. 1-17 - Surender Baswana, Neelesh Khanna:

Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs. 18-50 - Serafino Cicerone

, Gianlorenzo D'Angelo
, Gabriele Di Stefano, Daniele Frigioni
,


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID