default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 10
Volume 10, Number 1, January 2014
- Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour:
A logarithmic approximation for unsplittable flow on line graphs. 1:1-1:15 - Julián Mestre:
Weighted popular matchings. 2:1-2:16 - Sariel Har-Peled
, Benjamin Raichel:
The fréchet distance revisited and extended. 3:1-3:22 - Antoine Vigneron:
Geometric optimization and sums of algebraic functions. 4:1-4:20
Volume 10, Number 2, February 2014
- Ashish Goel, Hamid Nazerzadeh:
Price-based protocols for fair resource allocation: Convergence time analysis and extension to leontief utilities. 5:1-5:14 - Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia:
Socially desirable approximations for dodgson's voting rule. 6:1-6:28 - Ning Chen, Xiaotie Deng:
Envy-free pricing in multi-item markets. 7:1-7:15 - Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic programming for graphs on surfaces. 8:1-8:26 - Susanne Albers, Antonios Antoniadis:
Race to idle: New algorithms for speed scaling with a sleep state. 9:1-9:31
Volume 10, Number 3, May 2014
- Ho Yee Cheung, Lap Chi Lau, Kai Man Leung:
Algebraic Algorithms for Linear Matroid Parity Problems. 10:1-10:26 - Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira:
Approximate Privacy: Foundations and Quantification. 11:1-11:38 - Amnon Ta-Shma, Uri Zwick:
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences. 12:1-12:15 - Erik D. Demaine, Mohammad Taghi Hajiaghayi, Philip N. Klein:
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. 13:1-13:20 - Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-Matching Problems. 14:1-14:23 - T.-H. Hubert Chan, Li Ning:
Fast Convergence for Consensus in Dynamic Networks. 15:1-15:15 - Gonzalo Navarro, Kunihiko Sadakane:
Fully Functional Static and Dynamic Succinct Trees. 16:1-16:39
Volume 10, Number 4, August 2014
- Dana Ron, Gilad Tsur:
Testing Properties of Sparse Images. 17:1-17:52 - Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko:
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm. 18:1-18:18 - Stefan Kratsch:
Co-Nondeterminism in Compositions: A Kernelization Lower Bound for a Ramsey-Type Problem. 19:1-19:16 - Stefan Kratsch, Magnus Wahlström:
Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal. 20:1-20:15 - Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen:
Exponential Time Complexity of the Permanent and the Tutte Polynomial. 21:1-21:32 - Dany Breslauer, Zvi Galil:
Real-Time Streaming String-Matching. 22:1-22:12 - Djamal Belazzougui, Gonzalo Navarro:
Alphabet-Independent Compressed Text Indexing. 23:1-23:19 - Baruch Awerbuch, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Jin Zhang:
Principles of Robust Medium Access and an Application to Leader Election. 24:1-24:26
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-05 22:35 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:
