Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs767.bht:"
@article{DBLP:journals/tcs/ElbassioniRR19, author = {Khaled M. Elbassioni and Imran Rauf and Saurabh Ray}, title = {A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs}, journal = {Theor. Comput. Sci.}, volume = {767}, pages = {26--33}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.09.027}, doi = {10.1016/J.TCS.2018.09.027}, timestamp = {Fri, 12 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ElbassioniRR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GhosalNN19, author = {Pratik Ghosal and Meghana Nasre and Prajakta Nimbhorkar}, title = {Rank-maximal matchings - structure and algorithms}, journal = {Theor. Comput. Sci.}, volume = {767}, pages = {73--82}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.09.033}, doi = {10.1016/J.TCS.2018.09.033}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GhosalNN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HudryL19, author = {Olivier Hudry and Antoine Lobstein}, title = {Unique (optimal) solutions: Complexity results for identifying and locating-dominating codes}, journal = {Theor. Comput. Sci.}, volume = {767}, pages = {83--102}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.09.034}, doi = {10.1016/J.TCS.2018.09.034}, timestamp = {Fri, 12 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/HudryL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/JiangGM19, author = {Peng Jiang and Fuchun Guo and Yi Mu}, title = {Efficient identity-based broadcast encryption with keyword search against insider attacks for database systems}, journal = {Theor. Comput. Sci.}, volume = {767}, pages = {51--72}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.09.030}, doi = {10.1016/J.TCS.2018.09.030}, timestamp = {Thu, 28 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/JiangGM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/XiaoZMC19, author = {Yuzhi Xiao and Haixing Zhao and Yaping Mao and Guanrong Chen}, title = {Invulnerability of planar two-tree networks}, journal = {Theor. Comput. Sci.}, volume = {767}, pages = {16--25}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.09.021}, doi = {10.1016/J.TCS.2018.09.021}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/XiaoZMC19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/YangLW19, author = {Yuxing Yang and Jing Li and Shiying Wang}, title = {Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary \emph{n}-cubes}, journal = {Theor. Comput. Sci.}, volume = {767}, pages = {1--15}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.09.020}, doi = {10.1016/J.TCS.2018.09.020}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/YangLW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ZhangHGL19, author = {Zhen Zhang and Shuqiang Huang and Dong Guo and Yonghui Li}, title = {{RVCCC:} {A} new variational network of cube-connected cycles and its topological properties}, journal = {Theor. Comput. Sci.}, volume = {767}, pages = {34--50}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.09.028}, doi = {10.1016/J.TCS.2018.09.028}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ZhangHGL19.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.