- Sergio Cabello:
Approximation algorithms for spreading points. J. Algorithms 62(2): 49-73 (2007) - Amin Coja-Oghlan:
Solving NP-hard semirandom graph problems in polynomial expected time. J. Algorithms 62(1): 19-46 (2007) - Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy:
Computing shortest paths with uncertainty. J. Algorithms 62(1): 1-18 (2007) - Robson da Luz, Mirian Halfeld Ferrari Alves, Martin A. Musicante:
Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator). J. Algorithms 62(3-4): 148-167 (2007) - Narciso Martí-Oliet, Miguel Palomino, Alberto Verdejo:
Strategies and simulations in a semantic framework. J. Algorithms 62(3-4): 95-116 (2007) - Cláudia Nalon, Clare Dixon:
Clausal resolution for normal modal logics. J. Algorithms 62(3-4): 117-134 (2007) - 2006
- Gagan Aggarwal, Rajeev Motwani, An Zhu:
The load rebalancing problem. J. Algorithms 60(1): 42-59 (2006) - Esther M. Arkin, Refael Hassin, Asaf Levin:
Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59(1): 1-18 (2006) - Arye Barkan, Haim Kaplan:
Partial alphabetic trees. J. Algorithms 58(2): 81-103 (2006) - Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger:
A wide-range algorithm for minimal triangulation from an arbitrary ordering. J. Algorithms 58(1): 33-66 (2006) - Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez, Igor E. Shparlinski:
Reconstructing noisy polynomial evaluation in residue rings. J. Algorithms 61(2): 47-59 (2006) - Ian F. Blake, V. Kumar Murty, Guangwu Xu:
Refinements of Miller's algorithm for computing the Weil/Tate pairing. J. Algorithms 58(2): 134-149 (2006) - Zhi-Zhong Chen, Tatsuie Tsukiji:
Computing bounded-degree phylogenetic roots of disconnected graphs. J. Algorithms 59(2): 125-148 (2006) - Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Distance and routing labeling schemes for non-positively curved plane graphs. J. Algorithms 61(2): 60-88 (2006) - Edith Cohen, Martin J. Strauss:
Maintaining time-decaying stream aggregates. J. Algorithms 59(1): 19-36 (2006) - Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff:
A heuristic for the Stacker Crane Problem on trees which is almost surely exact. J. Algorithms 61(1): 1-19 (2006) - Artur Czumaj, Wojciech Rytter:
Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2): 115-143 (2006) - Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy P. Spinrad, Alan Tucker:
Polynomial time recognition of unit circular-arc graphs. J. Algorithms 58(1): 67-78 (2006) - Uriel Feige, Michael Langberg:
The RPR2 rounding technique for semidefinite programs. J. Algorithms 60(1): 1-23 (2006) - Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir:
Semi-matchings for bipartite graphs and load balancing. J. Algorithms 59(1): 53-78 (2006) - Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Space efficient algorithms for directed series-parallel graphs. J. Algorithms 60(2): 85-114 (2006) - Srinivas R. Kashyap, Samir Khuller:
Algorithms for non-uniform size data placement on parallel disks. J. Algorithms 60(2): 144-167 (2006) - Alexander Kesselman, Adi Rosén:
Scheduling policies for CIOQ switches. J. Algorithms 60(1): 60-83 (2006) - Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
On generalized gossiping and broadcasting. J. Algorithms 59(2): 81-106 (2006) - Petr Kolman, Christian Scheideler:
Improved bounds for the unsplittable flow problem. J. Algorithms 61(1): 20-44 (2006) - Monaldo Mastrolilli:
A linear time approximation scheme for the single machine scheduling problem with controllable processing times. J. Algorithms 59(1): 37-52 (2006) - Aranyak Mehta, Scott Shenker, Vijay V. Vazirani:
Posted price profit maximization for multicast by approximating fixed points. J. Algorithms 58(2): 150-164 (2006) - Ilya Safro, Dorit Ron, Achi Brandt:
Graph minimum linear arrangement by multilevel weighted edge contractions. J. Algorithms 60(1): 24-41 (2006) - Bruce E. Sagan, Jaejin Lee:
An algorithmic sign-reversing involution for special rim-hook tableaux. J. Algorithms 59(2): 149-161 (2006) - Jop F. Sibeyn:
External selection. J. Algorithms 58(2): 104-117 (2006)