Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jal/Heitsch05,
  author       = {Christine E. Heitsch},
  title        = {Insufficiency of four known necessary conditions on string unavoidability},
  journal      = {J. Algorithms},
  volume       = {56},
  number       = {2},
  pages        = {96--123},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.jalgor.2004.07.010},
  doi          = {10.1016/J.JALGOR.2004.07.010},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Heitsch05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MakinenNU05,
  author       = {Veli M{\"{a}}kinen and
                  Gonzalo Navarro and
                  Esko Ukkonen},
  title        = {Transposition invariant string matching},
  journal      = {J. Algorithms},
  volume       = {56},
  number       = {2},
  pages        = {124--153},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.jalgor.2004.07.008},
  doi          = {10.1016/J.JALGOR.2004.07.008},
  timestamp    = {Wed, 28 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/MakinenNU05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Nagamochi05,
  author       = {Hiroshi Nagamochi},
  title        = {A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation
                  in a connected graph},
  journal      = {J. Algorithms},
  volume       = {56},
  number       = {2},
  pages        = {77--95},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.jalgor.2005.01.008},
  doi          = {10.1016/J.JALGOR.2005.01.008},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Nagamochi05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/TamirPMR05,
  author       = {Arie Tamir and
                  Justo Puerto and
                  Juan A. Mesa and
                  Antonio M. Rodr{\'{\i}}guez{-}Ch{\'{\i}}a},
  title        = {Conditional location of path and tree shaped facilities on trees},
  journal      = {J. Algorithms},
  volume       = {56},
  number       = {1},
  pages        = {50--75},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.jalgor.2005.01.005},
  doi          = {10.1016/J.JALGOR.2005.01.005},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/TamirPMR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ThilikosSB05,
  author       = {Dimitrios M. Thilikos and
                  Maria J. Serna and
                  Hans L. Bodlaender},
  title        = {Cutwidth {I:} {A} linear time fixed parameter algorithm},
  journal      = {J. Algorithms},
  volume       = {56},
  number       = {1},
  pages        = {1--24},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.jalgor.2004.12.001},
  doi          = {10.1016/J.JALGOR.2004.12.001},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/ThilikosSB05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ThilikosSB05a,
  author       = {Dimitrios M. Thilikos and
                  Maria J. Serna and
                  Hans L. Bodlaender},
  title        = {Cutwidth {II:} Algorithms for partial w-trees of bounded degree},
  journal      = {J. Algorithms},
  volume       = {56},
  number       = {1},
  pages        = {25--49},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.jalgor.2004.12.003},
  doi          = {10.1016/J.JALGOR.2004.12.003},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/ThilikosSB05a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics