Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/LuoWGC14,
  author       = {Weizhong Luo and
                  Jianxin Wang and
                  Jiong Guo and
                  Jianer Chen},
  title        = {Parameterized complexity of Max-lifetime Target Coverage in wireless
                  sensor networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {518},
  pages        = {32--41},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.06.008},
  doi          = {10.1016/J.TCS.2013.06.008},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LuoWGC14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/OlsenV14,
  author       = {Martin Olsen and
                  Anastasios Viglas},
  title        = {On the approximability of the link building problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {518},
  pages        = {96--116},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.08.003},
  doi          = {10.1016/J.TCS.2013.08.003},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/OlsenV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/PelantovaS14,
  author       = {Edita Pelantov{\'{a}} and
                  Step{\'{a}}n Starosta},
  title        = {Palindromic richness for languages invariant under more symmetries},
  journal      = {Theor. Comput. Sci.},
  volume       = {518},
  pages        = {42--63},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.07.021},
  doi          = {10.1016/J.TCS.2013.07.021},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PelantovaS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ReidenbachS14,
  author       = {Daniel Reidenbach and
                  Markus L. Schmid},
  title        = {Regular and context-free pattern languages over small alphabets},
  journal      = {Theor. Comput. Sci.},
  volume       = {518},
  pages        = {80--95},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.07.035},
  doi          = {10.1016/J.TCS.2013.07.035},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ReidenbachS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/RuggieriESW14,
  author       = {Salvatore Ruggieri and
                  Pavlos Eirinakis and
                  K. Subramani and
                  Piotr Wojciechowski},
  title        = {On the complexity of quantified linear systems},
  journal      = {Theor. Comput. Sci.},
  volume       = {518},
  pages        = {128--134},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.08.001},
  doi          = {10.1016/J.TCS.2013.08.001},
  timestamp    = {Fri, 09 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RuggieriESW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ventre14,
  author       = {Carmine Ventre},
  title        = {Truthful optimization using mechanisms with verification},
  journal      = {Theor. Comput. Sci.},
  volume       = {518},
  pages        = {64--79},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.07.034},
  doi          = {10.1016/J.TCS.2013.07.034},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ventre14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/WanMY14,
  author       = {Long Wan and
                  Ran Ma and
                  Jinjiang Yuan},
  title        = {Primary-secondary bicriteria scheduling on identical machines to minimize
                  the total completion time of all jobs and the maximum T-time of all
                  machines},
  journal      = {Theor. Comput. Sci.},
  volume       = {518},
  pages        = {117--123},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.05.034},
  doi          = {10.1016/J.TCS.2013.05.034},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WanMY14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/WangFK14,
  author       = {Weifan Wang and
                  Stephen Finbow and
                  Jiangxu Kong},
  title        = {The 2-surviving rate of planar graphs without 6-cycles},
  journal      = {Theor. Comput. Sci.},
  volume       = {518},
  pages        = {22--31},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.05.025},
  doi          = {10.1016/J.TCS.2013.05.025},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WangFK14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/WangLWL14,
  author       = {Huijuan Wang and
                  Bin Liu and
                  Jianliang Wu and
                  Guizhen Liu},
  title        = {Total coloring of embedded graphs with maximum degree at least seven},
  journal      = {Theor. Comput. Sci.},
  volume       = {518},
  pages        = {1--9},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.04.030},
  doi          = {10.1016/J.TCS.2013.04.030},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WangLWL14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/WuX14,
  author       = {Jian{-}Liang Wu and
                  Ling Xue},
  title        = {Edge colorings of planar graphs without 5-cycles with two chords},
  journal      = {Theor. Comput. Sci.},
  volume       = {518},
  pages        = {124--127},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.07.027},
  doi          = {10.1016/J.TCS.2013.07.027},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WuX14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ZhangCT14,
  author       = {Yong Zhang and
                  Francis Y. L. Chin and
                  Hing{-}Fung Ting},
  title        = {Constant-competitive tree node assignment},
  journal      = {Theor. Comput. Sci.},
  volume       = {518},
  pages        = {10--21},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.05.014},
  doi          = {10.1016/J.TCS.2013.05.014},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ZhangCT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.