Search dblp for Publications

export results for "toc:db/journals/tcs/tcs535.bht:"

 download as .bib file

@article{DBLP:journals/tcs/AbramsC14,
  author       = {Lowell Abrams and
                  Dena S. Cowen{-}Morton},
  title        = {A family of Nim-like arrays: The Locator Theorem},
  journal      = {Theor. Comput. Sci.},
  volume       = {535},
  pages        = {31--37},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.03.032},
  doi          = {10.1016/J.TCS.2014.03.032},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AbramsC14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Allahbakhshi14,
  author       = {Mahsa Allahbakhshi},
  title        = {Computing degree and class degree},
  journal      = {Theor. Comput. Sci.},
  volume       = {535},
  pages        = {59--64},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.04.008},
  doi          = {10.1016/J.TCS.2014.04.008},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Allahbakhshi14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CicaleseCGMV14,
  author       = {Ferdinando Cicalese and
                  Gennaro Cordasco and
                  Luisa Gargano and
                  Martin Milanic and
                  Ugo Vaccaro},
  title        = {Latency-bounded target set selection in social networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {535},
  pages        = {1--15},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.02.027},
  doi          = {10.1016/J.TCS.2014.02.027},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/CicaleseCGMV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DengZ14,
  author       = {Lunzhi Deng and
                  Jiwen Zeng},
  title        = {Two new identity-based threshold ring signature schemes},
  journal      = {Theor. Comput. Sci.},
  volume       = {535},
  pages        = {38--45},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.04.002},
  doi          = {10.1016/J.TCS.2014.04.002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DengZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HuS14,
  author       = {Fu{-}Tao Hu and
                  Moo Young Sohn},
  title        = {The algorithmic complexity of bondage and reinforcement problems in
                  bipartite graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {535},
  pages        = {46--53},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.04.005},
  doi          = {10.1016/J.TCS.2014.04.005},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HuS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OumSV14,
  author       = {Sang{-}il Oum and
                  Sigve Hortemo S{\ae}ther and
                  Martin Vatshelle},
  title        = {Faster algorithms for vertex partitioning problems parameterized by
                  clique-width},
  journal      = {Theor. Comput. Sci.},
  volume       = {535},
  pages        = {16--24},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.03.024},
  doi          = {10.1016/J.TCS.2014.03.024},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/OumSV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Song14,
  author       = {Yinglei Song},
  title        = {An improved parameterized algorithm for the independent feedback vertex
                  set problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {535},
  pages        = {25--30},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.03.031},
  doi          = {10.1016/J.TCS.2014.03.031},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Song14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangSZ14,
  author       = {Yaping Zhang and
                  Yishuo Shi and
                  Zhao Zhang},
  title        = {Approximation algorithm for the minimum weight connected k-subgraph
                  cover problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {535},
  pages        = {54--58},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.03.026},
  doi          = {10.1016/J.TCS.2014.03.026},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ZhangSZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics