Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/ChenLL13,
  author       = {Lily Chen and
                  Xueliang Li and
                  Huishu Lian},
  title        = {Further hardness results on the rainbow vertex-connection number of
                  graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {481},
  pages        = {18--23},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.02.012},
  doi          = {10.1016/J.TCS.2013.02.012},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChenLL13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FiciZ13,
  author       = {Gabriele Fici and
                  Luca Q. Zamboni},
  title        = {On the least number of palindromes contained in an infinite word},
  journal      = {Theor. Comput. Sci.},
  volume       = {481},
  pages        = {1--8},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.02.013},
  doi          = {10.1016/J.TCS.2013.02.013},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FiciZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GanchevNS13,
  author       = {Antoniy Ganchev and
                  Lata Narayanan and
                  Sunil M. Shende},
  title        = {A tight characterization of strategic games with a unique equilibrium},
  journal      = {Theor. Comput. Sci.},
  volume       = {481},
  pages        = {37--50},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.02.008},
  doi          = {10.1016/J.TCS.2013.02.008},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GanchevNS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachKPT13,
  author       = {Petr A. Golovach and
                  Marcin Kaminski and
                  Dani{\"{e}}l Paulusma and
                  Dimitrios M. Thilikos},
  title        = {Increasing the minimum degree of a graph by contractions},
  journal      = {Theor. Comput. Sci.},
  volume       = {481},
  pages        = {74--84},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.02.030},
  doi          = {10.1016/J.TCS.2013.02.030},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GolovachKPT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KehagiasMP13,
  author       = {Athanasios Kehagias and
                  Dieter Mitsche and
                  Pawel Pralat},
  title        = {Cops and invisible robbers: The cost of drunkenness},
  journal      = {Theor. Comput. Sci.},
  volume       = {481},
  pages        = {100--120},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.01.032},
  doi          = {10.1016/J.TCS.2013.01.032},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KehagiasMP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiAMAL13,
  author       = {Yuan Li and
                  John O. Adeyeye and
                  David Murrugarra and
                  Boris Aguilar and
                  Reinhard C. Laubenbacher},
  title        = {Boolean nested canalizing functions: {A} comprehensive analysis},
  journal      = {Theor. Comput. Sci.},
  volume       = {481},
  pages        = {24--36},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.02.020},
  doi          = {10.1016/J.TCS.2013.02.020},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LiAMAL13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LuLL13,
  author       = {Chia Wei Lu and
                  Chin Lung Lu and
                  Richard C. T. Lee},
  title        = {A new filtration method and a hybrid strategy for approximate string
                  matching},
  journal      = {Theor. Comput. Sci.},
  volume       = {481},
  pages        = {9--17},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.02.022},
  doi          = {10.1016/J.TCS.2013.02.022},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LuLL13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OrdyniakPS13,
  author       = {Sebastian Ordyniak and
                  Dani{\"{e}}l Paulusma and
                  Stefan Szeider},
  title        = {Satisfiability of acyclic and almost acyclic {CNF} formulas},
  journal      = {Theor. Comput. Sci.},
  volume       = {481},
  pages        = {85--99},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.12.039},
  doi          = {10.1016/J.TCS.2012.12.039},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/OrdyniakPS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/OwensGTT13,
  author       = {Nick D. L. Owens and
                  Andrew J. Greensted and
                  Jon Timmis and
                  Andy M. Tyrrell},
  title        = {The Receptor Density Algorithm},
  journal      = {Theor. Comput. Sci.},
  volume       = {481},
  pages        = {51--73},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.10.057},
  doi          = {10.1016/J.TCS.2012.10.057},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/OwensGTT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics