Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/BirxDHK21,
  author       = {Alexander Birx and
                  Yann Disser and
                  Alexander V. Hopp and
                  Christina Karousatou},
  title        = {An improved lower bound for competitive graph exploration},
  journal      = {Theor. Comput. Sci.},
  volume       = {868},
  pages        = {65--86},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.tcs.2021.04.003},
  doi          = {10.1016/J.TCS.2021.04.003},
  timestamp    = {Sun, 16 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BirxDHK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChalopinDDLM21,
  author       = {J{\'{e}}r{\'{e}}mie Chalopin and
                  Shantanu Das and
                  Yann Disser and
                  Arnaud Labourel and
                  Mat{\'{u}}s Mihal{\'{a}}k},
  title        = {Collaborative delivery on a fixed path with homogeneous energy-constrained
                  agents},
  journal      = {Theor. Comput. Sci.},
  volume       = {868},
  pages        = {87--96},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.tcs.2021.04.004},
  doi          = {10.1016/J.TCS.2021.04.004},
  timestamp    = {Sun, 16 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ChalopinDDLM21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FrosiniPR21,
  author       = {Andrea Frosini and
                  Christophe Picouleau and
                  Simone Rinaldi},
  title        = {New sufficient conditions on the degree sequences of uniform hypergraphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {868},
  pages        = {97--111},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.tcs.2021.04.006},
  doi          = {10.1016/J.TCS.2021.04.006},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FrosiniPR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeegerHKNRS21,
  author       = {Klaus Heeger and
                  Anne{-}Sophie Himmel and
                  Frank Kammer and
                  Rolf Niedermeier and
                  Malte Renken and
                  Andrej Sajenko},
  title        = {Multistage graph problems on a global budget},
  journal      = {Theor. Comput. Sci.},
  volume       = {868},
  pages        = {46--64},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.tcs.2021.04.002},
  doi          = {10.1016/J.TCS.2021.04.002},
  timestamp    = {Sun, 16 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/HeegerHKNRS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ItoKKO21,
  author       = {Takehiro Ito and
                  Naoyuki Kamiyama and
                  Yusuke Kobayashi and
                  Yoshio Okamoto},
  title        = {Algorithms for gerrymandering over graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {868},
  pages        = {30--45},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.tcs.2021.03.037},
  doi          = {10.1016/J.TCS.2021.03.037},
  timestamp    = {Wed, 05 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ItoKKO21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LehnerL21,
  author       = {Florian Lehner and
                  Christian Lindorfer},
  title        = {Comparing consecutive letter counts in multiple context-free languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {868},
  pages        = {1--5},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.tcs.2021.03.034},
  doi          = {10.1016/J.TCS.2021.03.034},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/LehnerL21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiDYR21,
  author       = {Wenjun Li and
                  Yang Ding and
                  Yongjie Yang and
                  Guozhen Rong},
  title        = {A (2{\unicode{8239}}+{\unicode{8239}}\emph{{\unicode{1013}}})\emph{k}-vertex
                  kernel for the dual coloring problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {868},
  pages        = {6--11},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.tcs.2021.03.035},
  doi          = {10.1016/J.TCS.2021.03.035},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/LiDYR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShiWYCZFCH21,
  author       = {Qihao Shi and
                  Can Wang and
                  Deshi Ye and
                  Jiawei Chen and
                  Sheng Zhou and
                  Yan Feng and
                  Chun Chen and
                  Yanhao Huang},
  title        = {Profit maximization for competitive social advertising},
  journal      = {Theor. Comput. Sci.},
  volume       = {868},
  pages        = {12--29},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.tcs.2021.03.036},
  doi          = {10.1016/J.TCS.2021.03.036},
  timestamp    = {Tue, 26 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ShiWYCZFCH21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics