Search dblp for Publications

• > Home > Search

@article{DBLP:journals/jda/AdamaszekP16,
  author       = {Anna Adamaszek and
                  Alexandru Popa},
  title        = {Approximation and hardness results for the maximum edge q-coloring
                  problem},
  journal      = {J. Discrete Algorithms},
  volume       = {38-41},
  pages        = {1--8},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jda.2016.09.003},
  doi          = {10.1016/J.JDA.2016.09.003},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jda/AdamaszekP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/BaiDF16,
  author       = {Haoyue Bai and
                  Antoine Deza and
                  Frantisek Franek},
  title        = {Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete
                  Algorithms 34 {(2015)} 18-22]},
  journal      = {J. Discrete Algorithms},
  volume       = {38-41},
  pages        = {50--51},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jda.2016.05.003},
  doi          = {10.1016/J.JDA.2016.05.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/BaiDF16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/BrlekBF16,
  author       = {Srecko Brlek and
                  Stefano Brocchi and
                  Andrea Frosini},
  title        = {Reconstructing binary matrices with timetabling constraints},
  journal      = {J. Discrete Algorithms},
  volume       = {38-41},
  pages        = {20--31},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jda.2016.07.001},
  doi          = {10.1016/J.JDA.2016.07.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/BrlekBF16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/HanT16,
  author       = {Yijie Han and
                  Tadao Takaoka},
  title        = {An O(n\({}^{\mbox{3}}\)log{\unicode{8289}}log{\unicode{8289}}n/log\({}^{\mbox{2}}\){\unicode{8289}}n)
                  time algorithm for all pairs shortest paths},
  journal      = {J. Discrete Algorithms},
  volume       = {38-41},
  pages        = {9--19},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jda.2016.09.001},
  doi          = {10.1016/J.JDA.2016.09.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/HanT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/KoblerKV16,
  author       = {Johannes K{\"{o}}bler and
                  Sebastian Kuhnert and
                  Oleg Verbitsky},
  title        = {Solving the canonical representation and Star System Problems for
                  proper circular-arc graphs in logspace},
  journal      = {J. Discrete Algorithms},
  volume       = {38-41},
  pages        = {38--49},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jda.2016.03.001},
  doi          = {10.1016/J.JDA.2016.03.001},
  timestamp    = {Thu, 13 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jda/KoblerKV16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/Sritharan16,
  author       = {R. Sritharan},
  title        = {Graph modification problem for some classes of graphs},
  journal      = {J. Discrete Algorithms},
  volume       = {38-41},
  pages        = {32--37},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jda.2016.06.003},
  doi          = {10.1016/J.JDA.2016.06.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/Sritharan16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/WilliamsonS16,
  author       = {Matthew D. Williamson and
                  K. Subramani},
  title        = {Corrigendum to "On the negative cost girth problem in planar networks"
                  [Journal of Discrete Algorithms 35 {(2015)} 40-50]},
  journal      = {J. Discrete Algorithms},
  volume       = {38-41},
  pages        = {52--53},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jda.2016.04.001},
  doi          = {10.1016/J.JDA.2016.04.001},
  timestamp    = {Fri, 09 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/WilliamsonS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}