Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/BalkovaPS12,
  author       = {L'ubom{\'{\i}}ra Balkov{\'{a}} and
                  Edita Pelantov{\'{a}} and
                  Step{\'{a}}n Starosta},
  title        = {Corrigendum: "On Brlek-Reutenauer conjecture"},
  journal      = {Theor. Comput. Sci.},
  volume       = {465},
  pages        = {73--74},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.09.003},
  doi          = {10.1016/J.TCS.2012.09.003},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BalkovaPS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Jacobs12,
  author       = {Tobias Jacobs},
  title        = {Analytical aspects of tie breaking},
  journal      = {Theor. Comput. Sci.},
  volume       = {465},
  pages        = {1--9},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.09.026},
  doi          = {10.1016/J.TCS.2012.09.026},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Jacobs12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LuLZ12,
  author       = {Huazhong L{\"{u}} and
                  Xianyue Li and
                  Heping Zhang},
  title        = {Matching preclusion for balanced hypercubes},
  journal      = {Theor. Comput. Sci.},
  volume       = {465},
  pages        = {10--20},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.09.020},
  doi          = {10.1016/J.TCS.2012.09.020},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LuLZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/NakprasitN12,
  author       = {Keaitsuda Nakprasit and
                  Kittikorn Nakprasit},
  title        = {Equitable colorings of planar graphs without short cycles},
  journal      = {Theor. Comput. Sci.},
  volume       = {465},
  pages        = {21--27},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.09.014},
  doi          = {10.1016/J.TCS.2012.09.014},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/NakprasitN12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/TakabatakeN12,
  author       = {Toshinori Takabatake and
                  Tomoki Nakamigawa},
  title        = {Node-disjoint paths in a level block of generalized hierarchical completely
                  connected networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {465},
  pages        = {28--34},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.09.016},
  doi          = {10.1016/J.TCS.2012.09.016},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/TakabatakeN12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Tholey12,
  author       = {Torsten Tholey},
  title        = {Linear time algorithms for two disjoint paths problems on directed
                  acyclic graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {465},
  pages        = {35--48},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.09.025},
  doi          = {10.1016/J.TCS.2012.09.025},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Tholey12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Vakhania12,
  author       = {Nodari Vakhania},
  title        = {Branch less, cut more and minimize the number of late equal-length
                  jobs on identical machines},
  journal      = {Theor. Comput. Sci.},
  volume       = {465},
  pages        = {49--60},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.08.031},
  doi          = {10.1016/J.TCS.2012.08.031},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Vakhania12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/WangFJH12,
  author       = {Yan Wang and
                  Jianxi Fan and
                  Xiaohua Jia and
                  He Huang},
  title        = {An algorithm to construct independent spanning trees on parity cubes},
  journal      = {Theor. Comput. Sci.},
  volume       = {465},
  pages        = {61--72},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.08.020},
  doi          = {10.1016/J.TCS.2012.08.020},
  timestamp    = {Fri, 02 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WangFJH12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}