default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 9
Volume 9, Number 1, December 2012
- Zeev Nutov:
Approximating minimum-cost connectivity problems via uncrossable bifamilies. 1:1-1:16 - Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Prize-collecting steiner network problems. 2:1-2:13 - Baruch Awerbuch, Rohit Khandekar, Satish Rao:
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. 3:1-3:14 - Wei Chen
, Christian Sommer, Shang-Hua Teng, Yajun Wang:
A compact routing scheme and approximate distance oracle for power-law graphs. 4:1-4:26 - Lukasz Jez, Fei Li, Jay Sethuraman, Clifford Stein:
Online scheduling of packets with agreeable deadlines. 5:1-5:11 - Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow:
Algorithms and complexity for periodic real-time scheduling. 6:1-6:19 - Magnús M. Halldórsson:
Wireless scheduling with power control. 7:1-7:20 - B. Javad Ebrahimi, Christina Fragouli:
Combinatiorial algorithms for wireless information flow. 8:1-8:33 - Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled:
On the set multicover problem in geometric settings. 9:1-9:17 - Joachim Giesen, Martin Jaggi, Sören Laue:
Approximating parameterized convex optimization problems. 10:1-10:17 - Geevarghese Philip, Venkatesh Raman, Somnath Sikdar:
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. 11:1-11:23 - Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
On exact algorithms for treewidth. 12:1-12:23 - Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira:
Cycle detection and correction. 13:1-13:20
Volume 9, Number 2, March 2013
- Oren Weimann, Raphael Yuster:
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication. 14:1-14:13 - Liam Roditty, Roei Tov:
Approximating the Girth. 15:1-15:13 - Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. 16:1-16:13 - Pierre Fraigniaud, Andrzej Pelc:
Delays Induce an Exponential Memory Gap for Rendezvous in Trees. 17:1-17:24 - Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Speed Scaling with an Arbitrary Power Function. 18:1-18:14 - Dorit S. Hochbaum, Asaf Levin:
Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems. 19:1-19:12
Volume 9, Number 3, June 2013
- Shuchi Chawla, Prasad Raghavendra, Dana Randall:
Foreword to the Special Issue on SODA'11. 20:1 - Nir Ailon, Edo Liberty:
An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform. 21:1-21:12 - Timothy M. Chan:
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM. 22:1-22:22 - Constantinos Daskalakis:
On the Complexity of Approximating a Nash Equilibrium. 23:1-23:35 - Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß:
Bin Packing via Discrepancy of Permutations. 24:1-24:15 - Pawel Gawrychowski:
Optimal Pattern Matching in LZW Compressed Strings. 25:1-25:17 - T. S. Jayram, David P. Woodruff:
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error. 26:1-26:17 - Jakub Lacki:
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components. 27:1-27:15 - Shay Solomon:
Sparse Euclidean Spanners with Tiny Diameter. 28:1-28:33
Volume 9, Number 4, September 2013
- Therese Biedl, Anna Lubiw, Mark Petrick, Michael J. Spriggs:
Morphing orthogonal planar graph drawings. 29:1-29:24 - Dániel Marx, Barry O'Sullivan, Igor Razgon:
Finding small separators in linear time via treewidth reduction. 30:1-30:35 - Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
Optimal lower bounds for projective list update algorithms. 31:1-31:18 - MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Morteza Zadimoghaddam:
Submodular secretary problem and extensions. 32:1-32:23 - Erich L. Kaltofen, George Yuhasz:
On the matrix berlekamp-massey algorithm. 33:1-33:24 - Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Corrigendum: Improved results for data migration and open shop scheduling. 34:1-34:7
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-09 23:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
