Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 4
Volume 4, Number 1, March 2008
- Milan Ruzic:
Uniform deterministic dictionaries. 1:1-1:23 - Gianni Franceschini, Roberto Grossi:
No sorting? better searching! 2:1-2:13 - Haim Kaplan, Robert Endre Tarjan:
Thin heaps, thick heaps. 3:1-3:14 - Jérémy Barbay
, Claire Kenyon:
Alternation and redundancy analysis of the intersection problem. 4:1-4:18 - Seth Pettie, Vijaya Ramachandran:
Randomized minimum spanning tree algorithms using exponentially fewer random bits. 5:1-5:27 - Liam Roditty:
A faster and simpler fully dynamic transitive closure. 6:1-6:16 - Harold N. Gabow, Shuxin Nie:
Finding a long directed cycle. 7:1-7:21 - Adam L. Buchsbaum, Emden R. Gansner, Cecilia Magdalena Procopiuc, Suresh Venkatasubramanian:
Rectangular layouts and contact graphs. 8:1-8:28 - Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The priority R-tree: A practically efficient and worst-case optimal R-tree. 9:1-9:30 - Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate distance oracles for geometric spanners. 10:1-10:34 - Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved bounds for scheduling conflicting jobs with minsum criteria. 11:1-11:20 - Rachid Guerraoui, Ron R. Levy, Bastian Pochon, Jim Pugh:
The collective memory of amnesic processes. 12:1-12:31 - George Karakostas:
Faster approximation schemes for fractional multicommodity flow problems. 13:1-13:17 - Daniel Lemire, Owen Kaser:
Hierarchical bin buffering: Online local moments for dynamic external memory arrays. 14:1-14:31 - Elliot Anshelevich, Lisa Zhang:
Path decomposition under a new cost measure with applications to optical network design. 15:1-15:20
Volume 4, Number 2, May 2008
- Adam L. Buchsbaum:
Guest editorial. 16:1 - Daniel K. Blandford, Guy E. Blelloch:
Compact dictionaries for variable-length keys and data with applications. 17:1-17:25 - Ravi Krishna Kolluri:
Provably good moving least squares. 18:1-18:25 - Éric Fusy, Gilles Schaeffer, Dominique Poulalhon:
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling. 19:1-19:48 - László A. Végh, András A. Benczúr:
Primal-dual approach for directed vertex connectivity augmentation and generalizations. 20:1-20:21 - Peter Sanders, David Steurer:
An asymptotic approximation scheme for multigraph edge coloring. 21:1-21:24 - Shuchi Chawla, Anupam Gupta, Harald Räcke:
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. 22:1-22:18 - Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha:
On the approximability of some network design problems. 23:1-23:17 - Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni:
Limitations of cross-monotonic cost-sharing schemes. 24:1-24:25
Volume 4, Number 3, June 2008
- Yefim Dinitz, Shay Solomon:
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. 25:1-25:9 - Laurent Alonso, Edward M. Reingold:
Determining plurality. 26:1-26:19 - Laurent Alonso, Edward M. Reingold:
Average-case lower bounds for the plurality problem. 27:1-27:17 - Hsueh-I Lu, Chia-Chi Yeh:
Balanced parentheses strike back. 28:1-28:13 - Liam Roditty, Mikkel Thorup, Uri Zwick:
Roundtrip spanners and roundtrip routing in directed graphs. 29:1-29:17 - Qian-Ping Gu, Hisao Tamaki:
Optimal branch-decomposition of planar graphs in O(n3) Time. 30:1-30:13 - Artur Czumaj, Christian Sohler:
Testing Euclidean minimum spanning trees in the plane. 31:1-31:23 - Veli Mäkinen, Gonzalo Navarro:
Dynamic entropy-compressed sequences and full-text indexes. 32:1-32:38 - Dariusz R. Kowalski, Alexander A. Shvartsman:
Writing-all deterministically and optimally using a nontrivial number of asynchronous processors. 33:1-33:22 - Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko:
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. 34:1-34:17 - Cun-Quan Zhang, Yongbin Ou:
Clustering, community partition and disjoint spanning trees. 35:1-35:26 - Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang:
Improved algorithms for the minmax-regret 1-center and 1-median problems. 36:1-36:27 - Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup:
Compact name-independent routing with minimum stretch. 37:1-37:12 - Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger:
Getting the best response for your erg. 38:1-38:17
Volume 4, Number 4, August 2008
- Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) algorithm for incremental topological ordering. 39:1-39:14 - Louis Ibarra:
Fully dynamic algorithms for chordal graphs and split graphs. 40:1-40:20 - Amos Korman, David Peleg:
Dynamic routing schemes for graphs with low local density. 41:1-41:18 - Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg:
Label-guided graph exploration by a finite automaton. 42:1-42:18 - Akiko Suzuki, Takeshi Tokuyama:
Dense subgraph problems with output-density conditions. 43:1-43:18 - Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky:
Deterministic conflict-free coloring for intervals: From offline to online. 44:1-44:18 - Nishanth Chandran, Ryan Moriarty, Rafail Ostrovsky, Omkant Pandey, Mohammad Ali Safari, Amit Sahai:
Improved algorithms for optimal embeddings. 45:1-45:14 - Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos:
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. 46:1-46:21 - Markus Bläser:
A new approximation algorithm for the asymmetric TSP with triangle inequality. 47:1-47:15 - Joan Boyar, Paul Medvedev:
The relative worst order ratio applied to seat reservation. 48:1-48:22 - Tim Nieberg, Johann L. Hurink, Walter Kern:
Approximation schemes for wireless networks. 49:1-49:17 - Jens Maßberg, Jens Vygen:
Approximation algorithms for a facility location problem with service capacities. 50:1-50:15 - Chaitanya Swamy, David B. Shmoys:
Fault-tolerant facility location. 51:1-51:27 - Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis:
Atomic congestion games among coalitions. 52:1-52:27
a service of 
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 2024-04-18 20:21 CEST 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:
