Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/AvgustinovichKP16,
  author       = {Sergey V. Avgustinovich and
                  Sergey Kitaev and
                  Vladimir N. Potapov and
                  Vincent Vajnovszki},
  title        = {Gray coding cubic planar maps},
  journal      = {Theor. Comput. Sci.},
  volume       = {616},
  pages        = {59--69},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.12.013},
  doi          = {10.1016/J.TCS.2015.12.013},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AvgustinovichKP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BereczkyDNR16,
  author       = {Nikolett Bereczky and
                  Amalia Duch and
                  Kriszti{\'{a}}n N{\'{e}}meth and
                  Salvador Roura},
  title        = {Quad-kd trees: {A} general framework for kd trees and quad trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {616},
  pages        = {126--140},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.12.030},
  doi          = {10.1016/J.TCS.2015.12.030},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BereczkyDNR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BoseCMRV16,
  author       = {Prosenjit Bose and
                  Jean{-}Lou De Carufel and
                  Pat Morin and
                  Andr{\'{e}} van Renssen and
                  Sander Verdonschot},
  title        = {Towards tight bounds on theta-graphs: More is not always better},
  journal      = {Theor. Comput. Sci.},
  volume       = {616},
  pages        = {70--93},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.12.017},
  doi          = {10.1016/J.TCS.2015.12.017},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BoseCMRV16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DeyMN16,
  author       = {Palash Dey and
                  Neeldhara Misra and
                  Y. Narahari},
  title        = {Kernelization complexity of possible winner and coalitional manipulation
                  problems in voting},
  journal      = {Theor. Comput. Sci.},
  volume       = {616},
  pages        = {111--125},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.12.023},
  doi          = {10.1016/J.TCS.2015.12.023},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DeyMN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EngelfrietMS16,
  author       = {Joost Engelfriet and
                  Sebastian Maneth and
                  Helmut Seidl},
  title        = {Look-ahead removal for total deterministic top-down tree transducers},
  journal      = {Theor. Comput. Sci.},
  volume       = {616},
  pages        = {18--58},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.12.005},
  doi          = {10.1016/J.TCS.2015.12.005},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EngelfrietMS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GurskiWY16,
  author       = {Frank Gurski and
                  Egon Wanke and
                  Eda Yilmaz},
  title        = {Directed NLC-width},
  journal      = {Theor. Comput. Sci.},
  volume       = {616},
  pages        = {1--17},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.11.003},
  doi          = {10.1016/J.TCS.2015.11.003},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GurskiWY16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Jez16,
  author       = {Artur Jez},
  title        = {A really simple approximation of smallest grammar},
  journal      = {Theor. Comput. Sci.},
  volume       = {616},
  pages        = {141--150},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.12.032},
  doi          = {10.1016/J.TCS.2015.12.032},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Jez16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/JiangT16,
  author       = {Dakui Jiang and
                  Jiayin Tan},
  title        = {Scheduling with job rejection and nonsimultaneous machine available
                  time on unrelated parallel machines},
  journal      = {Theor. Comput. Sci.},
  volume       = {616},
  pages        = {94--99},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.12.020},
  doi          = {10.1016/J.TCS.2015.12.020},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/JiangT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LuCGW16,
  author       = {Xiao{-}Tao L{\"{u}} and
                  Jin Chen and
                  Yingjun Guo and
                  Zhi{-}Xiong Wen},
  title        = {On the permutation complexity of the Cantor-like sequences},
  journal      = {Theor. Comput. Sci.},
  volume       = {616},
  pages        = {100--110},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.12.022},
  doi          = {10.1016/J.TCS.2015.12.022},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LuCGW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}