![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs989.bht:"
@article{DBLP:journals/tcs/DaiGMGXZ24, author = {Sijia Dai and Xinru Guo and Huahua Miao and Guichen Gao and Yicheng Xu and Yong Zhang}, title = {The existence and efficiency of {PMMS} allocations}, journal = {Theor. Comput. Sci.}, volume = {989}, pages = {114388}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114388}, doi = {10.1016/J.TCS.2024.114388}, timestamp = {Sat, 18 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/DaiGMGXZ24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Ding24, author = {Cunsheng Ding}, title = {New support 5-designs from lifted linear codes}, journal = {Theor. Comput. Sci.}, volume = {989}, pages = {114400}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114400}, doi = {10.1016/J.TCS.2024.114400}, timestamp = {Sat, 18 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Ding24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GaikwadM24, author = {Ajinkya Gaikwad and Soumen Maity}, title = {Offensive alliances in graphs}, journal = {Theor. Comput. Sci.}, volume = {989}, pages = {114401}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114401}, doi = {10.1016/J.TCS.2024.114401}, timestamp = {Sat, 18 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GaikwadM24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HamadaM24, author = {Koki Hamada and Shuichi Miyazaki}, title = {Refined computational complexities of Hospitals/Residents problem with regional caps}, journal = {Theor. Comput. Sci.}, volume = {989}, pages = {114389}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114389}, doi = {10.1016/J.TCS.2024.114389}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/HamadaM24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LeeR24, author = {Keenan Lee and Andr{\'{e}} van Renssen}, title = {Generalized sweeping line spanners}, journal = {Theor. Comput. Sci.}, volume = {989}, pages = {114390}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114390}, doi = {10.1016/J.TCS.2024.114390}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/LeeR24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LobeL24, author = {Elisabeth Lobe and Annette Lutz}, title = {Minor embedding in broken chimera and derived graphs is NP-complete}, journal = {Theor. Comput. Sci.}, volume = {989}, pages = {114369}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2023.114369}, doi = {10.1016/J.TCS.2023.114369}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/LobeL24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LundstromRS24, author = {Oskar Lundstr{\"{o}}m and Michel Raynal and Elad Michael Schiller}, title = {Self-stabilizing indulgent zero-degrading binary consensus}, journal = {Theor. Comput. Sci.}, volume = {989}, pages = {114387}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114387}, doi = {10.1016/J.TCS.2024.114387}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/LundstromRS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/SchmidSY24, author = {Stefan Schmid and Jakub Svoboda and Michelle Yeo}, title = {Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation}, journal = {Theor. Comput. Sci.}, volume = {989}, pages = {114353}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2023.114353}, doi = {10.1016/J.TCS.2023.114353}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/SchmidSY24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.