default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 8
Volume 8, Number 1, January 2012
- Sudipto Guha, Kamesh Munagala:
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems. 1:1-1:23 - Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi:
Online Optimization with Uncertain Information. 2:1-2:29 - Bernhard Haeupler
, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan:
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. 3:1-3:33 - Matteo Frigo, Charles E. Leiserson, Harald Prokop, Sridhar Ramachandran:
Cache-Oblivious Algorithms. 4:1-4:22 - Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Adversarial Queuing on the Multiple Access Channel. 5:1-5:31 - Jianer Chen, Yang Liu, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang:
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching. 6:1-6:22 - Sebastian Böcker, Quang Bao Anh Bui, Anke Truß:
Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees. 7:1-7:17 - Marek Cygan, Marcin Pilipczuk:
Even Faster Exact Bandwidth. 8:1-8:14
Volume 8, Number 2, April 2012
- Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini:
Dotted interval graphs. 9:1-9:21 - Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. 10:1-10:26 - Michael Drmota, Reinhard Kutzelnigg:
A precise analysis of Cuckoo hashing. 11:1-11:36 - Ke Yi, Qin Zhang:
Multidimensional online tracking. 12:1-12:16 - Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
The price of anarchy in network creation games. 13:1-13:13 - Yuli Ye, Allan Borodin:
Elimination graphs. 14:1-14:23 - Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman, Orly Yahalom:
On the query complexity of testing orientations for being Eulerian. 15:1-15:41 - Toshihiro Fujito:
How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover. 16:1-16:11 - Bodo Manthey:
On approximating multicriteria TSP. 17:1-17:18 - Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
The traveling salesman problem in bounded degree graphs. 18:1-18:13 - Andrei A. Krokhin, Dániel Marx:
On the hardness of losing weight. 19:1-19:18
Volume 8, Number 3, July 2012
- MohammadHossein Bateni, MohammadTaghi Hajiaghayi:
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location. 20:1-20:19 - Alessandro Panconesi, Jaikumar Radhakrishnan:
Expansion properties of (secure) wireless networks. 21:1-21:9 - Ulrich Meyer, Norbert Zeh:
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths. 22:1-22:28 - Chandra Chekuri, Nitish Korula, Martin Pál:
Improved algorithms for orienteering and related problems. 23:1-23:27 - Arash Asadpour, Uriel Feige, Amin Saberi:
Santa claus meets hypergraph matchings. 24:1-24:9 - Angelo Fanelli, Michele Flammini, Luca Moscardelli:
The speed of convergence in congestion games under best-response dynamics. 25:1-25:15 - Philippe Baptiste, Marek Chrobak, Christoph Dürr:
Polynomial-time algorithms for minimum energy scheduling. 26:1-26:29 - Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson:
Tight approximation algorithms for scheduling with fixed jobs and nonavailability. 27:1-27:15 - Jeff Edmonds, Kirk Pruhs:
Scalably scheduling processes with arbitrary speedup curves. 28:1-28:10 - Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Entropy, triangulation, and point location in planar subdivisions. 29:1-29:18 - Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, Till Tantau:
Smoothed analysis of left-to-right maxima with applications. 30:1-30:28 - Frédérique Bassino, Julien Clément, Pierre Nicodème:
Counting occurrences for a finite set of words: Combinatorial methods. 31:1-31:28 - Vikraman Arvind, Piyush P. Kurur:
Testing nilpotence of galois groups in polynomial time. 32:1-32:22
Volume 8, Number 4, September 2012
- Liam Roditty, Uri Zwick:
Replacement paths and k simple shortest paths in unweighted directed graphs. 33:1-33:11 - Timothy M. Chan:
All-pairs shortest paths for unweighted undirected graphs in o(mn) time. 34:1-34:17 - Surender Baswana, Sumeet Khurana, Soumojit Sarkar:
Fully dynamic randomized algorithms for graph spanners. 35:1-35:51 - Chaitanya Swamy:
The effectiveness of stackelberg strategies and tolls for network congestion games. 36:1-36:19 - Jurek Czyzowicz, Andrzej Pelc, Arnaud Labourel:
How to meet asynchronously (almost) everywhere. 37:1-37:14 - Daniel Binkele-Raible, Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Kernel(s) for problems with no kernel: On out-trees with many leaves. 38:1-38:19 - Sungjin Im, Benjamin Moseley:
An online scalable algorithm for average flow time in broadcast scheduling. 39:1-39:17 - George Karakostas, Stavros G. Kolliopoulos, Jing Wang:
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates. 40:1-40:16 - Amol Deshpande, Lisa Hellerstein:
Parallel pipelined filter ordering with precedence constraints. 41:1-41:38 - Meng He, J. Ian Munro, Srinivasa Rao Satti:
Succinct ordinal trees based on tree covering. 42:1-42:32 - Pankaj K. Agarwal, Siu-Wing Cheng, Ke Yi:
Range searching on uncertain data. 43:1-43:17 - Alexandr Andoni, Robert Krauthgamer:
The smoothed complexity of edit distance. 44:1-44:25
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-11-12 23:57 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:
