default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs1026.bht:"
@article{DBLP:journals/tcs/AbboudR25, author = {Elie Abboud and Noga Ron{-}Zewi}, title = {Finer-grained reductions in fine-grained hardness of approximation}, journal = {Theor. Comput. Sci.}, volume = {1026}, pages = {114976}, year = {2025}, url = {https://doi.org/10.1016/j.tcs.2024.114976}, doi = {10.1016/J.TCS.2024.114976}, timestamp = {Sun, 22 Dec 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AbboudR25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BarrettKPT25, author = {Jordan Barrett and Bogumil Kaminski and Pawel Pralat and Fran{\c{c}}ois Th{\'{e}}berge}, title = {Self-similarity of communities of the {ABCD} model}, journal = {Theor. Comput. Sci.}, volume = {1026}, pages = {115012}, year = {2025}, url = {https://doi.org/10.1016/j.tcs.2024.115012}, doi = {10.1016/J.TCS.2024.115012}, timestamp = {Thu, 12 Dec 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BarrettKPT25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BonifaciD25, author = {Vincenzo Bonifaci and Helena Rivera Dallorto}, title = {Egalitarian roommate allocations: Complexity and stability}, journal = {Theor. Comput. Sci.}, volume = {1026}, pages = {115009}, year = {2025}, url = {https://doi.org/10.1016/j.tcs.2024.115009}, doi = {10.1016/J.TCS.2024.115009}, timestamp = {Thu, 12 Dec 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BonifaciD25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChenYTWCY25, author = {Shuzhen Chen and Yuan Yuan and Youming Tao and Tianzhu Wang and Zhipeng Cai and Dongxiao Yu}, title = {Adaptive pruning-based Newton's method for distributed learning}, journal = {Theor. Comput. Sci.}, volume = {1026}, pages = {114987}, year = {2025}, url = {https://doi.org/10.1016/j.tcs.2024.114987}, doi = {10.1016/J.TCS.2024.114987}, timestamp = {Thu, 12 Dec 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChenYTWCY25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ConstantinP25, author = {Maria Constantin and Alexandru Popa}, title = {Exact and approximation algorithms for the contiguous translocation distance problem}, journal = {Theor. Comput. Sci.}, volume = {1026}, pages = {115003}, year = {2025}, url = {https://doi.org/10.1016/j.tcs.2024.115003}, doi = {10.1016/J.TCS.2024.115003}, timestamp = {Thu, 12 Dec 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ConstantinP25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GimaKKOO25, author = {Tatsuya Gima and Soh Kumabe and Kazuhiro Kurita and Yuto Okada and Yota Otachi}, title = {Dichotomies for tree minor containment with structural parameters}, journal = {Theor. Comput. Sci.}, volume = {1026}, pages = {114984}, year = {2025}, url = {https://doi.org/10.1016/j.tcs.2024.114984}, doi = {10.1016/J.TCS.2024.114984}, timestamp = {Sun, 22 Dec 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GimaKKOO25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GuoLG25, author = {Hongjie Guo and Jianzhong Li and Hong Gao}, title = {Towards strong regret minimization sets: Balancing freshness and diversity in data selection}, journal = {Theor. Comput. Sci.}, volume = {1026}, pages = {114986}, year = {2025}, url = {https://doi.org/10.1016/j.tcs.2024.114986}, doi = {10.1016/J.TCS.2024.114986}, timestamp = {Fri, 13 Dec 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GuoLG25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KakimuraN25, author = {Naonori Kakimura and Tomohiro Nakayoshi}, title = {Deterministic primal-dual algorithms for online k-way matching with delays}, journal = {Theor. Comput. Sci.}, volume = {1026}, pages = {114988}, year = {2025}, url = {https://doi.org/10.1016/j.tcs.2024.114988}, doi = {10.1016/J.TCS.2024.114988}, timestamp = {Thu, 12 Dec 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KakimuraN25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KobayashiMS25, author = {Yusuke Kobayashi and Ryoga Mahara and Souta Sakamoto}, title = {{EFX} allocations for indivisible chores: Matching-based approach}, journal = {Theor. Comput. Sci.}, volume = {1026}, pages = {115010}, year = {2025}, url = {https://doi.org/10.1016/j.tcs.2024.115010}, doi = {10.1016/J.TCS.2024.115010}, timestamp = {Thu, 12 Dec 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KobayashiMS25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MarcusSZ25, author = {Shoshana Marcus and Dina Sokol and Sarah Zelikovitz}, title = {Exact and inexact search for 2d side-sharing tandems}, journal = {Theor. Comput. Sci.}, volume = {1026}, pages = {115005}, year = {2025}, url = {https://doi.org/10.1016/j.tcs.2024.115005}, doi = {10.1016/J.TCS.2024.115005}, timestamp = {Thu, 12 Dec 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MarcusSZ25.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/PalagiriSY25, author = {Venkata Subba Reddy Palagiri and Guru Pratap Sharma and Ismael G. Yero}, title = {Complexity issues concerning the quadruple Roman domination problem in graphs}, journal = {Theor. Comput. Sci.}, volume = {1026}, pages = {115013}, year = {2025}, url = {https://doi.org/10.1016/j.tcs.2024.115013}, doi = {10.1016/J.TCS.2024.115013}, timestamp = {Thu, 12 Dec 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/PalagiriSY25.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.