Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/JiangZZ12,
  author       = {Haitao Jiang and
                  Daming Zhu and
                  Binhai Zhu},
  title        = {A (1+{\(\epsilon\)})-approximation algorithm for sorting by short
                  block-moves},
  journal      = {Theor. Comput. Sci.},
  volume       = {439},
  pages        = {1--8},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.03.019},
  doi          = {10.1016/J.TCS.2012.03.019},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/JiangZZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KaminskiMM12,
  author       = {Marcin Kaminski and
                  Paul Medvedev and
                  Martin Milanic},
  title        = {Complexity of independent set reconfigurability problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {439},
  pages        = {9--15},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.03.004},
  doi          = {10.1016/J.TCS.2012.03.004},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KaminskiMM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KerivinLM12,
  author       = {Herv{\'{e}} Kerivin and
                  Mathieu Lacroix and
                  Ali Ridha Mahjoub},
  title        = {On the complexity of the Eulerian closed walk with precedence path
                  constraints problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {439},
  pages        = {16--29},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.03.014},
  doi          = {10.1016/J.TCS.2012.03.014},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KerivinLM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MiklosT12,
  author       = {Istv{\'{a}}n Mikl{\'{o}}s and
                  Eric Tannier},
  title        = {Approximating the number of Double Cut-and-Join scenarios},
  journal      = {Theor. Comput. Sci.},
  volume       = {439},
  pages        = {30--40},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.03.006},
  doi          = {10.1016/J.TCS.2012.03.006},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MiklosT12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/NikolopoulosPP12,
  author       = {Stavros D. Nikolopoulos and
                  Leonidas Palios and
                  Charis Papadopoulos},
  title        = {A fully dynamic algorithm for the recognition of P\({}_{\mbox{4}}\)-sparse
                  graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {439},
  pages        = {41--57},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.03.020},
  doi          = {10.1016/J.TCS.2012.03.020},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/NikolopoulosPP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Prodinger12,
  author       = {Helmut Prodinger},
  title        = {Approximate counting with m counters: {A} detailed analysis},
  journal      = {Theor. Comput. Sci.},
  volume       = {439},
  pages        = {58--68},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.03.016},
  doi          = {10.1016/J.TCS.2012.03.016},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Prodinger12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/XinMZW12,
  author       = {Qin Xin and
                  Fredrik Manne and
                  Yan Zhang and
                  Xin Wang},
  title        = {Almost optimal distributed {M2M} multicasting in wireless mesh networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {439},
  pages        = {69--82},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.03.015},
  doi          = {10.1016/J.TCS.2012.03.015},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/XinMZW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}