


default search action
Algorithmica, Volume 37, 2003
Volume 37, Number 1, September 2003
- Lars Arge:

The Buffer Tree: A Technique for Designing Batched External Data Structures. 1-24 - Jens Gramm, Rolf Niedermeier, Peter Rossmanith:

Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. 25-42 - Moritz G. Maaß:

Linear Bidirectional On-Line Construction of Affix Trees. 43-74
Volume 37, Number 2, October 2003
- Guy Kortsarz, Zeev Nutov:

Approximating Node Connectivity Problems via Set Covers. 75-92 - Ross M. McConnell:

Linear-Time Recognition of Circular-Arc Graphs. 93-147
Volume 37, Number 3, November 2003
- Francis Y. L. Chin, Stanley P. Y. Fung:

Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? 149-164 - Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein

:
A Distributed Ant Algorithm for Efficiently Patrolling a Network. 165-186 - Magnús M. Halldórsson

, Guy Kortsarz, Hadas Shachnai:
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. 187-209 - Sergio Cabello

, Marc J. van Kreveld:
Approximation Algorithms for Aligning Points. 211-232 - Mauricio Ayala-Rincón

, Paulo D. Conejo:
A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees. 233-241
Volume 37, Number 4, December 2003
- Enrico Angelelli

, Maria Grazia Speranza
, Zsolt Tuza:
Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items. 243-262 - Naoki Abe, Alan W. Biermann, Philip M. Long:

Reinforcement Learning with Immediate Rewards and Linear Hypotheses. 263-293 - Allan Borodin, Morten N. Nielsen, Charles Rackoff:

(Incremental) Priority Algorithms. 295-326 - Daniel Kobler, Udi Rotics:

Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size. 327-346

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














