Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/Bang-JensenY14,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Anders Yeo},
  title        = {The complexity of multicut and mixed multicut problems in (di)graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {87--96},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.10.022},
  doi          = {10.1016/J.TCS.2013.10.022},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Bang-JensenY14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BaudonBPW14,
  author       = {Olivier Baudon and
                  Julien Bensmail and
                  Jakub Przybylo and
                  Mariusz Wozniak},
  title        = {Partitioning powers of traceable or hamiltonian graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {133--137},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.10.016},
  doi          = {10.1016/J.TCS.2013.10.016},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BaudonBPW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BerenbrinkES14,
  author       = {Petra Berenbrink and
                  Robert Els{\"{a}}sser and
                  Thomas Sauerwald},
  title        = {Randomised broadcasting: Memory vs. randomness},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {27--42},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.08.011},
  doi          = {10.1016/J.TCS.2013.08.011},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BerenbrinkES14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HongX14,
  author       = {Zhen{-}Mu Hong and
                  Jun{-}Ming Xu},
  title        = {Vulnerability of super edge-connected networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {75--86},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.10.021},
  doi          = {10.1016/J.TCS.2013.10.021},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HongX14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/OzbudakY14,
  author       = {Ferruh {\"{O}}zbudak and
                  Oguz Yayla},
  title        = {Improved probabilistic decoding of interleaved Reed-Solomon codes
                  and folded Hermitian codes},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {111--123},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.10.025},
  doi          = {10.1016/J.TCS.2013.10.025},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/OzbudakY14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Takaoka14,
  author       = {Tadao Takaoka},
  title        = {Sharing information for the all pairs shortest path problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {43--50},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.09.006},
  doi          = {10.1016/J.TCS.2013.09.006},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Takaoka14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Vaya14,
  author       = {Shailesh Vaya},
  title        = {Information dissemination in unknown radio networks with large labels},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {11--26},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.08.009},
  doi          = {10.1016/J.TCS.2013.08.009},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Vaya14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/VrbaHG14,
  author       = {Zeljko Vrba and
                  P{\aa}l Halvorsen and
                  Carsten Griwodz},
  title        = {A correction to Andersson's fusion tree construction},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {130--132},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.09.028},
  doi          = {10.1016/J.TCS.2013.09.028},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/VrbaHG14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/WagnerM14,
  author       = {Urs Wagner and
                  G{\'{e}}rard Maze},
  title        = {Improvements in closest point search based on dual HKZ-bases},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {62--74},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.10.005},
  doi          = {10.1016/J.TCS.2013.10.005},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WagnerM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/WangF14,
  author       = {Shiying Wang and
                  Kai Feng},
  title        = {Strong matching preclusion for torus networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {97--110},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.10.023},
  doi          = {10.1016/J.TCS.2013.10.023},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WangF14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/XuTZ14,
  author       = {Hui Xu and
                  Jing Tian and
                  Xianzhong Zhao},
  title        = {Monoid-matrix type automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {1--10},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.08.006},
  doi          = {10.1016/J.TCS.2013.08.006},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/XuTZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/XuW14,
  author       = {Renyu Xu and
                  Jian{-}Liang Wu},
  title        = {Total coloring of planar graphs with 7-cycles containing at most two
                  chords},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {124--129},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.08.019},
  doi          = {10.1016/J.TCS.2013.08.019},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/XuW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/YangTMSW14,
  author       = {Guomin Yang and
                  Chik How Tan and
                  Yi Mu and
                  Willy Susilo and
                  Duncan S. Wong},
  title        = {Identity based identification from algebraic coding theory},
  journal      = {Theor. Comput. Sci.},
  volume       = {520},
  pages        = {51--61},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.09.008},
  doi          = {10.1016/J.TCS.2013.09.008},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/YangTMSW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.