SODA - ACM-SIAM Symposium on Discrete Algorithms

Subscribe

Academic

SODA - ACM-SIAM Symposium on Discrete Algorithms

SODA - ACM-SIAM Symposium on Discrete Algorithms

Publications: 2,281| Citation Count: 48,769 (Self-Citation: 2,465) |H-Index: 88
Year Range: 1990-2011

Interests: Algorithms & Theory

Paper submissions due: 12 July 2011, Duration: 17 - 19 January 2012, Kyoto, Japan

Homepage |

CFP

Cumulative Annual

Order by:

Publications (2281)

Slightly Superexponential Parameterized Problems (Citations: 3)

Daniel Lokshtanov, Dániel Marx, Saket Saurabh

Conference: ACM-SIAM Symposium on Discrete Algorithms - SODA , pp. 760-776, 2011
The Matroid Median Problem (Citations: 3)

Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha

Conference: ACM-SIAM Symposium on Discrete Algorithms - SODA , pp. 1117-1130, 2011
On the Complexity of Time-Dependent Shortest Paths (Citations: 2)

Luca Foschini, John Hershberger, Subhash Suri

Conference: ACM-SIAM Symposium on Discrete Algorithms - SODA , pp. 327-341, 2011
Mobile Geometric Graphs: Detection, Coverage and Percolation (Citations: 2)

Yuval Peres, Alistair Sinclair, Perla Sousi, Alexandre Stauffer

Conference: ACM-SIAM Symposium on Discrete Algorithms - SODA , pp. 412-428, 2011
Component structure of the vacant set induced by a random walk on a random graph (Citations: 1)

Colin Cooper, Alan M. Frieze

Conference: ACM-SIAM Symposium on Discrete Algorithms - SODA , pp. 1211-1221, 2011