Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/BerberichEKS13,
  author       = {Eric Berberich and
                  Pavel Emeliyanenko and
                  Alexander Kobel and
                  Michael Sagraloff},
  title        = {Exact symbolic-numeric computation of planar algebraic curves},
  journal      = {Theor. Comput. Sci.},
  volume       = {491},
  pages        = {1--32},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.04.014},
  doi          = {10.1016/J.TCS.2013.04.014},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BerberichEKS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Cerny13,
  author       = {Anton Cern{\'{y}}},
  title        = {On Prouhet's solution to the equal powers problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {491},
  pages        = {33--46},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.04.001},
  doi          = {10.1016/J.TCS.2013.04.001},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Cerny13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChengSSS13,
  author       = {Eddie Cheng and
                  Shalin Shah and
                  Vyom Shah and
                  Daniel E. Steffy},
  title        = {Strong matching preclusion for augmented cubes},
  journal      = {Theor. Comput. Sci.},
  volume       = {491},
  pages        = {71--77},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.05.002},
  doi          = {10.1016/J.TCS.2013.05.002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChengSSS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DongZCY13,
  author       = {Jianming Dong and
                  An Zhang and
                  Yong Chen and
                  Qifan Yang},
  title        = {Approximation algorithms for two-machine open shop scheduling with
                  batch and delivery coordination},
  journal      = {Theor. Comput. Sci.},
  volume       = {491},
  pages        = {94--102},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.04.025},
  doi          = {10.1016/J.TCS.2013.04.025},
  timestamp    = {Thu, 25 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/DongZCY13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JinXZ13,
  author       = {Jing Jin and
                  Baogang Xu and
                  Xiaoyan Zhang},
  title        = {On the complexity of injective colorings and its generalizations},
  journal      = {Theor. Comput. Sci.},
  volume       = {491},
  pages        = {119--126},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.04.026},
  doi          = {10.1016/J.TCS.2013.04.026},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/JinXZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Krenn13,
  author       = {Daniel Krenn},
  title        = {Analysis of the width-\emph{w}w non-adjacent form in conjunction with
                  hyperelliptic curve cryptography and with lattices},
  journal      = {Theor. Comput. Sci.},
  volume       = {491},
  pages        = {47--70},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.04.006},
  doi          = {10.1016/J.TCS.2013.04.006},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Krenn13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SeoYL13,
  author       = {Jae Woo Seo and
                  Dae Hyun Yum and
                  Pil Joong Lee},
  title        = {Proxy-invisible CCA-secure type-based proxy re-encryption without
                  random oracles},
  journal      = {Theor. Comput. Sci.},
  volume       = {491},
  pages        = {83--93},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.11.026},
  doi          = {10.1016/J.TCS.2012.11.026},
  timestamp    = {Sat, 21 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/SeoYL13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tassa13,
  author       = {Tamir Tassa},
  title        = {Addendum to "Finding all maximally-matchable edges in a bipartite
                  graph" [Theoret. Comput. Sci. 423 {(2012)} 50-58]},
  journal      = {Theor. Comput. Sci.},
  volume       = {491},
  pages        = {136},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.03.015},
  doi          = {10.1016/J.TCS.2013.03.015},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Tassa13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YangW13,
  author       = {Yuxing Yang and
                  Shiying Wang},
  title        = {Fault-free Hamiltonian cycles passing through a linear forest in ternary
                  \emph{n}n-cubes with faulty edges},
  journal      = {Theor. Comput. Sci.},
  volume       = {491},
  pages        = {78--82},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.10.048},
  doi          = {10.1016/J.TCS.2012.10.048},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/YangW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YinZ13,
  author       = {Xiao Yin and
                  Daming Zhu},
  title        = {Sorting genomes by generalized translocations},
  journal      = {Theor. Comput. Sci.},
  volume       = {491},
  pages        = {127--135},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.01.004},
  doi          = {10.1016/J.TCS.2013.01.004},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/YinZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangW13,
  author       = {Shurong Zhang and
                  Shiying Wang},
  title        = {Many-to-many disjoint path covers in \emph{k}k-ary \emph{n}n-cubes},
  journal      = {Theor. Comput. Sci.},
  volume       = {491},
  pages        = {103--118},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.04.002},
  doi          = {10.1016/J.TCS.2013.04.002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ZhangW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics