Search dblp for Publications

export results for "toc:db/journals/algorithmica/algorithmica37.bht:"

 download as .bib file

@article{DBLP:journals/algorithmica/AbeBL03,
  author       = {Naoki Abe and
                  Alan W. Biermann and
                  Philip M. Long},
  title        = {Reinforcement Learning with Immediate Rewards and Linear Hypotheses},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {4},
  pages        = {263--293},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1038-1},
  doi          = {10.1007/S00453-003-1038-1},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AbeBL03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AngelelliST03,
  author       = {Enrico Angelelli and
                  Maria Grazia Speranza and
                  Zsolt Tuza},
  title        = {Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound
                  on the Items},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {4},
  pages        = {243--262},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1037-2},
  doi          = {10.1007/S00453-003-1037-2},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AngelelliST03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Arge03,
  author       = {Lars Arge},
  title        = {The Buffer Tree: {A} Technique for Designing Batched External Data
                  Structures},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {1},
  pages        = {1--24},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1021-x},
  doi          = {10.1007/S00453-003-1021-X},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Arge03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Ayala-RinconC03,
  author       = {Mauricio Ayala{-}Rinc{\'{o}}n and
                  Paulo D. Conejo},
  title        = {A Linear Time Lower Bound on McCreight and General Updating Algorithms
                  for Suffix Trees},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {3},
  pages        = {233--241},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1034-5},
  doi          = {10.1007/S00453-003-1034-5},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Ayala-RinconC03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BorodinNR03,
  author       = {Allan Borodin and
                  Morten N. Nielsen and
                  Charles Rackoff},
  title        = {(Incremental) Priority Algorithms},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {4},
  pages        = {295--326},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1036-3},
  doi          = {10.1007/S00453-003-1036-3},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BorodinNR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/CabelloK03,
  author       = {Sergio Cabello and
                  Marc J. van Kreveld},
  title        = {Approximation Algorithms for Aligning Points},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {3},
  pages        = {211--232},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1033-6},
  doi          = {10.1007/S00453-003-1033-6},
  timestamp    = {Fri, 15 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CabelloK03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChinF03,
  author       = {Francis Y. L. Chin and
                  Stanley P. Y. Fung},
  title        = {Online Scheduling with Partial Job Values: Does Timesharing or Randomization
                  Help?},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {3},
  pages        = {149--164},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1025-6},
  doi          = {10.1007/S00453-003-1025-6},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChinF03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GrammNR03,
  author       = {Jens Gramm and
                  Rolf Niedermeier and
                  Peter Rossmanith},
  title        = {Fixed-Parameter Algorithms for {CLOSEST} {STRING} and Related Problems},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {1},
  pages        = {25--42},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1028-3},
  doi          = {10.1007/S00453-003-1028-3},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GrammNR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/HalldorssonKS03,
  author       = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Guy Kortsarz and
                  Hadas Shachnai},
  title        = {Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling
                  Dependent Jobs},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {3},
  pages        = {187--209},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1031-8},
  doi          = {10.1007/S00453-003-1031-8},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/HalldorssonKS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KoblerR03,
  author       = {Daniel Kobler and
                  Udi Rotics},
  title        = {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},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {4},
  pages        = {327--346},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1035-4},
  doi          = {10.1007/S00453-003-1035-4},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KoblerR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KortsarzN03,
  author       = {Guy Kortsarz and
                  Zeev Nutov},
  title        = {Approximating Node Connectivity Problems via Set Covers},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {2},
  pages        = {75--92},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1027-4},
  doi          = {10.1007/S00453-003-1027-4},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KortsarzN03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Maass03,
  author       = {Moritz G. Maa{\ss}},
  title        = {Linear Bidirectional On-Line Construction of Affix Trees},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {1},
  pages        = {43--74},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1029-2},
  doi          = {10.1007/S00453-003-1029-2},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Maass03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/McConnell03,
  author       = {Ross M. McConnell},
  title        = {Linear-Time Recognition of Circular-Arc Graphs},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {2},
  pages        = {93--147},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1032-7},
  doi          = {10.1007/S00453-003-1032-7},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/McConnell03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/YanovskiWB03,
  author       = {Vladimir Yanovski and
                  Israel A. Wagner and
                  Alfred M. Bruckstein},
  title        = {A Distributed Ant Algorithm for Efficiently Patrolling a Network},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {3},
  pages        = {165--186},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1030-9},
  doi          = {10.1007/S00453-003-1030-9},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/YanovskiWB03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.