default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 5
Volume 5, Number 1, November 2008
- Eric Torng, Jason McCullough
:
SRPT optimally utilizes faster machines to minimize flow time. 1:1-1:25 - Michael H. Goldwasser, Mark Pedigo:
Online nonpreemptive scheduling of equal-length jobs on two identical machines. 2:1-2:18 - William Aiello, Alexander Kesselman, Yishay Mansour:
Competitive buffer management for shared-memory switches. 3:1-3:16 - Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Kinetic and dynamic data structures for closest pair and all nearest neighbors. 4:1-4:37 - Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
Algorithms for center and Tverberg points. 5:1-5:20 - Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi:
Distributed weighted vertex cover via maximal matchings. 6:1-6:12 - Sundar Vishwanathan:
On hard instances of approximate vertex cover. 7:1-7:6 - Daniel Berend, Steven Skiena, Yochai Twitto:
Combinatorial dominance guarantees for problems with infeasible solutions. 8:1-8:29 - Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov:
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. 9:1-9:17 - Sang-il Oum:
Approximating rank-width and clique-width quickly. 10:1-10:20 - Andreas Brandstädt, Van Bang Le, R. Sritharan:
Structure and linear-time recognition of 4-leaf powers. 11:1-11:22 - Xin Chen, Lan Liu, Zheng Liu, Tao Jiang:
On the minimum common integer partition problem. 12:1-12:18 - Dany Azriel, Noam Solomon, Shay Solomon:
On an infinite family of solvable Hanoi graphs. 13:1-13:22 - Amr Elmasry, Claus Jensen, Jyrki Katajainen:
Multipartite priority queues. 14:1-14:19
Volume 5, Number 2, March 2009
- David Eppstein:
Testing bipartiteness of geometric intersection graphs. 15:1-15:35 - Ke Chen, Haim Kaplan, Micha Sharir:
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. 16:1-16:24 - Laurent Alonso, Edward M. Reingold:
Average-case analysis of some plurality algorithms. 17:1-17:36 - Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Throughput maximization of real-time scheduling with batching. 18:1-18:17 - Yuval Rabani, Gabriel Scalosub:
Bicriteria approximation tradeoff for the node-cost budget problem. 19:1-19:14 - Guojun Li, Xiaotie Deng, Ying Xu:
A polynomial-time approximation scheme for embedding hypergraph in a cycle. 20:1-20:12 - Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov:
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. 21:1-21:17 - Sharon Marko, Dana Ron:
Approximating the distance to properties in bounded-degree and general sparse graphs. 22:1-22:28 - Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas:
Linear time 3-approximation for the MAST problem. 23:1-23:18 - Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu:
Algorithms for distributional and adversarial pipelined filter ordering problems. 24:1-24:34
Volume 5, Number 3, July 2009
- Harold N. Gabow:
Foreword to special issue on SODA 2007. 25:1 - Milan Ruzic:
Making deterministic signatures quickly. 26:1-26:26 - Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh:
Compacting cuts: A new linear formulation for minimum cut. 27:1-27:16 - Yoav Giyora, Haim Kaplan:
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. 28:1-28:51 - David Eppstein:
Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition. 29:1-29:24 - Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam:
Minimizing movement. 30:1-30:30 - Glencora Borradaile, Philip N. Klein, Claire Mathieu:
An O(n log n) approximation scheme for Steiner tree in planar graphs. 31:1-31:31 - Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Near-optimal algorithms for maximum constraint satisfaction problems. 32:1-32:14 - Matthew Andrews:
Instability of FIFO in the permanent sessions model at arbitrarily small network loads. 33:1-33:29
Volume 5, Number 4, October 2009
- Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu:
Approximation algorithms for data placement on parallel disks. 34:1-34:26 - Sudipto Guha, Andrew McGregor, Suresh Venkatasubramanian:
Sublinear estimation of entropy and information distances. 35:1-35:16 - Asaf Levin:
A generalized minimum cost k-clustering. 36:1-36:10 - Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro:
Bootstrapping a hop-optimal network in the weak sensor model. 37:1-37:30 - David Eppstein:
All maximal independent sets and dynamic dominance for sparse graphs. 38:1-38:14 - Bruce A. Reed, David R. Wood:
A linear-time algorithm to find a separator in a graph excluding a minor. 39:1-39:16 - Hiro Ito, Kazuo Iwama:
Enumeration of isolated cliques and pseudo-cliques. 40:1-40:21 - George Karakostas:
A better approximation ratio for the vertex cover problem. 41:1-41:8 - Daniel Berend, Vladimir Braverman:
A linear algorithm for computing convex hulls for random lines. 42:1-42:21 - Ming-Yang Kao, Manan Sanghi, Robert T. Schweller:
Randomized fast design of short DNA words. 43:1-43:24 - David Fernández-Baca, Balaji Venkatachalam:
Parametric analysis for ungapped Markov models of evolution. 44:1-44:20 - Alexander D. Scott, Gregory B. Sorkin:
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function. 45:1-45:27 - Phong Q. Nguyen, Damien Stehlé:
Low-dimensional lattice basis reduction revisited. 46:1-46:48
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-04 00:42 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:
