Search dblp for Publications

export results for "toc:db/journals/jal/jal42.bht:"

 download as .bib file

@article{DBLP:journals/jal/ArataIMF02,
  author       = {Kouji Arata and
                  Satoru Iwata and
                  Kazuhisa Makino and
                  Satoru Fujishige},
  title        = {Locating Sources to Meet Flow Demands in Undirected Networks},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {1},
  pages        = {54--68},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2001.1203},
  doi          = {10.1006/JAGM.2001.1203},
  timestamp    = {Wed, 16 May 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/ArataIMF02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/AsanoW02,
  author       = {Takao Asano and
                  David P. Williamson},
  title        = {Improved Approximation Algorithms for {MAX} {SAT}},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {1},
  pages        = {173--202},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2001.1202},
  doi          = {10.1006/JAGM.2001.1202},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/AsanoW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BahigN02,
  author       = {Hatem M. Bahig and
                  Ken Nakamula},
  title        = {Some Properties of Nonstar Steps in Addition Chains and New Cases
                  Where the Scholz Conjecture Is True},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {2},
  pages        = {304--316},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2002.1212},
  doi          = {10.1006/JAGM.2002.1212},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BahigN02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BakerG02,
  author       = {Brenda S. Baker and
                  Raffaele Giancarlo},
  title        = {Sparse Dynamic Programming for Longest Common Subsequence from Fragments},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {2},
  pages        = {231--254},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2002.1214},
  doi          = {10.1006/JAGM.2002.1214},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BakerG02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Bar-YehudaR02,
  author       = {Reuven Bar{-}Yehuda and
                  Dror Rawitz},
  title        = {Approximating Element-Weighted Vertex Deletion Problems for the Complete
                  k-Partite Property},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {1},
  pages        = {20--40},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2001.1196},
  doi          = {10.1006/JAGM.2001.1196},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Bar-YehudaR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BradfordGLR02,
  author       = {Phillip G. Bradford and
                  Mordecai J. Golin and
                  Lawrence L. Larmore and
                  Wojciech Rytter},
  title        = {Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming
                  with the Monge Property},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {2},
  pages        = {277--303},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2002.1213},
  doi          = {10.1006/JAGM.2002.1213},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BradfordGLR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Damian-IordacheP02,
  author       = {Mirela Damian{-}Iordache and
                  Sriram V. Pemmaraju},
  title        = {A (2+epsilon)-Approximation Scheme for Minimum Domination on Circle
                  Graphs},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {2},
  pages        = {255--276},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2001.1206},
  doi          = {10.1006/JAGM.2001.1206},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Damian-IordacheP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/HalldorssonK02,
  author       = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Guy Kortsarz},
  title        = {Tools for Multicoloring with Applications to Planar Graphs and Partial
                  k-Trees},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {2},
  pages        = {334--366},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2001.1210},
  doi          = {10.1006/JAGM.2001.1210},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/HalldorssonK02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/HalperinSG02,
  author       = {Dan Halperin and
                  Micha Sharir and
                  Kenneth Y. Goldberg},
  title        = {The 2-Center Problem with Obstacles},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {1},
  pages        = {109--134},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2001.1194},
  doi          = {10.1006/JAGM.2001.1194},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/HalperinSG02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Liu02,
  author       = {Pangfeng Liu},
  title        = {Broadcast Scheduling Optimization for Heterogeneous Cluster Systems},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {1},
  pages        = {135--152},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2001.1204},
  doi          = {10.1006/JAGM.2001.1204},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Liu02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/MeyerS02,
  author       = {Ulrich Meyer and
                  Jop F. Sibeyn},
  title        = {Oblivious Gossiping on Tori},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {1},
  pages        = {1--19},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2001.1200},
  doi          = {10.1006/JAGM.2001.1200},
  timestamp    = {Tue, 25 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/MeyerS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/NishimuraRT02,
  author       = {Naomi Nishimura and
                  Prabhakar Ragde and
                  Dimitrios M. Thilikos},
  title        = {On Graph Powers for Leaf-Labeled Trees},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {1},
  pages        = {69--108},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2001.1195},
  doi          = {10.1006/JAGM.2001.1195},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/NishimuraRT02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/NykanenU02,
  author       = {Matti Nyk{\"{a}}nen and
                  Esko Ukkonen},
  title        = {The Exact Path Length Problem},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {1},
  pages        = {41--53},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2001.1201},
  doi          = {10.1006/JAGM.2001.1201},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/NykanenU02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Pippenger02,
  author       = {Nicholas Pippenger},
  title        = {Analysis of Carry Propagation in Addition: An Elementary Approach},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {2},
  pages        = {317--333},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2002.1216},
  doi          = {10.1006/JAGM.2002.1216},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Pippenger02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/SubramanianM02,
  author       = {C. R. Subramanian and
                  C. E. Veni Madhavan},
  title        = {General Partitioning on Random Graphs},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {1},
  pages        = {153--172},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2001.1197},
  doi          = {10.1006/JAGM.2001.1197},
  timestamp    = {Tue, 14 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/SubramanianM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Thorup02,
  author       = {Mikkel Thorup},
  title        = {Randomized Sorting in O(n log log n) Time and Linear Space Using Addition,
                  Shift, and Bit-wise Boolean Operations},
  journal      = {J. Algorithms},
  volume       = {42},
  number       = {2},
  pages        = {205--230},
  year         = {2002},
  url          = {https://doi.org/10.1006/jagm.2002.1211},
  doi          = {10.1006/JAGM.2002.1211},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/Thorup02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.