Search dblp for Publications

• > Home > Search

@article{DBLP:journals/jda/ArslanHHW15,
  author       = {Abdullah N. Arslan and
                  Dan He and
                  Yu He and
                  Xindong Wu},
  title        = {Pattern matching with wildcards and length constraints using maximum
                  network flow},
  journal      = {J. Discrete Algorithms},
  volume       = {35},
  pages        = {9--16},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.jda.2015.08.003},
  doi          = {10.1016/J.JDA.2015.08.003},
  timestamp    = {Thu, 16 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jda/ArslanHHW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/BygiG15,
  author       = {Mojtaba Nouri Bygi and
                  Mohammad Ghodsi},
  title        = {Near optimal line segment queries in simple polygons},
  journal      = {J. Discrete Algorithms},
  volume       = {35},
  pages        = {51--61},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.jda.2015.10.002},
  doi          = {10.1016/J.JDA.2015.10.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/BygiG15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/GanMZ15,
  author       = {Heng{-}Soon Gan and
                  Hamid Mokhtar and
                  Sanming Zhou},
  title        = {Forwarding and optical indices of 4-regular circulant networks},
  journal      = {J. Discrete Algorithms},
  volume       = {35},
  pages        = {27--39},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.jda.2015.09.002},
  doi          = {10.1016/J.JDA.2015.09.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/GanMZ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/Gavril15,
  author       = {Fanica Gavril},
  title        = {Algorithms for {GA-H} reduced graphs},
  journal      = {J. Discrete Algorithms},
  volume       = {35},
  pages        = {17--26},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.jda.2015.09.001},
  doi          = {10.1016/J.JDA.2015.09.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/Gavril15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/PurcellR15,
  author       = {Christopher Purcell and
                  M. Puck Rombach},
  title        = {On the complexity of role colouring planar graphs, trees and cographs},
  journal      = {J. Discrete Algorithms},
  volume       = {35},
  pages        = {1--8},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.jda.2015.08.001},
  doi          = {10.1016/J.JDA.2015.08.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/PurcellR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/WeiHLP15,
  author       = {Chia{-}Chen Wei and
                  Sun{-}Yuan Hsieh and
                  Chia{-}Wei Lee and
                  Sheng{-}Lung Peng},
  title        = {An improved approximation algorithm for the partial-terminal Steiner
                  tree problem with edge cost 1 or 2},
  journal      = {J. Discrete Algorithms},
  volume       = {35},
  pages        = {62--71},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.jda.2015.10.003},
  doi          = {10.1016/J.JDA.2015.10.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/WeiHLP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/WilliamsonS15,
  author       = {Matthew D. Williamson and
                  K. Subramani},
  title        = {On the negative cost girth problem in planar networks},
  journal      = {J. Discrete Algorithms},
  volume       = {35},
  pages        = {40--50},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.jda.2015.10.001},
  doi          = {10.1016/J.JDA.2015.10.001},
  timestamp    = {Fri, 09 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/WilliamsonS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}