Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/AlvarezBDMS16,
  author       = {Carme {\`{A}}lvarez and
                  Maria J. Blesa and
                  Amalia Duch and
                  Arnau Messegu{\'{e}} and
                  Maria J. Serna},
  title        = {Celebrity games},
  journal      = {Theor. Comput. Sci.},
  volume       = {648},
  pages        = {56--71},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.08.005},
  doi          = {10.1016/J.TCS.2016.08.005},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AlvarezBDMS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoldiV16,
  author       = {Paolo Boldi and
                  Sebastiano Vigna},
  title        = {Efficient optimally lazy algorithms for minimal-interval semantics},
  journal      = {Theor. Comput. Sci.},
  volume       = {648},
  pages        = {8--25},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.07.036},
  doi          = {10.1016/J.TCS.2016.07.036},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BoldiV16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BresarDKKR16,
  author       = {Bostjan Bresar and
                  Paul Dorbec and
                  Sandi Klavzar and
                  Gasper Kosmrlj and
                  Gabriel Renault},
  title        = {Complexity of the game domination problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {648},
  pages        = {1--7},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.07.025},
  doi          = {10.1016/J.TCS.2016.07.025},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BresarDKKR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DuttaHKM16,
  author       = {Tridib Dutta and
                  Lenwood S. Heath and
                  V. S. Anil Kumar and
                  Madhav V. Marathe},
  title        = {Labeled cuts in graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {648},
  pages        = {34--39},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.07.040},
  doi          = {10.1016/J.TCS.2016.07.040},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DuttaHKM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FeigenblatIP16,
  author       = {Guy Feigenblat and
                  Ofra Itzhaki and
                  Ely Porat},
  title        = {Corrigendum to "The frequent items problem, under polynomial decay,
                  in the streaming model" [Theoret. Comput. Sci. 411(34-36) {(2010)}
                  3048-3054]},
  journal      = {Theor. Comput. Sci.},
  volume       = {648},
  pages        = {116},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.09.001},
  doi          = {10.1016/J.TCS.2016.09.001},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FeigenblatIP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FerraioliGV16,
  author       = {Diodato Ferraioli and
                  Paul W. Goldberg and
                  Carmine Ventre},
  title        = {Decentralized dynamics for finite opinion games},
  journal      = {Theor. Comput. Sci.},
  volume       = {648},
  pages        = {96--115},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.08.011},
  doi          = {10.1016/J.TCS.2016.08.011},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/FerraioliGV16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KociumakaRRW16,
  author       = {Tomasz Kociumaka and
                  Jakub Radoszewski and
                  Wojciech Rytter and
                  Tomasz Walen},
  title        = {Maximum number of distinct and nonequivalent nonstandard squares in
                  a word},
  journal      = {Theor. Comput. Sci.},
  volume       = {648},
  pages        = {84--95},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.08.010},
  doi          = {10.1016/J.TCS.2016.08.010},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KociumakaRRW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeOS16,
  author       = {Van Bang Le and
                  Andrea Oversberg and
                  Oliver Schaudt},
  title        = {A unified approach to recognize squares of split graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {648},
  pages        = {26--33},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.07.037},
  doi          = {10.1016/J.TCS.2016.07.037},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LeOS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Zehavi16,
  author       = {Meirav Zehavi},
  title        = {Parameterized approximation algorithms for packing problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {648},
  pages        = {40--55},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.08.004},
  doi          = {10.1016/J.TCS.2016.08.004},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Zehavi16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangF16,
  author       = {Peng Zhang and
                  Bin Fu},
  title        = {The label cut problem with respect to path length and label frequency},
  journal      = {Theor. Comput. Sci.},
  volume       = {648},
  pages        = {72--83},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.08.006},
  doi          = {10.1016/J.TCS.2016.08.006},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ZhangF16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics