Search dblp for Publications

• > Home > Search

@article{DBLP:journals/jda/AmirP12,
  author       = {Amihood Amir and
                  Haim Parienty},
  title        = {Towards a theory of patches},
  journal      = {J. Discrete Algorithms},
  volume       = {12},
  pages        = {61--73},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jda.2011.12.022},
  doi          = {10.1016/J.JDA.2011.12.022},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/AmirP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/Bonsma12,
  author       = {Paul S. Bonsma},
  title        = {Max-leaves spanning tree is APX-hard for cubic graphs},
  journal      = {J. Discrete Algorithms},
  volume       = {12},
  pages        = {14--23},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jda.2011.06.005},
  doi          = {10.1016/J.JDA.2011.06.005},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/Bonsma12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/GamarnikK12,
  author       = {David Gamarnik and
                  Dmitriy Katz},
  title        = {Correlation decay and deterministic {FPTAS} for counting colorings
                  of a graph},
  journal      = {J. Discrete Algorithms},
  volume       = {12},
  pages        = {29--47},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jda.2010.10.002},
  doi          = {10.1016/J.JDA.2010.10.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/GamarnikK12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/HaynesAP12,
  author       = {Paul S. Haynes and
                  Lyuba Alboul and
                  Jacques Penders},
  title        = {Dynamic graph-based search in unknown environments},
  journal      = {J. Discrete Algorithms},
  volume       = {12},
  pages        = {2--13},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jda.2011.06.004},
  doi          = {10.1016/J.JDA.2011.06.004},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/HaynesAP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/SenftD12,
  author       = {Martin Senft and
                  Tom{\'{a}}s Dvor{\'{a}}k},
  title        = {On-line suffix tree construction with reduced branching},
  journal      = {J. Discrete Algorithms},
  volume       = {12},
  pages        = {48--60},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jda.2012.01.001},
  doi          = {10.1016/J.JDA.2012.01.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/SenftD12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/StewartPJ12,
  author       = {Iain A. Stewart and
                  Dani{\"{e}}l Paulusma and
                  Matthew Johnson},
  title        = {Editorial},
  journal      = {J. Discrete Algorithms},
  volume       = {12},
  pages        = {1},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jda.2011.08.007},
  doi          = {10.1016/J.JDA.2011.08.007},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/StewartPJ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/VernitskiP12,
  author       = {Alexei Vernitski and
                  Artem V. Pyatkin},
  title        = {Astral graphs (threshold graphs), scale-free graphs and related algorithmic
                  questions},
  journal      = {J. Discrete Algorithms},
  volume       = {12},
  pages        = {24--28},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jda.2011.06.003},
  doi          = {10.1016/J.JDA.2011.06.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/VernitskiP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}