Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/BaoL12,
  author       = {Xiaoguang Bao and
                  Zhaohui Liu},
  title        = {Approximation algorithms for single vehicle scheduling problems with
                  release and service times on a tree or cycle},
  journal      = {Theor. Comput. Sci.},
  volume       = {434},
  pages        = {1--10},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.046},
  doi          = {10.1016/J.TCS.2012.01.046},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BaoL12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BonatoMP12,
  author       = {Anthony Bonato and
                  Margaret{-}Ellen Messinger and
                  Pawel Pralat},
  title        = {Fighting constrained fires in graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {434},
  pages        = {11--22},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.041},
  doi          = {10.1016/J.TCS.2012.01.041},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BonatoMP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CrochemoreIKRTW12,
  author       = {Maxime Crochemore and
                  Costas S. Iliopoulos and
                  Marcin Kubica and
                  M. Sohel Rahman and
                  German Tischler and
                  Tomasz Walen},
  title        = {Improved algorithms for the range next value problem and applications},
  journal      = {Theor. Comput. Sci.},
  volume       = {434},
  pages        = {23--34},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.02.015},
  doi          = {10.1016/J.TCS.2012.02.015},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CrochemoreIKRTW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KarakostasKM12,
  author       = {George Karakostas and
                  Jeff Kinne and
                  Dieter van Melkebeek},
  title        = {On derandomization and average-case complexity of monotone functions},
  journal      = {Theor. Comput. Sci.},
  volume       = {434},
  pages        = {35--44},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.02.017},
  doi          = {10.1016/J.TCS.2012.02.017},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/KarakostasKM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LiaoTH12,
  author       = {Ching{-}Jong Liao and
                  Hsin{-}Hui Tsou and
                  Kuo{-}Ling Huang},
  title        = {Neighborhood search procedures for single machine tardiness scheduling
                  with sequence-dependent setups},
  journal      = {Theor. Comput. Sci.},
  volume       = {434},
  pages        = {45--52},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.043},
  doi          = {10.1016/J.TCS.2012.01.043},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LiaoTH12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ShangLL12,
  author       = {Yun Shang and
                  Xian Lu and
                  Ruqian Lu},
  title        = {A theory of computation based on unsharp quantum logic: Finite state
                  automata and pushdown automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {434},
  pages        = {53--86},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.02.018},
  doi          = {10.1016/J.TCS.2012.02.018},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ShangLL12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ueno12,
  author       = {Kenya Ueno},
  title        = {A stronger {LP} bound for formula size lower bounds via clique constraints},
  journal      = {Theor. Comput. Sci.},
  volume       = {434},
  pages        = {87--97},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.02.005},
  doi          = {10.1016/J.TCS.2012.02.005},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ueno12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/YoshidaK12,
  author       = {Yuichi Yoshida and
                  Yusuke Kobayashi},
  title        = {Testing the (s, t)-disconnectivity of graphs and digraphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {434},
  pages        = {98--113},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.045},
  doi          = {10.1016/J.TCS.2012.01.045},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/YoshidaK12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}