Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs932.bht:"
@article{DBLP:journals/tcs/BiloGLPR22, author = {Davide Bil{\`{o}} and Luciano Gual{\`{a}} and Stefano Leucci and Guido Proietti and Mirko Rossi}, title = {New approximation algorithms for the heterogeneous weighted delivery problem}, journal = {Theor. Comput. Sci.}, volume = {932}, pages = {102--115}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.08.009}, doi = {10.1016/J.TCS.2022.08.009}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BiloGLPR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChenLWWZZ22, author = {Xujin Chen and Minming Li and Changjun Wang and Chenhao Wang and Mengqi Zhang and Yingchao Zhao}, title = {Mechanisms for dual-role-facility location games: Truthfulness and approximability}, journal = {Theor. Comput. Sci.}, volume = {932}, pages = {69--83}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.08.007}, doi = {10.1016/J.TCS.2022.08.007}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ChenLWWZZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FariaS22, author = {Lu{\'{e}}rbio Faria and U{\'{e}}verton S. Souza}, title = {On the probe problem for (\emph{r}, \emph{{\(\mathscr{l}\)}})-well-coveredness: Algorithms and complexity}, journal = {Theor. Comput. Sci.}, volume = {932}, pages = {56--68}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.08.006}, doi = {10.1016/J.TCS.2022.08.006}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/FariaS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GaoLM22, author = {Xiangyu Gao and Jianzhong Li and Dongjing Miao}, title = {Sublinear-time reductions for big data computing}, journal = {Theor. Comput. Sci.}, volume = {932}, pages = {1--12}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.07.038}, doi = {10.1016/J.TCS.2022.07.038}, timestamp = {Mon, 26 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GaoLM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HongRZ22, author = {Weizhi Hong and Yingli Ran and Zhao Zhang}, title = {Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph}, journal = {Theor. Comput. Sci.}, volume = {932}, pages = {13--20}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.07.039}, doi = {10.1016/J.TCS.2022.07.039}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/HongRZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MiaoY22, author = {Runjie Miao and Jinjiang Yuan}, title = {A note on LP-based approximation algorithms for capacitated facility location problem}, journal = {Theor. Comput. Sci.}, volume = {932}, pages = {31--40}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.08.002}, doi = {10.1016/J.TCS.2022.08.002}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/MiaoY22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MondalRPR22, author = {Debajyoti Mondal and Angelin Jemima Rajasingh and N. Parthiban and Indra Rajasingh}, title = {APX-hardness and approximation for the \emph{k}-burning number problem}, journal = {Theor. Comput. Sci.}, volume = {932}, pages = {21--30}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.08.001}, doi = {10.1016/J.TCS.2022.08.001}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/MondalRPR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/PriyamvadaP22, author = {Priyamvada and B. S. Panda}, title = {Exact square coloring of certain classes of graphs: Complexity and algorithms}, journal = {Theor. Comput. Sci.}, volume = {932}, pages = {84--101}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.08.008}, doi = {10.1016/J.TCS.2022.08.008}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/PriyamvadaP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/SilvaS22, author = {Janio Carlos Nascimento Silva and U{\'{e}}verton S. Souza}, title = {Computing the best-case energy complexity of satisfying assignments in monotone circuits}, journal = {Theor. Comput. Sci.}, volume = {932}, pages = {41--55}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.08.005}, doi = {10.1016/J.TCS.2022.08.005}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/SilvaS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.